Index compression is good, especially for random access

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2007, Pages 761-770

  Buttcher, Stefan ^a   Clarke, Charles L A ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Index compression; Main memory; RAM; Random access

Indexed keywords

DISK I/O; HARD DRIVES; INDEX COMPRESSION; INDEX TERMS; MAIN MEMORY; RAM; RANDOM ACCESS; RETRIEVAL PERFORMANCE; SIDE EFFECTS; STORAGE REQUIREMENTS; TEXT RETRIEVAL SYSTEMS;

DISKS (STRUCTURAL COMPONENTS); HARD DISK STORAGE; INFORMATION RETRIEVAL; KNOWLEDGE MANAGEMENT;

RANDOM ACCESS STORAGE;

EID: 63449115477     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1321440.1321546     Document Type: Conference Paper

References (27)

1. V. N. Anh and A. Moffat. Inverted Index Compression using Word-Aligned Binary Codes. Information Retrieval, 8(1):151-166, January 2005.
2. E. A. Brewer. Combining Systems and Databases: A Search Engine Retrospective. In J. M. Hellerstein and M. Stonebraker, editors, Readings in Database Systems (4th edition), Cambridge, Massachusetts, 2005. MIT Press.
3. D. Burger, J. R. Goodman, and G. S. Sohi. Memory Systems. In The Computer Science and Engineering Handbook, pages 447-461. 1997.
4. S. Buttcher and C. L. A. Clarke. Unaligned Binary Codes for Index Compression in Schema-Independent Text Retrieval Systems. University of Waterloo Technical Report CS-2006-40, October 2006.
5. B. Cui, B. C. Ooi, J. Su, and K.-L. Tan. Main Memory Indexing: The Case for BD-Tree. IEEE Transactions on Knowledge and Data Engineering, 16(7):870-874, 2004.
6. E. D. Demaine, A. Lopez-Ortiz, and J. I. Munro. Adaptive Set Intersections, Unions, and Differences. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pages 743-752, San Francisco, USA, January 2000.
7. E. D. Demaine, A. Loopez-Ortiz, and J. I. Munro. Experiments on Adaptive Set Intersections for Text Retrieval Systems. In Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001), pages 91-104.
8. Washington, DC, USA, January 2001.
9. A. S. Fraenkel and S. T. Klein. Novel Compression of Sparse Bit-Strings - Preliminary Report. Combinatorial Algorithms on Words, NATO ASI Series, 12:169-183, 1985.
10. S. W. Golomb. Run-Length Encodings. IEEE Transactions on Information Theory, IT-12:399-401, July 1966.
11. R. A. Hankins and J. M. Patel. Effect of Node Size on the Performance of Cache-Conscious B+-Trees. In Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 283-294, San Diego, USA, June 2003.
12. S. Hoeman. Super-Scalar Database Compression between RAM and CPU Cache. Master's Thesis. University of Amsterdam. Amsterdam, The Netherlands, July 2005.
13. M. Kowarschik and C. Weifi. An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms. In Algorithms for Memory Hierarchies, Advanced Lectures, pages 213-232, March 2002.
14. A. Moffat and L. Stuiver. Binary Interpolative Coding for Effective Index Compression. Information Retrieval, 3(1):25-47, 2000.
15. A. Moffat and J. Zobel. Self-Indexing Inverted Files for Fast Text Retrieval. ACM Transactions on Information Systems, 14(4):349-379, October 1996.
16. Y. Perl, A. Itai, and H. Avni. Interpolation Search - A log log n Search. Communications of the ACM, 21(7):550-553, 1978.
17. J. Rao and K. A. Ross. Cache Conscious Indexing for Decision-Support in Main Memory. In Proceedings of 25th International Conference on Very Large Data Bases, pages 78-89, Edinburgh, UK, September 1999.
18. +-Trees Cache Conscious in Main Memory. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pages 475-486, Dallas, USA, May 2000.
19. C. Ruemmler and J. Wilkes. An Introduction to Disk Drive Modeling. The Computer Journal, 27(3):17-28, 1994.
20. F. Scholer, H. E. Williams, J. Yiannis, and J. Zobel. Compression of Inverted Indexes for Fast Query Evaluation. In Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 222-229, Tampere, Finland, August 2002.
21. A. J. Smith. Bibliography and Reading on CPU Cache Memories and Related Topics. SIGARCH Computer Architecture News, 14(1):22-42, 1986.
22. H. Turtle and J. Flood. Query Evaluation: Strategies and Optimization. Information Processing &Management, 31(1):831-850, November 1995.
23. H. E. Williams and J. Zobel. Compressing Integers for Fast File Access. The Computer Journal, 42(3):193-201, 1999.
24. L. Xiao, X. Zhang, and S. A. Kubricht. Improving Memory Performance of Sorting Algorithms. ACM Journal ofExperimental Algorithms, 5, 2000.
25. J. Zobel and A. Moffat. Adding Compression to a Full-Text Retrieval System. Software - Practice and Experience, 25(8):891-903, 1995.
26. J. Zobel and A. Moffat. Inverted Files for Text Search Engines. ACM Computing Surveys, 38(2):6, 2006.
27. M. Zukowski, S. Heman, N. Nes, and P. A. Boncz. Super-Scalar RAM-CPU Cache Compression. In ICDE, page 59, 2006.