Messages in this thread | | | From | (H. Peter Anvin) | Subject | Re: b-tree search of filename in a directory | Date | 16 Dec 1999 12:59:27 -0800 |
| |
Followup to: <Pine.GSO.4.05.9912121619270.16581-100000@aa.eps.jhu.edu> By author: afei@jhu.edu In newsgroup: linux.dev.kernel > > In short, I believe the b-tree approach to expedite filename search is not > going to work unless the dir entry is essentially reconstructed so that a > directory on disk has both a directory entry table and a filename table. >
This was discussed at Linux Expo back in '98 I believe. The agreement back then was that the best way to go about this was to create a very wide B-tree using filename hash values.
-hpa
-- <hpa@transmeta.com> at work, <hpa@zytor.com> in private! "Unix gives you enough rope to shoot yourself in the foot."
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
| |