Biased Predecessor Search
We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures that achieve expected query times logarithmic in the entropy of the distribution of queries but with space bounded in terms of universe size, as well as data structures that use only linear space but with query times that are higher (but still sublinear) functions of the entropy. For these structures, the distribution is assumed known. We also consider data structures with general weights on universe elements, as well as the case when the distribution is not known in advance.
KeywordsEntropy Expense Verse Brodal
Unable to display preview. Download preview PDF.
- 1.Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. Journal of the ACM 54(3), Article 13 (2007)Google Scholar
- 4.Belazzougui, D., Kaporis, A.C., Spirakis, P.G.: Random input helps searching predecessors. arXiv:1104.4353 (2011)Google Scholar
- 7.Bose, P., Douïeb, K., Dujmović, V., Howat, J., Morin, P.: Fast local searches and updates in bounded universes. In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), pp. 261–264 (2010)Google Scholar
- 14.Pătraşcu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 232–240 (2006)Google Scholar