DACs: Bringing direct access to variable-length codes

Information Processing and Management

Volumn 49, Issue 1, 2013, Pages 392-404

  Brisaboa, Nieves R ^a   Ladra, Susana ^a   Navarro, Gonzalo ^b  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Random access; Variable length codes

Indexed keywords

ENCODED SEQUENCES; ENCODING SCHEMES; HIGH-ORDER; RANDOM ACCESS; SAMPLING METHOD; VARIABLE LENGTH CODES;

DATA PROCESSING; MEDIA STREAMING;

DATA STRUCTURES;

EID: 84870291082     PISSN: 03064573     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipm.2012.08.003     Document Type: Article

References (36)

1. V.N. Anh, and A. Moffat Inverted index compression using word-aligned binary codes Information Retrieval 8 2005 151 166 (Pubitemid 40965682)
2. T. Bell, J. Cleary, and I. Witten Text Compression 1990 Prentice Hall New Jersey
3. Brisaboa, N. R.; Faria, A.; Ladra, S.; & Navarro, G. (2008). Reorganizing compressed text. In Proc. of the 31th annual international ACM SIGIR conference on research and development in information retrieval (SIGIR) (pp. 139-146).
4. Brisaboa, N. R.; Ladra, S.; & Navarro, G. (2009). Directly addressable variable-length codes. In Proc. 16th international symposium on string processing and information retrieval (SPIRE), LNCS (Vol. 5721, pp. 122-130).
5. Brisaboa, N. R.; Cánovas, R.; Claude, F.; Martínez-Prieto, M.; & Navarro, G. (2011). Compressed string dictionaries. In Proc. 10th international symposium on experimental algorithms (SEAs), LNCS (Vol. 6630. pp. 136-147).
6. N.R. Brisaboa, A. Fariña, G. Navarro, and J. Paramá Lightweight natural language text compression Information Retrieval 10 2007 1 33
7. Cánovas, R.; & Navarro, G. (2010). Practical compressed suffix trees. In Proc. 9th international symposium on experimental algorithms (SEAs), LNCS (Vol. 6049, pp. 94-105).
8. Clark, D. (1996). Compact pat trees. Ph.D. Thesis, Canada: University of Waterloo.
9. Claude, F.; Fariña, A.; Martínez-Prieto, M.; & Navarro, G. (2010). Compressed q-gram indexing for highly repetitive biological sequences. In Proc. 10th IEEE conference on bioinformatics and bioengineering (BIBE) (pp. 86-91).
10. Culpepper, J. S.; & Moffat, A. (2006). Phrase-based pattern matching in compressed text. In Proc. of the 13th international symposium on string processing and information retrieval (SPIRE) (Vol. 4209 of LNCS, pp. 337-345). (Pubitemid 44619020)
11. P. Elias Efficient storage and retrieval by content and address of static files Journal of the ACM 21 1974 246 260
12. Fano, R. (1971). On the number of bits required to implement an associative memory. Memo 61, Computer Structures Group, Project MAC, Massachusetts.
13. Ferragina, P.; Venturini, R.; 2007. A simple storage scheme for strings achieving entropy bounds. In Proc. 18th annual symposium on discrete algorithms (SODAs) (pp. 690-696).
14. K. Fredriksson, and S. Grabowski A general compression algorithm that supports fast searching Information Processing Letters 100 6 2006 226 232 (Pubitemid 44596205)
15. González, R.; Grabowski, S.; Mäkinen, V.; & Navarro, G. (2005). Practical implementation of rank and select queries. In Poster proc. volume 4th workshop on efficient and experimental algorithms (WEAs) (pp. 27-38).
16. S. Grabowski, G. Navarro, R. Przywarski, A. Salinger, and V. Mäkinen A simple alphabet-independent FM-index International Journal of Foundations of Computer Science (IJFCS) 17 6 2006 1365 1384 (Pubitemid 44924925)
17. Grossi, R.; Gupta, A.; & Vitter, J. (2003). High-order entropy-compressed text indexes. In Proc. 14th annual ACM-SIAM symposium on discrete algorithms (SODAs) (pp. 841-850).
18. D.A. Huffman A method for the construction of minimum-redundancy codes Proceedings of the Institute of Radio Engineers (IRE) 40 9 1952 1098 1101
19. Jacobson, G. (1989). Space-efficient static trees and graphs. In Proc. 30th IEEE symposium on foundations of computer science (FOCS) (pp. 549-554). (Pubitemid 20726002)
20. Kreft, S.; & Navarro, G. (2011). Self-indexing based on LZ77. In Proc. 22th annual symposium on combinatorial pattern matching (CPM) (Vol. 6661 of LNCS, pp. 41-54).
21. J. Larsson, and A. Moffat Off-line dictionary-based compression Proceedings of the IEEE 88 11 2000 1722 1732
22. U. Manber, and E.W. Myers Suffix arrays: A new method for on-line string searches SIAM Journal on Computing 22 5 1993 935 948
23. A. Moffat, and L. Stuiver Binary interpolative coding for effective index compression Information Retrieval 3 2000 25 47
24. A. Moffat, and A. Turpin Compression and coding algorithms 2002 Kluwer Academic Publishers
25. E. Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates Fast and flexible word searching on compressed text ACM Transactions on Information Systems 18 2 2000 113 139
26. Munro, I. (1996). Tables. In Proc. 16th conference on foundations of software technology and theoretical computer science (FSTTCS), LNCS (Vol. 1180, pp. 37-42).
27. Navarro, G. (2012). Wavelet trees for all. In Proc. 23rd annual symposium on combinatorial pattern matching (CPM), LNCS (Vol. 7354, pp. 2-26).
28. Okanohara, D.; & Sadakane, K. (2007). Practical entropy-compressed rank/select dictionary. In Proc. 9th workshop on algorithm engineering and experiments (ALENEXs) (pp. 60-70). (Pubitemid 47267203)
29. D. Solomon Variable-length codes for data compression 2007 Springer-Verlag
30. J. Storer Data compression: Methods and theory 1988 Addison Wesley Rockville, Md
31. J. Teuhola Interpolative coding of integer sequences supporting log-time random access Information Processing and Management 47 2011 742 761
32. Vigna, S. (2008). Broadword implementation of rank/select queries. In Proc. 5th workshop on experimental algorithms (WEAs) (pp. 154-168).
33. H.E. Williams, and J. Zobel Compressing integers for fast file access Computer Journal 42 3 1999 193 201
34. I. Witten, A. Moffat, and T. Bell Managing gigabytes 2nd ed. 1999 Morgan Kaufman Publishers New York
35. J. Ziv, and A. Lempel A universal algorithm for sequential data compression IEEE Transactions on Information Theory 23 3 1977 337 343
36. M. Zukowski, S. Heman, N. Nes, and P. Boncz Super-scalar ram-cpu cache compression Proc. 22nd international conference on data engineering (ICDE) 2006 IEEE Computer Society Washington, DC, USA 59 (Pubitemid 44539851)