Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Fastest way to recurse through VERY LARGE directory tree

by salva (Monsignor)
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 the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (21)
As of 2014-07-23 19:02 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (150 votes), past polls