197 search results - page 33 / 40 » Efficiently approximating query optimizer plan diagrams |
PODS
2002
ACM
14 years 7 months ago
2002
ACM
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
PODS
2010
ACM
14 years 17 days ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
CCCG
2010
13 years 9 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
VLDB
2004
ACM
14 years 7 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....