Abstract
We study the nondeterministic cell-probe complexity of static data structures. We introduce cell-probe proofs (CPP), a proof system for the cell-probe model, which describes verification instead of computation in the cell-probe model. We present a combinatorial characterization of CPP. With this novel tool, we prove the following lower bounds for the nondeterministic cell-probe complexity of static data structures.
–There exists a data structure problem with high nondeterministic cell-probe complexity.
–For the exact nearest neighbor search (NNS) problem or the partial match problem in high dimensional Hamming space, for any data structure with Poly(n) cells, each of which contains O(nC) bits where C < 1, the nondeterministic cell-probe complexity is at least Ω(log(d/log n)), where d is the dimension and n is the number of points in the data set.
–For the polynomial evaluation problem of d-degree polynomial over finite field of size 2k where d ≤ 2k, for any data structure with s cells, each of which contains b bits, the nondeterministic cell-probe complexity is at least min ((k/b (d − 1)), (k−log(d−1)/logs)).
- Barkol, O. and Rabani, Y. 2002. Tighter lower bounds for nearest neighbor search and related problems in the cell probe model. J. Comput. Syst. Sci. 64, 4, 873--896. Google Scholar
Digital Library
- Beame, P. and Fich, F. 2002. Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65, 1, 38--72. Google Scholar
Digital Library
- Borodin, A., Ostrovsky, R., and Rabani, Y. 1999. Lower bounds for high dimensional nearest neighbor search and related problems. In Proceedings of the ACM Annual Symposium on Theory of Computing. ACM, New York, 312--321. Google Scholar
Digital Library
- Buhrman, H. and de Wolf, R. 2002. Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288, 1, 21--43. Google Scholar
Digital Library
- Fredman, M. and Saks, M. 1989. The cell probe complexity of dynamic data structures. In Proceedings of the ACM Annual Symposium on Theory of Computing. ACM, New York, 345--354. Google Scholar
Digital Library
- Husfeldt, T. and Rauhe, T. 1998. Hardness Results for dynamic problems by extensions of fredman and saks’ chronogram method. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming. Springer, Berlin, 67--78. Google Scholar
Digital Library
- Indyk, P., Goodman, J., and O’Rourke, J. 2004. Handbook of Discrete and Computational Geometry. CRC Press, Ch. 39, 877--892.Google Scholar
- Jayram, T., Khot, S., Kumar, R., and Rabani, Y. 2004. Cell-probe lower bounds for the partial match problem. J. Comput. Syst. Sci. 69, 3, 435--447. Google Scholar
Digital Library
- Kushilevitz, E. and Nisan, N. 1997. Communication Complexity. Cambridge University Press, Cambridge, UK. Google Scholar
Digital Library
- Miltersen, P. 1995. On the cell probe complexity of polynomial evaluation. Theor. Comput. Sci. 143, 1, 167--174. Google Scholar
Digital Library
- Miltersen, P. 1999. 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.Google Scholar
- Miltersen, P. 2008. Private communication.Google Scholar
- Miltersen, P., Nisan, N., Safra, S., and Wigderson, A. 1998. On data structures and asymmetric communication complexity. J. Comput. Syst. Sci. 57, 1, 37--49. Google Scholar
Digital Library
- Pǎtraşcu, M. 2008. Unifying the landscape of cell-probe lower bounds. In Proceedings of the IEEE Conference on Foundations of Computer Science. IEEE, Los Alamitos, CA, 434--443.Google Scholar
- Pătraşcu, M. and Demaine, E. 2006. Logarithmic lower bounds in the cell-probe model. SIAM J. Comput. 35, 4, 932--963. Google Scholar
Digital Library
- Pătraşcu, M. and Thorup, M. 2006. Time-space trade-offs for predecessor search. In Proceedings of the ACM Annual Symposium on Theory of Computing. ACM, New York, 232--240. Google Scholar
Digital Library
- Yao, A. 1981. Should tables be sorted? J. ACM 28, 3, 615--628. Google Scholar
Digital Library
Index Terms
Cell-Probe Proofs
Recommendations
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
Special Issue on SPAA 2016We study the complexity of parallel data structures for approximate nearest neighbor search in d-dimensional Hamming space {0,1}d. A classic model for static data structures is the cell-probe model [27]. We consider a cell-probe model with limited ...
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and ArchitecturesWe study the problem of approximate nearest neighbor search in $d$-dimensional Hamming space {0,1}d. We study the complexity of the problem in the famous cell-probe model, a classic model for data structures. We consider algorithms in the cell-probe ...
Cell-probe lower bounds for the partial match problem
Special issue: STOC 2003Given a database of n points in {0, 1)d, the partial match problem is: In response to a query x in {0,1,*}d, is there a database point y such that for every i whenever xi ≠ *, we have xi = yi. In this paper we show randomized lower bounds in the cell-...






Comments