Proceedings of the eleventh annual symposium on Computational geometry
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Packet classification using tuple space search
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Internet packet filter management and rectangle geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On Approximate Nearest Neighbors in Non-Euclidean Spaces
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Analysis of associative retrieval algorithms.
Analysis of associative retrieval algorithms.
High-dimensional computational geometry
High-dimensional computational geometry
A data structure for orthogonal range queries
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Algorithms for packet classification
IEEE Network: The Magazine of Global Internetworking
Cell-probe lower bounds for the partial match problem
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximate Nearest Neighbor under edit distance via product metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Cell-probe lower bounds for the partial match problem
Journal of Computer and System Sciences - Special issue: STOC 2003
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
On the coverings of the d-cube for d≤6
Discrete Applied Mathematics
Small subset queries and bloom filters using ternary associative memories, with applications
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Secure computation of constant-depth circuits with applications to database search problems
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |
We consider the subset query problem, defined as follows: given a set P of N subsets of a universe U, |U| = m, build a data structure, which for any query set Q 驴 U detects if there is any P 驴 P such that Q 驴 P. This is essentially equivalent to the partial match problem and is a fundamental problem in many areas. In this paper we present the first (to our knowledge) algorithms, which achieve non-trivial space and query time bounds for m = 驴(log N). In particular, we present two algorithms with the following tradeoffs: - N 驴 2O (mlog2 m 驴c/ log N) space, and O(N/2c) time, for any c - Nmc space and O(mN/c) query time, for any c 驴 N We extend these results to the more general problem of orthogonal range searching (both exact and approximate versions), approximate orthogonal range intersection and the exact and approximate versions of the nearest neighbor problem in l驴.