VSEncoding: Efficient coding and fast decoding of integer lists via dynamic programming

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2010, Pages 1219-1228

  Silvestri, Fabrizio ^a   Venturini, Rossano ^a  

^a ISTI CNR   (Italy)

Author keywords

Adaptive encoding; D gap encoding; Index compression; Inverted index encoding

Indexed keywords

ADAPTIVE ENCODING; D-GAP ENCODING; DECODING SPEED; DECOMPRESSION ALGORITHM; EXISTING METHOD; FAST DECODING; INDEX COMPRESSION; INTERPOLATIVE CODING; INVERTED INDICES; LARGE GRAPHS; MEMORY HIERARCHY; OPTIMAL SOLUTIONS; PARTITIONING STEP;

DECODING; ENCODING (SYMBOLS); INFORMATION RETRIEVAL; INFORMATION RETRIEVAL SYSTEMS; INTEGER PROGRAMMING; KNOWLEDGE MANAGEMENT;

DYNAMIC PROGRAMMING;

EID: 78651326353     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1871437.1871592     Document Type: Conference Paper

References (21)

1. B. Abali, H. Franke, X. Shen, D. E. Poff, and T. B. Smith. Performance of hardware compressed main memory. In Procs. of HPCA, page 73, Washington, DC, USA, 2001. IEEE Computer Society.
2. V. N. Anh and A. Moffat. Inverted index compression using word-aligned binary codes. Inf. Retr., 8(1):151-166, 2005.
3. V. N. Anh and A. Moffat. Improved word-aligned binary compression for text indexing. IEEE Trans. on Knowl. and Data Eng., 18(6):857-861, 2006.
4. P. Boldi and Sebastiano V. Codes for the world wide web. Internet Mathematics, 2(4), 2005.
5. A. Bookstein, S. T. Klein, and T. Raita. Modeling word occurrences for the compression of concordances. ACM Trans. Inf. Syst., 15(3):254-290, 1997.
6. F. Chierichetti, S. Lattanzi, F. Mari, and A. Panconesi. On placing skips optimally in expectation. In WSDM '08: Proceedings of the international conference on Web search and web data mining, pages 15-24, 2008.
7. S. Dasgupta, C. Papadimitriou, and U. Vazirani. Algorithms. McGraw-Hill Science/Eng/Math, 2006.
8. F. Dehne and K. Yogaratnam. Exploring the limits of gpus with parallel graph algorithms. CoRR, abs/1002.4482, 2010.
9. P. Elias. Universal codeword sets and representations of the integers. Information Theory, IEEE Transactions on, 21(2):194-203, Mar 1975.
10. P. Ferragina, I. Nitto, and R. Venturini. On optimally partitioning a text to improve its compression. In Procs. of European Symposium on Algorithms (ESA), pages 420-431, 2009.
11. S. Golomb. Run-length encodings. Information Theory, IEEE Transactions on, 12(3):399-401, 1966.
12. A. Moffat and L. Stuiver. Binary interpolative coding for effective index compression. Inf. Retr., 3(1):25-47, 2000.
13. D. Salomon. Variable-length Codes for Data Compression. Springer, 2007.
14. E. S. Schwartz and B. Kallick. Generating a canonical prefix encoding. Commun. ACM, 7(3):166-169, 1964.
15. F. Silvestri. Sorting out the document identifier assignment problem. In Proc. of ECIR, pages 101-112, 2007.
16. F. Silvestri. Mining query logs: Turning search usage data into knowledge. Found. Trends Inf. Retr., 4(1 - 2):1-174, 2010.
17. F. Silvestri, Salvatore Orlando, and R. Perego. Assigning identifiers to documents to enhance the clustering property of fulltext indexes. In Procs. of ACM SIGIR, pages 305-312, 2004.
18. A. Trotman. Compressing inverted files. Inf. Retr., 6(1):5-19, 2003.
19. I. H. Witten, A. Moffat, and T. C. Bell. Managing gigabytes (2nd ed.): compressing and indexing documents and images. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1999.
20. H. Yan, S. Ding, and T. Suel. Inverted index compression and query processing with optimized document ordering. In Procs. of WWW, pages 401-410, New York, NY, USA, 2009. ACM.
21. M. Zukowski, S. Heman, N. Nes, and P. Boncz. Super-scalar ram-cpu cache compression. In ICDE '06: Procs. of ICDE, page 59, 2006.