721 search results - page 18 / 145 » Supporting top-k join queries in relational databases |
EUROPAR
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
PODS
1999
ACM
15 years 1 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
90
Voted
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
ICDE
2006
IEEE
15 years 3 months ago
2006
IEEE
XML structural joins, which evaluate the containment (ancestor-descendant) relationships between XML elements, are important operations of XML query processing. Estimating structu...
116
click to vote
ECIR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Content-based image retrieval (CBIR) with global features is notoriously noisy, especially for image queries with low percentages of relevant images in a collection. More...