large directory algorithms - B-tree? - Thread - go-pugleaf

Thread View: comp.unix.internals

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Lester Buck Sun, 10 Jan 1993 05:10

large directory algorithms - B-tree?

#2626

Author: Lester Buck
Date: Sun, 10 Jan 1993 05:10

13 lines
994 bytes

A colleague is designing a Unix name server (effectively namei) which
needs to scale to very large (possibly to 10**12) numbers of names.

I remember once seeing a passing reference to an implementation of Unix
directory algorithms which used B-trees.  It was described as a failure,
as the complexity of a full blown B-tree was not necessary for typical
Unix directory sizes.  Can anyone supply a reference to this work, such
as a Usenix paper?

Thanks alot!

-- 
A. Lester Buck   buck@siswat.hou.tx.us   ...!uhnix1!siswat!buck

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads