Advertisement

A Two Query Adaptive Bitprobe Scheme Storing Five Elements

  • Mirza Galib Anwarul Husain BaigEmail author
  • Deepanjan Kesh
  • Chirag Sodani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11355)

Abstract

We are studying the adaptive bitprobe model to store an arbitrary subset S of size at most five from a universe of size m and answer the membership queries of the form “Is x in S?” in two bitprobes. In this paper, we present a data structure for the aforementioned problem. Our data structure takes \(\mathcal {O}(m^{10/11})\) space. This result improves the non-explicit result by Garg and Radhakrishnan [6] which takes \(\mathcal {O}(m^{20/21})\) space, and the explicit result by Garg [5] which takes \(\mathcal {O}(m^{18/19})\) space for the aforementioned set and query sizes.

Keywords

Set membership problem Bitprobe model Data structures 

References

  1. 1.
    Alon, N., Feige, U.: On the power of two, three and four probes. In: Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 346–354. SIAM (2009)Google Scholar
  2. 2.
    Baig, M.G.A.H., Kesh, D.: Two new schemes in the bitprobe model. In: Rahman, M.S., Sung, W.-K., Uehara, R. (eds.) WALCOM 2018. LNCS, vol. 10755, pp. 68–79. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-75172-6_7CrossRefGoogle Scholar
  3. 3.
    Baig, M.G.A.H., Kesh, D., Sodani, C.: A two query adaptive bitprobe scheme storing five elements. arXiv preprint arXiv:1810.13331v1 (2018)
  4. 4.
    Buhrman, H., Miltersen, P.B., Radhakrishnan, J., Venkatesh, S.: Are bitvectors optimal? SIAM J. Comput. 31(6), 1723–1744 (2002)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Garg, M.: The bit-probe complexity of set membership. Ph.D. thesis, School of Technology and Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, Navy Nagar, Colaba, Mumbai 400005, India (2016)Google Scholar
  6. 6.
    Garg, M., Radhakrishnan, J.: Set membership with a few bit probes. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 776–784. SIAM (2014)Google Scholar
  7. 7.
    Garg, M., Radhakrishnan, J.: Set membership with non-adaptive bit probes. arXiv preprint arXiv:1612.09388 (2016)
  8. 8.
    Kesh, D.: On adaptive bitprobe schemes for storing two elements. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10627, pp. 471–479. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-71150-8_39CrossRefGoogle Scholar
  9. 9.
    Kesh, D.: Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements (2018). http://www.iitg.ac.in/deepkesh/paper32.pdf
  10. 10.
    Kesh, D.: Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements (2018). http://www.iitg.ac.in/deepkesh/A42.pdf
  11. 11.
    Lewenstein, M., Munro, J.I., Nicholson, P.K., Raman, V.: Improved explicit data structures in the bitprobe model. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 630–641. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-662-44777-2_52CrossRefGoogle Scholar
  12. 12.
    Nicholson, P.K., Raman, V., Rao, S.S.: A survey of data structures in the bitprobe model. In: Brodnik, A., López-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 303–318. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-40273-9_19CrossRefGoogle Scholar
  13. 13.
    Radhakrishnan, J., Raman, V., Srinivasa Rao, S.: Explicit deterministic constructions for membership in the bitprobe model. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 290–299. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-44676-1_24CrossRefGoogle Scholar
  14. 14.
    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. LNCS, vol. 6347, pp. 159–170. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-15781-3_14CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Mirza Galib Anwarul Husain Baig
    • 1
    Email author
  • Deepanjan Kesh
    • 1
  • Chirag Sodani
    • 1
  1. 1.Indian Institute of Technology GuwahatiGuwahatiIndia

Personalised recommendations