Sleepycat Software writes:
>
> I agree this is an interesting question. The problem is that
> B+trees are sorted structures, and the data structure is often
> chosen because of locality of reference, i.e., if you look up
> record "aaaa", it is known that you're likely to look up record
> "aaab" too.
This is required if we want the truncation operator to work (aa*).
> The question that I haven't thought through is if it's possible
> to Huffman encode data without destroying the sort order, i.e.,
> if I have "aaaa", "aaab" and "aaac", does the Huffman encoded
> representation sort in the exact same order? (Remember, the
Since the words are compressed according to frequencies, the order
is not preserved. If compressing is done based on trigram frequencies
for instance, the order of aaa and aab will depend on their frequency,
not their lexicographic order.
It was a good idea though :-)
--
Loic Dachary
ECILA
100 av. du Gal Leclerc
93500 Pantin - France
Tel: 33 1 56 96 09 80, Fax: 33 1 56 96 09 61
e-mail: [EMAIL PROTECTED] URL: http://www.senga.org/
------------------------------------
To unsubscribe from the htdig3-dev mailing list, send a message to
[EMAIL PROTECTED] containing the single word "unsubscribe" in
the SUBJECT of the message.
