131 search results - page 12 / 27 » On efficiently summarizing categorical databases |
CCR
2006
14 years 10 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
177
click to vote
SIGMOD
2006
ACM
15 years 10 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
JUCS
2002
14 years 9 months ago
2002
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
MMDB
2004
ACM
15 years 3 months ago
2004
ACM
With the proliferation of image data, the need to search and retrieve images efficiently and accurately from a large image database or a collection of image databases has drastica...
185
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...