Abstract
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of type “x ∈ A?” can be answered very quickly.
H. Buhrman, P.B. Miltersen, J. Radhakrishnan, and S. Venkatesh proposed a bit-probe scheme based on expanders. Their scheme needs space of O(nlogm) bits, and requires to read only one randomly chosen bit from the memory to answer a query. The answer is correct with probability 2/3 with two-sided errors.
In this paper we show that for the same problem there exists a bit-probe scheme with one-sided error that needs space of O(nlog2 m + poly(logm)) bits. The difference with the model of Buhrman, Miltersen, Radhakrishnan, and Venkatesh is that we consider a bit-probe scheme with an auxiliary word. This means that in our scheme the memory is split into two parts of different size: the main storage of O(nlog2 m) bits and a short word of logO(1) m bits that is pre-computed once for the stored set A and “cached”. To answer a query “x ∈ A?” we allow to read the whole cached word and only one bit from the main storage. For some reasonable values of parameters (e.g., for poly(logm) ≪ n ≪ m) our space bound is better than what can be achieved by any scheme without cached data (the lower bound \(\mathrm{\Omega}(\frac{n^2\log m}{\log n})\) was proven in [11]).
We obtain a slightly weaker result (space of size n 1 + δpoly(logm) bits and two bit probes for every query) for a scheme that is effectively encodable.
Our construction is based on the idea of naive derandomization, which is of independent interest. First we prove that a random combinatorial object (a graph) has the required properties, and then show that such a graph can be obtained as an outcome of a pseudo-random generator. Thus, a suitable graph can be specified by a short seed of a PRG, and we can put an appropriate value of the seed into the cache memory of the scheme.
Supported in part by grants RFBR 09-01-00709-a and ANR-08-EMER-008-01.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bloom, B.: Space-time trade-offs in hash coding with allowable errors. Communications of ACM 13(7), 422–426 (1970)
Bassalygo, L.A., Pinsker, M.S.: The complexity of an optimal non-blocking commutation scheme without reorganization. Problems of Information Transmission 9, 64–66 (1974)
Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with O(1) worst case access time. Journal of the Association for Computing Machinery 31(3), 538–544 (1984)
Håstad, J.: Almost optimal lower bounds for small depth circuits. In: Proc. of 18th ACM STOC, pp. 6–20 (1986)
Siegel, A.: On universal classes of fast high performance hash functions, their time-space trade-off, and their applications. In: Proc. of 30th IEEE FOCS, pp. 20–25 (1989)
Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica 12(4), 449–461 (1990); Preliminary version: STOC 1990
Nisan, N., Wigderson, A.: Hardness vs Randomness. J. Comput. Syst. Sci. 49(2), 149–167 (1994)
Kahale, N.: Eigenvalues and expansion of regular graphs. Journal of the ACM 42(5), 1091–1106 (1995)
Siegel, A.: On universal classes of extremely random constant time hash functions and their time-space tradeoff. Technical Report TR1995-684, Courant Institute, New York University (April 1995)
Vitter, J.S.: External memory algorithms and data structures. ACM Comput. Surv. 33(2), 209–271 (2001)
Buhrman, H., Miltersen, P.B., Radhakrishnan, J., Srinivasan, V.: Are bitvectors optimal? Siam J. on Computing 31(6), 1723–1744 (2002)
Capalbo, M.R., Reingold, O., Vadhan, S.P., Wigderson, A.: Randomness Conductors and Constant-Degree Lossless Expanders. In: Proc. of the 34th ACM STOC, pp. 659–668
Sivakumar, D.: Algorithmic derandomization via complexity theory. In: Proc. ACM STOC 2002, pp. 619–626 (2002)
Ta-Schma, A.: Storing information with extractors. Information Processing Letters 83, 267–274 (2002)
Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bulletin of the American Mathematical Society 43(4), 439–561 (2006)
Vitter, J.S.: Algorithms and Data Structures for External Memory. Series on Foundations and Trends in Theoretical Computer Science. Now Publishers, Hanover (2008)
Braverman, M.: Poly-logarithmic Independence Fools AC0 Circuits. In: IEEE Conference on Computational Complexity 2009, pp. 3–8 (2009)
Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh–Vardy codes. Journal of the ACM 56(4) (2009)
Musatov, D.: Theorems about space-bounded Kolmogorov complexity obtained by “naive” derandomization. In: Proc. Computer Science in Russia (2011); Preliminary version: arXiv:1009.5108 (2010)
David, M., Papakonstantinou, P.A., Sidiropoulos, A.: How strong is Nisan’s pseudorandom generator? (2010) Electronic preprint, http://itcs.tsinghua.edu.cn/~papakons/pdfs/nisan_passes.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Romashchenko, A. (2011). Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error. In: Kulikov, A., Vereshchagin, N. (eds) Computer Science – Theory and Applications. CSR 2011. Lecture Notes in Computer Science, vol 6651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20712-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-20712-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20711-2
Online ISBN: 978-3-642-20712-9
eBook Packages: Computer ScienceComputer Science (R0)