On Mon, 2005-04-11 at 20:07 -0700, Peter Gordon wrote: > Ow Mun Heng wrote: > > dir_index > > Use hashed b-trees to speed up lookups in large directories. > > > > Can you explain to me this feature? It's the first I've heard of it. > > I'm not an expert or guru, but I'll sure try. From what I understand, the > filesystem normally stores the block and inode information in a very linear > fashion. When you enable this feature, this information is then stored in a > hashed B-tree [1] so that the information can be accessed and manipulated > faster. However, as far as I know this does incur a small storage penalty for > storing the extra node structure information. > > Hope that helps. :-/ > > [1] http://en.wikipedia.org/wiki/B-tree
Thanks for the link. Will look it up and read. -- Ow Mun Heng Gentoo/Linux on DELL D600 1.4Ghz 98% Microsoft(tm) Free!! Neuromancer 16:18:22 up 2 days, 7:03, 4 users, load average: 0.28, 0.59, 0.63 -- [email protected] mailing list
