721 search results - page 35 / 145 » Supporting top-k join queries in relational databases |
DOLAP
2003
ACM
15 years 2 months ago
2003
ACM
Multidimensional aggregation queries constitute the single most important class of queries for data warehousing applications and decision support systems. The bottleneck in the ev...
SIGMOD
1996
ACM
15 years 1 months ago
1996
ACM
This paper introduces bifocal sampling, a new technique for estimating the size of an equi-join of two relations. Bifocal sampling classi es tuples in each relation into two group...
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
In this paper, we study whether the need for efficient XML publishing brings any new requirements for relational query engines, or if sorting query results in the relational engin...
107
click to vote
AVI
2008
14 years 10 months ago
2008
Traditional database query formulation is intensional: at the level of schemas, table and column names. Previous work has shown that filters can be created using a query paradigm ...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...