23589 search results - page 4453 / 4718 » Uncheatable Distributed Computations |
284
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
262
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
192
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
183
click to vote
SIGMOD
2002
ACM
16 years 6 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...
192
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...