On Mar 18 2000, andy huhn wrote:
> I thought linear was O(n)?
Indeed it is. But I think Uwe was referring to n searches,
each O(n).
> What are some more modern file systems that speed this up, and how
> do they do it? Do they use a hash for the structure of the
> directory?
Modern file systems arrange file contents (and not only the
directory lists) as trees. One of such filesystem is ReiserFS
which seems to work very well (and, if you're using Linux, it
can be faster than ext2 for some operations and not only
processing directories with loads of files). But be warned: it
is still under development.
You can get ReiserFS patches (distributed under the GPL, for
instance) from http://devlinux.net/namesys/
It is also a journalling filesystem.
[]s, Roger...
--
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Rogerio Brito - [EMAIL PROTECTED] - http://www.ime.usp.br/~rbrito/
Nectar homepage: http://www.linux.ime.usp.br/~rbrito/opeth/
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
