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.
Design of practical succinct data structures for large data collections
2013
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.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
prod_277758-doc_78330.pdf
accesso aperto
Descrizione: Design of Practical Succinct Data Structures for Large Data Collections
Tipologia:
Versione Editoriale (PDF)
Dimensione
459.96 kB
Formato
Adobe PDF
|
459.96 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.