Date: Wed, 8 Jun 2005 02:29:05 -0700 (PDT) From: Arne "Wörner" <arne_woerner@yahoo.com> To: freebsd-fs@freebsd.org Subject: Re: you are in an fs with millions of small files Message-ID: <20050608092905.20122.qmail@web41214.mail.yahoo.com> In-Reply-To: <20050608081326.3455.qmail@web41206.mail.yahoo.com>
next in thread | previous in thread | raw e-mail | index | archive | help
--- Arne Wörner <arne_woerner@yahoo.com> wrote: > --- Giorgos Keramidas <keramida@freebsd.org> wrote: > But I do not know if the shift operations in L are not so > good... > > But the memory usage looks quite good to me... > > I say, the sort of the directory entries should have a time > complexity of O(N*log(N))? > > Do you think, I should try to implement it? > Oooops... I just compared my algorithm to ls(1). And ls(1) is about 12 times faster than my algorithm with a 120000 files directory. First putting the entries into my data structure (but without sorting) and then using qsort is a little bit faster than ls(1). -Arne :-) __________________________________ Discover Yahoo! Find restaurants, movies, travel and more fun for the weekend. Check it out! http://discover.yahoo.com/weekend.html
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20050608092905.20122.qmail>