An Improved Scheme in the Two Query Adaptive Bitprobe Model
Data Structures and Algorithms
2018-12-13 v1
Abstract
In this paper, we look into the adaptive bitprobe model that stores subsets of size at most four from a universe of size m, and answers membership queries using two bitprobes. We propose a scheme that stores arbitrary subsets of size four using O(m^{5/6}) amount of space. This improves upon the non-explicit scheme proposed by Garg and Radhakrishnan [Garg2015] which uses O(m^{16/17}) amount of space, and the explicit scheme proposed by Garg [Thesis2015] which uses O(m^{14/15}) amount of space.
Cite
@article{arxiv.1812.04802,
title = {An Improved Scheme in the Two Query Adaptive Bitprobe Model},
author = {Mirza Galib Anwarul Husain Baig and Deepanjan Kesh and Chirag Sodani},
journal= {arXiv preprint arXiv:1812.04802},
year = {2018}
}