Chapter

Algorithms – ESA 2013

Volume 8125 of the series Lecture Notes in Computer Science pp 469-480

Compressed Cache-Oblivious String B-tree

  • Paolo FerraginaAffiliated withDipartimento di Informatica, Università di Pisa
  • , Rossano VenturiniAffiliated withDipartimento di Informatica, Università di Pisa

* Final gross prices may vary according to local VAT.

Get Access

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.