651 search results - page 30 / 131 » Algebraic Query Optimization for Distributed Top-k Queries |
SIGMOD
2012
ACM
11 years 11 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
GRID
2007
Springer
14 years 26 days ago
2007
Springer
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...
SSDBM
2009
IEEE
14 years 3 months ago
2009
IEEE
We present a novel sensor network query processing architecture that (a) covers all the query optimization phases that are required to map a declarative query to executable code; ...
ICS
2004
Tsinghua U.
14 years 2 months ago
2004
Tsinghua U.
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...