9849 search results - page 1841 / 1970 » Algorithms and Experiments for the Webgraph |
172
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
157
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
As more and more query processing work can be done in main memory, memory access is becoming a significant cost component of database operations. Recent database research has show...
150
click to vote
SIGMOD
2002
ACM
16 years 4 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...
145
click to vote
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
145
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...