Sigma encoded inverted files
dc.contributor.author | Trotman, A. | |
dc.contributor.author | Subramanya, V. | |
dc.date.accessioned | 2020-03-30T09:46:33Z | |
dc.date.available | 2020-03-30T09:46:33Z | |
dc.date.issued | 2007 | |
dc.description.abstract | Compression of term frequency lists and very long document-id lists within an inverted file search engine are examined. Several compression schemes are compared including Elias ? and ? codes, Golomb Encoding, Variable Byte Encoding, and a class of word- based encoding schemes including Simple-9, Relative-10 and Carryover-12. It is shown that these compression methods are not well suited to compressing these kinds of lists of numbers. Of those tested, Carryover-12 is preferred because it is both effective at compression and fast at decompression. A novel technique, Sigma Encoding prior to compression, is proposed and tested. Sigma Encoding utilizes a parameterized dictionary to reduce the number of bits necessary to store an integer. This method shows an about 0.3 bit per integer improvement over Carryover-12 while costing only about 3 extra clock cycles per integer to decompress. Copyright 2007 ACM. | en_US |
dc.identifier.citation | International Conference on Information and Knowledge Management, Proceedings, 2007, Vol., , pp.983-986 | en_US |
dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/6981 | |
dc.title | Sigma encoded inverted files | en_US |
dc.type | Book chapter | en_US |
Files
Original bundle
1 - 1 of 1