1007 search results - page 18 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
179
Voted
PODS
2009
ACM
16 years 6 days ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
104
click to vote
VLDB
1995
ACM
15 years 3 months ago
1995
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
104
click to vote
STOC
2001
ACM
15 years 12 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
117
Voted
SIGIR
1999
ACM
15 years 4 months ago
1999
ACM
The fast growth of multimedia information in image and video databases has triggered research on efficient retrieval methods. This paper deals with structural queries, a type of c...
97
Voted
SIGECOM
2003
ACM
15 years 4 months ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...