Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Fastest way to recurse through VERY LARGE directory tree

by JavaFan (Canon)
on Jan 21, 2011 at 03:08 UTC ( #883449=note: print w/ replies, xml ) Need Help??


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

Benchmark.

It may very well be that whatever you come up with is only faster than File::Find on some setups of disks/volume managers/filesystem, and slower on others.

You need to benchmark to find out.

Now, in theory, carefully handcrafting something that does exactly what you need is going to be faster than a more general setup than File::Find. But whether that's actually be measurable is a different question.

So, benchmark.

Of course, as you describe the problem, the bottleneck might very well be your I/O.

Hence, benchmark.

Have I said you should benchmark? No? Well, benchmark!


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://883449]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (18)
As of 2014-10-30 17:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (208 votes), past polls