Cell-probe lower bounds for the partial match problem

Journal of Computer and System Sciences

Volumn 69, Issue 3 SPEC. ISS., 2004, Pages 435-447

  Jayram, T S ^a   Khot, Subhash ^b   Kumar, Ravi ^a   Rabani, Yuval ^c  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b Princeton University   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Asymmetric communication complexity; Cell probe model; Nearest neighbor problem; Partial match problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; MATHEMATICAL MODELS; PROBABILITY; SET THEORY;

ASYMMETRIC COMMUNICATION COMPLEXITY; CELL-PROBE METHOD; NEAREST NEIGHBOR PROBLEM; PARTIAL MATCH PROBLEM;

PROBLEM SOLVING;

EID: 4544261973     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.04.006     Document Type: Conference Paper

References (22)

1. Ajtai M. A lower bound for finding predecessors in Yao's cell probe model. Combinatorica. 8:1988;235-247.
2. O. Barkol, Y. Rabani, Tight bounds for nearest neighbor search and related problems in the cell probe model, in: Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, 2000, pp. 388-396.
3. P. Beame, E. Vee, Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems, in: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, 2002, pp. 688-697.
4. A. Borodin, R. Ostrovsky, Y. Rabani, Lower bounds for high dimensional nearest neighbor search and related problems, in: Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, 1999, pp. 312-321.
5. A. Chakrabarti, B. Chazelle, B. Gum, A. Lvov, A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube, in: Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, 1999, pp. 305-311.
6. A. Chakrabarti, O. Regev, An optimal randomised cell probe lower bound for approximate nearest neighbor searching, Electronic Colloquium on Computational Complexity, 2003.
7. M. Charikar, P. Indyk, R. Panigrahy, New algorithms for subset query, partial match, orthogonal range searching, and related problems, in: Proceedings of the 29th International Colloquium on Algorithms, Logic, and Programming, 2002, pp. 451-462.
8. Chazelle B. The Discrepancy Method: Randomness and Complexity. 2000;Cambridge University Press, Cambridge.
9. ∞ norm J. Comput. System Sci. 63(4):2001;627-638.
10. P. Indyk, R. Motwani, Approximate nearest neighbors: towards removing the curse of dimensionality, in: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, 1998, pp. 604-613.
11. J. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions, in: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, 1997, pp. 599-608.
12. Knuth D. The Art of Computer Programming: Sorting and Searching. 1973;Addison-Wesley, Reading, MA.
13. Kushilevitz E., Ostrovsky R., Rabani Y. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30(2):2000;451-474.
14. D. Liu, A strong lower bound for approximate nearest neighbor searching in the cell probe model, 2003, Submitted for publication.
15. Meiser S. Point location in arrangement of hyperplanes. Inform. and Comput. 106(2):1993;286-303.
16. P.B. Miltersen, Lower bounds for union-split-find related problems on random access machines, in: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 625-634.
17. P.B. Miltersen, Cell probe complexity - a survey, in: Pre-Conference Workshop on Advances in Data Structures at the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, 1999.
18. Miltersen P.B., Nisan N., Safra S., Wigderson A. On data structures and asymmetric communication complexity. J. Comput. System Sci. 57(1):1998;37-49.
19. Nisan N., Wigderson A. Hardness vs. randomness. J. Comput. System Sci. 49(2):1994;149-167.
20. R. Rivest, Analysis of associative retrieval algorithms, Ph.D. Thesis, Stanford University, 1974.
21. Rivest R. Partial match retrieval algorithms. SIAM J. Comput. 5(1):1976;19-50.
22. Yao A.C. Should tables be sorted. J. Assoc. Comput. Mach. 28(3):1981;615-628.