[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]
Re: radix tree implementation for quota ?
On Sun, Nov 28, 2010 at 05:21:52PM +0000, Sad Clouds wrote:
> On Sun, 28 Nov 2010 17:53:59 +0100
> Manuel Bouyer <bouyer%antioche.eu.org@localhost> wrote:
> > One open question is how to store quota informations on disk.
> > At this time we use one big array indexed by uid or gid. This can
> > be very space-consuming if you have a very sparse uid/gid allocation,
> > this is why I don't think this simple format is suitable any more
> > (especially with 32bits uid/gid, and 64bit storage for various values).
> > Linux uses a radix tree for this, and I coudln't come up with a better idea
> > :)
> Wouldn't a hash table work?
I think it's too dependant on uid distribution, or even how much uid you
have. a tree scales and adapts better.
Manuel Bouyer <bouyer%antioche.eu.org@localhost>
NetBSD: 26 ans d'experience feront toujours la difference
Main Index |
Thread Index |