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. © 2013 Springer-Verlag.
Cite
CITATION STYLE
APA
Ferragina, P., & Venturini, R. (2013). Compressed cache-oblivious string B-tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8125 LNCS, pp. 469–480). https://doi.org/10.1007/978-3-642-40450-4_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free