Part of the Lecture Notes in Computer Science book series (LNCS, volume 8125)
Compressed Cache-Oblivious String B-tree
- Cite this paper as:
- Ferragina P., Venturini R. (2013) Compressed Cache-Oblivious String B-tree. In: Bodlaender H.L., Italiano G.F. (eds) Algorithms – ESA 2013. ESA 2013. Lecture Notes in Computer Science, vol 8125. Springer, Berlin, Heidelberg
In this paper we address few variants of the well-known prefix-search problem in a dictionary of strings, and provide solutions for the cache-oblivious model which improve the best known results.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2013