×

zbMATH — the first resource for mathematics

Compressed cache-oblivious string B-tree. (English) Zbl 1394.68094
Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 469-480 (2013).
Summary: 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.
For the entire collection see [Zbl 1270.68017].

MSC:
68P05 Data structures
68P30 Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68W32 Algorithms on strings
PDF BibTeX XML Cite
Full Text: DOI