1

Topic: Compression of a text index

Good afternoon Such question a string index the sizes of lines from 0 to 256 characters, an index is implemented on B + Tree, and lines  through ordinal comparing with function usage wcscmp, now the index is compressed on usage means zlib, but probably there is what that compression schemes which would consider that lines  and it is possible as that to compress "positive" "difference"

2

Re: Compression of a text index

Hello, SL, you wrote: SL> Such question a string index the sizes of lines from 0 to 256 characters, the index is implemented on B + Tree, and lines  through ordinal comparing with function usage wcscmp, now the index is compressed on usage means zlib, but probably there is what that compression schemes which would consider that lines  and it is possible as that to compress "positive" "difference" the First that comes to mind, this prefix compression in pages. The dictionary of prefixes of the fixed length and the link to it in elements. It is possible still for Haffmana to try, but the overhead projector can appear unacceptable.

3

Re: Compression of a text index

Hello, SL, you wrote: dawg data structure