Messages in this thread | | | Subject | Re: Ext2fs and hashed table. | Date | Sun, 1 Jun 1997 18:07:49 +0200 (MET DST) | From | (Rogier Wolff) |
| |
Stephen C. Tweedie wrote: > > No, b-trees are the *WRONG* way to do it, big time. Except for *very* > large directories, tens or hundreds of thousands of entries. b-trees > have got far too much overhead for 99.99% of cases. Hash tables work > a lot better, and there are schemes for dynamically sizing the hash > table which give most of the scalability of b-tree lookup.
You know, apple's fast filesystem (HFS, whatever that stands for) uses btrees. But it has a unified name space. Thus
find / -name blabla\*
is an operation that you can do REALLY FAST on an HFS filesystem.
Roger.
| |