Conference Proceedings

Design of practical succinct data structures for large data collections

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7933 LNCS 5-17
DOI: 10.1007/978-3-642-38527-8_3
19Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe a set of basic succinct data structures which have been implemented as part of the Succinct library, and applications on top of the library: an index to speed-up the access to collections of semi-structured data, a compressed string dictionary, and a compressed dictionary for scored strings which supports top-k prefix matching. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Grossi, R., & Ottaviano, G. (2013). Design of practical succinct data structures for large data collections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7933 LNCS, pp. 5–17). https://doi.org/10.1007/978-3-642-38527-8_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free