Document - Design of practical succinct data structures for large data collections

2013

Conference article Open Access

Design of practical succinct data structures for large data collections

Grossi R., Ottaviano G.

Succinct data structures Compression E.1 [Data Structures]

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.

Source: SEA 2013 - Experimental Algorithms. 12th International Symposium, pp. 5–17, Rome, Italy, 5-7 June 2013

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:277758,
	title = {Design of practical succinct data structures for large data collections},
	author = {Grossi R. and Ottaviano G.},
	doi = {10.1007/978-3-642-38527-8_3},
	booktitle = {SEA 2013 - Experimental Algorithms. 12th International Symposium, pp. 5–17, Rome, Italy, 5-7 June 2013},
	year = {2013}
}