Re: Hash Search is VERY slow


Pathologically Eclectic Rubbish Lister
	PerlMonks

by Anonymous Monk

on Sep 29, 2021 at 15:44 UTC ( [id://11137116]=note: print w/replies, xml )

Need Help??

This node falls below the community's threshold of quality. You may see it by logging in.

Comment on Re: Hash Search is VERY slow

Replies are listed 'Best First'.
Re^2: Hash Search is VERY slow by Anonymous Monk on Sep 29, 2021 at 17:44 UTC
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.	[reply]
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.	[reply]

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://11137116]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others chilling in the Monastery: (2)

As of 2024-04-19 00:59 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found