Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Fastest way to recurse through VERY LARGE directory tree

by salva (Abbot)
on Jan 21, 2011 at 07:08 UTC ( #883478=note: print w/replies, xml ) Need Help??


in reply to Fastest way to recurse through VERY LARGE directory tree

I am sure the bottleneck is going to be the disk I/O, so there is little you can do from Perl to speed the operation.

...well, maybe the order used to traverse the file system (deep or breadth first) could have some influence.

  • Comment on Re: Fastest way to recurse through VERY LARGE directory tree

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://883478]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (5)
As of 2017-12-17 23:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What programming language do you hate the most?




















    Results (466 votes). Check out past polls.

    Notices?