Compressed Cache-Oblivious String B-tree

  • Paolo Ferragina
  • Rossano Venturini
Conference paper

DOI: 10.1007/978-3-642-40450-4_40

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8125)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Paolo Ferragina
    • 1
  • Rossano Venturini
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaItaly

Personalised recommendations