[lkml]   [2001]   [Dec]   [7]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [reiserfs-dev] Re: Ext2 directory index: ALS paper and benchmarks
On December 6, 2001 12:27 pm, Ragnar Kjørstad wrote:
> There is obviously something missing in this picture, or reiserfs would
> be as fast as ext2 for random access and much faster for access in
> sequential order by filename spelling.
> (a "random" hash should not be significantly better than a hash that
> preserves order, because the randomness in the hash is of course not the
> same random order in wich the files are accessed. The only exception is
> that hashes that preserve order may have a harder time using the full
> hash-space evenly)
> So, did anyone investigate why ext2 is faster than reiserfs in theese
> cases, or try benchmarking ext2 with one of the reiserfs-hashes (eg r5)?
> We know from earlier benchmarks on reiserfs (tea vs r5 tests, and r5 vs
> maildir-hash) that a hash that preserves order can give a magnitude of
> order performance improvement in certain cases.

I did try R5 in htree, and at least a dozen other hashes. R5 was the worst
of the bunch, in terms of uniformity of distribution, and caused a measurable
slowdown in Htree performance. (Not an order of magnitude, mind you,
something closer to 15%.)

An alternative way of looking at this is, rather than R5 causing an order of
magnitude improvement for certain cases, something else is causing an order
of magnitude slowdown for common cases. I'd suggest attempting to root that

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-03-22 13:13    [W:0.150 / U:3.944 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site