9849 search results - page 1840 / 1970 » Algorithms and Experiments for the Webgraph |
232
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
201
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
213
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
The concept of dominance has recently attracted much interest in the context of skyline computation. Given an Ndimensional data set S, a point p is said to dominate q if p is bett...
351
Voted
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
211
Voted
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...