ESA 2014: Algorithms - ESA 2014 pp 630-641 | Cite as
Improved Explicit Data Structures in the Bitprobe Model
Abstract
Buhrman et al. [SICOMP 2002] studied the membership problem in the bitprobe model, presenting both randomized and deterministic schemes for storing a set of size n from a universe of size m such that membership queries on the set can be answered using t bit probes. Since then, there have been several papers focusing on deterministic schemes, especially for the first non-trivial case when n = 2. The most recent, due to Radhakrishnan, Shah, and Shannigrahi [ESA 2010], describes non-explicit schemes (existential results) for t ≥ 3 using probabilistic arguments. We describe a fully explicit scheme for n = 2 that matches their space bound of Θ(m 2/5) bits for t = 3 and, furthermore, improves upon it for t > 3, answering their open problem. Our structure (consisting of query and storage algorithms) manipulates blocks of bits of the query element in a novel way that may be of independent interest. We also describe recursive schemes for n ≥ 3 that improve upon all previous fully explicit schemes for a wide range of parameters.
Keywords
SIAM Journal Explicit Scheme Binary Representation Recursive Scheme Membership ProblemPreview
Unable to display preview. Download preview PDF.
References
- 1.Alon, N., Feige, U.: On the power of two, three and four probes. In: Proc. of the 20th Annual Symposium on Discrete Algorithms (SODA), pp. 346–354. SIAM (2009)Google Scholar
- 2.Alstrup, S., Brodal, G., Rauhe, T.: Optimal static range reporting in one dimension. In: Proc. of the 33rd Annual Symposium on Theory of Computing (STOC), pp. 476–482. ACM (2001)Google Scholar
- 3.Brodnik, A., Munro, J.I.: Membership in constant time and almost-minimum space. SIAM Journal on Computing 28(5), 1627–1640 (1999)CrossRefMATHMathSciNetGoogle Scholar
- 4.Buhrman, H., Miltersen, P., Radhakrishnan, J., Venkatesh, S.: Are bitvectors optimal? SIAM Journal on Computing 31(6), 1723–1744 (2002)CrossRefMATHMathSciNetGoogle Scholar
- 5.Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with 0(1) worst case access time. Journal of the ACM (JACM) 31(3), 538–544 (1984)CrossRefMATHGoogle Scholar
- 6.Nicholson, P.K.: Space Efficient Data Structures in the Word-RAM and Bitprobe Models. Ph.D. thesis, University of Waterloo (2013)Google Scholar
- 7.Nicholson, P.K., Raman, V., Rao, S.: Data structures in the bitprobe model. In: Brodnik, A., López-Ortiz, A., Raman, V., Viola, A. (eds.) Ianfest-66. LNCS, vol. 8066, pp. 303–318. Springer, Heidelberg (2013)CrossRefGoogle Scholar
- 8.Pagh, R.: Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing 31(2), 353–363 (2001)CrossRefMATHMathSciNetGoogle Scholar
- 9.Pǎtraşcu, M.: Succincter. In: Proc. of the 49th Annual Symposium on Foundations of Computer Science, pp. 305–313. IEEE (2008)Google Scholar
- 10.Radhakrishnan, J., Raman, V., Rao, S.S.: Explicit deterministic constructions for membership in the bitprobe model. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 290–299. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 11.Radhakrishnan, J., Shah, S., Shannigrahi, S.: Data structures for storing small sets in the bitprobe model. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol. 6347, pp. 159–170. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 12.Viola, E.: Bit-probe lower bounds for succinct data structures. SIAM Journal on Computing 41(6), 1593–1604 (2012)CrossRefMATHMathSciNetGoogle Scholar