New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems

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?.

[1]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[2]  Ronald L. Rivest,et al.  Analysis of associative retrieval algorithms , 1974 .

[3]  Ronald L. Rivest,et al.  Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..

[4]  George S. Lueker,et al.  A data structure for orthogonal range queries , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[5]  Sunil Arya,et al.  Approximate range searching , 1995, SCG '95.

[6]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[7]  Piotr Indyk On approximate nearest neighbors in non-Euclidean spaces , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[8]  Allan Borodin,et al.  Lower bounds for high dimensional nearest neighbor search and related problems , 1999, STOC '99.

[9]  Venkatachary Srinivasan,et al.  Packet classification using tuple space search , 1999, SIGCOMM '99.

[10]  R. Pollack,et al.  Advances in Discrete and Computational Geometry , 1999 .

[11]  Subhash Suri,et al.  Packet filter management for layer 4 switching , 1999, INFOCOM 1999.

[12]  Anja Feldmann,et al.  Tradeoffs for packet classification , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  R. Motwani,et al.  High-Dimensional Computational Geometry , 2000 .

[14]  Rafail Ostrovsky,et al.  Efficient search for approximate nearest neighbor in high dimensional spaces , 1998, STOC '98.

[15]  Nick McKeown,et al.  Algorithms for packet classification , 2001, IEEE Netw..

[16]  David Eppstein,et al.  Internet packet filter management and rectangle geometry , 2000, SODA '01.