Abstract
The Simple family of codecs is popular for encoding postings lists for a search engine because they are both space effective and time efficient at decoding. These algorithms pack as many integers into a codeword as possible before moving on to the next codeword. This technique is known as left-greedy. This contribution proves that left-greedy is not optimal and then goes on to introduce a dynamic programming solution to find the optimal packing. Experiments on .gov2 and INEX Wikipedia 2009 show that although this is an interesting theoretical result, left-greedy is empirically near optimal in effectiveness and efficiency.
Author supplied keywords
Cite
CITATION STYLE
Trotman, A., Albert, M., & Burgess, B. (2015). Optimal packing in simple-family codecs. In ICTIR 2015 - Proceedings of the 2015 ACM SIGIR International Conference on the Theory of Information Retrieval (pp. 337–340). Association for Computing Machinery, Inc. https://doi.org/10.1145/2808194.2809483
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
