Interpolative coding of integer sequences supporting log-time random access

Information Processing and Management

Volumn 47, Issue 5, 2011, Pages 742-761

  Teuhola, J ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

Data compression; Interpolative coding; Inverted index; Random access; Source coding

Indexed keywords

ANCILLARY STRUCTURES; DATA TYPE; INTEGER SEQUENCE; INTERPOLATIVE CODING; INVERTED INDICES; ORDINAL NUMBER; PRIMARY DATA; RANDOM ACCESS; SEQUENCE LENGTHS; SOURCE SIZES; SOURCE-CODING; TIME COMPLEXITY; UNIFORM DISTRIBUTION; VARIABLE-LENGTH CODING; WORST CASE;

NUMBER THEORY;

DATA COMPRESSION;

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

References (28)

1. Anh, V. N.; Moffat, A. (1998). Compressed inverted files with reduced decoding overheads. In Proceedings of 21st ACM SIGIR conference on research and development in information retrieval, Melbourne, Australia, pp. 290-297 (August).
2. V.N. Anh, and A. Moffat Inverted index compression using word-aligned binary codes Information Retrieval 83 2005 151 166 (Pubitemid 40965682)
3. V.N. Anh, and A. Moffat Improved word-aligned binary compression for text indexing IEEE Transactions on Knowledge and Data Engineering 18 2006 857 861
4. A. Apostolico, and A. Fraenkel Robust transmission of unbounded strings using fibonacci representations IEEE Transactions on Information Theory 33 1987 238 245 (Pubitemid 17565912)
5. N.R. Brisaboa, S. Ladra, and G. Navarro Directly addressable variable-length codes Proceedings of 16th symposium on string processing and information retrieval (SPIRE) LNCS Vol. 5721 2009 Springer Tampere, Finland 122 130 (August)
6. M.R. Brown Implementation and analysis of binomial queue algorithms SIAM Journal on Computing 7 1978 298 319
7. Cheng, J.; Ng, W. (2004). Xqzip: Querying compressed xml using structural indexing. In Proceedings of the 9th international conference on extending database technology, Heraklion, Crete, Greece, pp. 219-236 (March).
8. J.S. Culpepper, and A. Moffat Compact set representation for information retrieval Proceedings of 14th symposium on string processing and information retrieval (SPIRE) LNCS Vol. 4726 2007 Springer Santiago, Chile 137 148 (October)
9. P. Elias Universal codeword sets and representations of the integers IEEE Transactions on Information Theory 21 1975 194 203 (March)
10. P. Fenwick Universal codes K. Sayood, Lossless compression handbook 2003 Academic Press San Diego, CA
11. P.M. Fenwick A new data structure for cumulative frequency tables Software - Practice and Experience 24 1994 327 336
12. S.W. Golomb Run-length encodings IEEE Transactions on Information Theory 12 1966 399 401
13. R. González, R. Grabowski, V. Mäkinen, and G. Navarro Practical implementation of rank and select queries Poster proceedings of 4th workshop on experimental and efficient algorithmics (WEA) 2005 CTI Press Santorini, Greece 27 38 (May)
14. Gupta, A.; Hon, W. K.; Shah, R.; Vitter, J. S. (2006). Compressed data structures: Dictionaries and data-aware measures. In Proceedings of IEEE data compression conference, Snowbird, UT, pp. 213-222 (March).
15. D.A. Huffman A method for the construction of minimum redundancy codes Proceedings of the I.R.E. 40 1952 1098 1101
16. Lin, Y.; Zhang, Y.; Li, Q.; Yang, J. (2005). Supporting efficient query processing on compressed xml files. In Proceedings of ACM symposium on applied computing, Santa Fe, New Mexico, pp. 660-665 (March).
17. U. Manber A text compression scheme that allows fast searching directly in the compressed file ACM Transactions on Information Systems 15 April 1997 124 136 (Pubitemid 127685691)
18. Min, J. K.; Park, M. J.; Chung, C. W. (2003). Xpress: A queriable compression for xml data. In Proceeding of ACM SIGMOD international conference on management of data, San Diego, CA, pp. 122-133 (June).
19. Moffat, A. (2008). Compressing integer sequences and sets. In Encyclopedia of algorithms. New York, NY: Springer Verlag
20. Moffat, A.; Stuiver, L. (1996). Exploiting clustering in inverted file compression. In Proceedings of the 6th data compression conference (DCC'96), Snowbird, UT, pp. 82-91 (March).
21. A. Moffat, and L. Stuiver Binary interpolative coding for effective index compression Information Retrieval 3 2000 25 47
22. A. Moffat, and J. Zobel Supporting random access in files of variable length records Information Processing Letters 46 1993 71 77
23. A. Moffat, and J. Zobel Self-indexing inverted files for fast text retrieval ACM Transactions on Information Systems 14 1996 349 379 (Pubitemid 126420100)
24. Scholer, F.; Williams, H. E.; Yiannis, J.; Zobel, J. (2002). Compression of inverted indexes for fast query evaluation. In Proceedings of 21st ACM SIGIR conference on research and development in information retrieval, Tampere, Finland, pp. 222-229 (August).
25. J. Teuhola Tournament coding of integer sequences The Computer Journal 52 2009 368 377
26. Tolani, P. M.; Haritsa, J. R. (2002). Xgrind: A query-friendly xml compressor. In Proceedings of the 18th international conference on data engineering, San Jose, CA, pp. 225-234 (February). (Pubitemid 34278711)
27. Transier, F.; Sanders, P. (2008). Compressed inverted indexes for in-memory search engines. In Proceedings of 9th workshop on algorithm engineering and experiments (ALENEX), SIAM, San Francisco, CA, USA, pp. 3-12 (January).
28. H.E. Williams, and J. Zobel Compressing integers for fast file access The Computer Journal 42 1999 193 201