[[email protected]: Re: radix-sorting rational numbers with an efficient serialization of continued fractions]

----- Forwarded message from Kragen Javier Sitaker <[email protected]> -----

Date: Tue, 18 Oct 2011 03:04:13 -0400
From: Kragen Javier Sitaker <[email protected]>
To: Darius Bacon <[email protected]>
Subject: Re: radix-sorting rational numbers with an efficient serialization
	of continued fractions
Message-ID: <[email protected]>
References: <[email protected]>
	<[email protected]>
	<[email protected]>
	<[email protected]>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Disposition: inline
In-Reply-To: <[email protected]>
User-Agent: Mutt/1.5.20 (2009-06-14)
Status: RO
Content-Length: 920
Lines: 21

On Mon, Oct 17, 2011 at 11:58:34PM -0700, Darius Bacon wrote:
> > I think the search engine I wrote in 2006
> > <http://lists.canonical.org/pipermail/kragen-hacks/2006-August/000432.html>
> > might benefit from using Golomb coding or something similar for its
> > pseudo-posting-lists.  It currently uses the "Altavista trick" to encode
> > integers in variable numbers of bytes, 7 bits per byte, with one bit per byte
> > used as a termination marker, but I suspect that it can probably use
> > substantially less space with Golomb coding.
> 
> Altavista trick? Does it really go back no further? (I thought it was
> in ASN.1 BER, but apparently that did something more complicated, as
> usual in that design.)

It could easily be much older, but I've seen it referred to as that and simply
as "variable byte encoding".

> > Do you mind if I forward your mail and this one to kragen-discuss?
> 
> Not at all. 

Thanks!

----- End forwarded message -----
-- 
To unsubscribe: http://lists.canonical.org/mailman/listinfo/kragen-discuss