332 search results - page 45 / 67 » Space Complexity vs. Query Complexity |
110
Voted
PODS
2000
ACM
15 years 5 months ago
2000
ACM
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
100
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
146
click to vote
INFOCOM
2006
IEEE
15 years 8 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...
105
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
193
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...