Leveraging Context-Free Grammar for Efficient Inverted Index Compression
暂无分享,去创建一个
Gang Wang | Xiaoguang Liu | Jin Liang | Rebecca J. Stones | Jiancong Tong | Haibing Huang | Zhaohua Zhang | Tianlong Li
[1] Sergei Vassilvitskii,et al. Factorization-based lossless compression of inverted indices , 2011, CIKM '11.
[2] Guy E. Blelloch,et al. Index compression through document reordering , 2002, Proceedings DCC 2002. Data Compression Conference.
[3] Fabrizio Silvestri,et al. Assigning identifiers to documents to enhance the clustering property of fulltext indexes , 2004, SIGIR '04.
[4] En-Hui Yang,et al. Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models , 2000, IEEE Trans. Inf. Theory.
[5] Jinlin Chen,et al. Using d-gap patterns for index compression , 2007, WWW '07.
[6] Gaston H. Gonnet,et al. An algorithmic and complexity analysis of interpolation search , 2004, Acta Informatica.
[7] Leonid Boytsov,et al. Decoding billions of integers per second through vectorization , 2012, Softw. Pract. Exp..
[8] Abhi Shelat,et al. The smallest grammar problem , 2005, IEEE Transactions on Information Theory.
[9] Andrei Z. Broder,et al. Efficient query evaluation using a two-level retrieval process , 2003, CIKM '03.
[10] Liang Shi,et al. Yet Another Sorting-Based Solution to the Reassignment of Document Identifiers , 2012, AIRS.
[11] J. Ian Munro,et al. Document Listing on Versioned Documents , 2013, SPIRE.
[12] Giuseppe Ottaviano,et al. Partitioned Elias-Fano indexes , 2014, SIGIR.
[13] Alexander A. Stepanov,et al. SIMD-based decoding of posting lists , 2011, CIKM '11.
[14] Ian H. Witten,et al. Managing Gigabytes: Compressing and Indexing Documents and Images , 1999 .
[15] Diego Arroyuelo,et al. Document identifier reassignment and run-length-compressed inverted indexes for improved search performance , 2013, SIGIR.
[16] Ian H. Witten,et al. Managing gigabytes (2nd ed.): compressing and indexing documents and images , 1999 .
[17] Ian H. Witten,et al. Identifying Hierarchical Structure in Sequences: A linear-time algorithm , 1997, J. Artif. Intell. Res..
[18] Charles L. A. Clarke,et al. Information Retrieval - Implementing and Evaluating Search Engines , 2010 .
[19] Miguel A. Martínez-Prieto,et al. Indexes for highly repetitive document collections , 2011, CIKM '11.
[20] Paolo Ferragina,et al. Compressed Indexes for String Searching in Labeled Graphs , 2015, WWW.
[21] Hugh E. Williams,et al. Compressing Integers for Fast File Access , 1999, Comput. J..
[22] Marcin Zukowski,et al. Super-Scalar RAM-CPU Cache Compression , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[23] Fabrizio Silvestri,et al. Sorting Out the Document Identifier Assignment Problem , 2007, ECIR.
[24] Alistair Moffat,et al. Off-line dictionary-based compression , 1999, Proceedings of the IEEE.
[25] Alistair Moffat,et al. Binary Interpolative Coding for Effective Index Compression , 2000, Information Retrieval.
[26] Giuseppe Ottaviano,et al. Optimal Space-time Tradeoffs for Inverted Indexes , 2015, WSDM.
[27] Torsten Suel,et al. Inverted index compression and query processing with optimized document ordering , 2009, WWW '09.
[28] Alistair Moffat,et al. Index Compression Using Fixed Binary Codewords , 2004, ADC.
[29] Wing-Kai Hon,et al. Compressed Dictionaries: Space Measures, Data Sets, and Experiments , 2006, WEA.
[30] Alistair Moffat,et al. On the Cost of Phrase-Based Ranking , 2015, SIGIR.
[31] Tien-Fu Chen,et al. Inverted file compression through document identifier reassignment , 2003, Inf. Process. Manag..
[32] Stephen E. Robertson,et al. Relevance weighting of search terms , 1976, J. Am. Soc. Inf. Sci..
[33] J. Shane Culpepper,et al. Efficient set intersection for inverted indexing , 2010, TOIS.
[34] Pamela C. Cosman,et al. Universal lossless compression via multilevel pattern matching , 2000, IEEE Trans. Inf. Theory.
[35] Craig G. Nevill-Manning,et al. Compression and Explanation Using Hierarchical Grammars , 1997, Comput. J..
[36] Torsten Suel,et al. Performance of compressed inverted list caching in search engines , 2008, WWW.
[37] Fabrizio Silvestri,et al. VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming , 2010, CIKM.
[38] Dake He,et al. Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform .2. With context models , 2000, IEEE Trans. Inf. Theory.
[39] Andrew Chi-Chih Yao,et al. An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..
[40] Alistair Moffat,et al. Inverted Index Compression Using Word-Aligned Binary Codes , 2004, Information Retrieval.