Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^2: Hash Search is VERY slow

by Anonymous Monk
on Sep 29, 2021 at 17:44 UTC ( #11137123=note: print w/replies, xml ) Need Help??


in reply to Re: Hash Search is VERY slow
in thread Hash Search is VERY slow

According to Knuth's seminal book Sorting and Searching, an external merge sort has a complexity of O(n log(n)) and this will hold true for any data volume: it will never "hit the wall." Once the data has been [externally ...] sorted in this way, it now becomes trivial to know which URL-keys occur and also to know how many instances exist of each distinct value: a simple sequential read of the sorted file will tell you all of this at once.

Replies are listed 'Best First'.
Re^3: Hash Search is VERY slow
by Anonymous Monk on Oct 01, 2021 at 17:43 UTC

    oh, look. the monkey can copy text out of a book.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://11137123]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (3)
As of 2021-11-27 20:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?