Document - Distribution-aware compressed full-text indexes

2011

Conference article Open Access

Distribution-aware compressed full-text indexes

Ferragina P., Sirén, J., Venturini R.

H.3 INFORMATION STORAGE AND RETRIEVAL Compression Computer Science Applications General Computer Science 113 Computer and information sciences Applied Mathematics Indexing

In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes the expected query-time within that index-space bound. We solve this problem by exploiting a reduction to the problem of finding a minimum weight K-link path in a particular Directed Acyclic Graph. Interestingly enough, our solution is independent of the underlying compressed index in use. Our experiments compare this optimal strategy with several other standard approaches, showing its effectiveness in practice.

Source: Algorithms - ESA 2011. 19th Annual European Symposium, pp. 760–771, Saarbrucken, Germany, 5-9 September 2011

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:204403,
	title = {Distribution-aware compressed full-text indexes},
	author = {Ferragina P. and Sirén and J. and Venturini R.},
	doi = {10.1007/978-3-642-23719-5_64 and 10.1007/s00453-013-9782-3},
	booktitle = {Algorithms - ESA 2011. 19th Annual European Symposium, pp. 760–771, Saarbrucken, Germany, 5-9 September 2011},
	year = {2011}
}