|< < 25 > >|

Unique

UniqueHash

If a partition doesn't fit in memory

Recursion: Partition the partition.

Cost of UniqueHash

Pretty much the same as sorting! log(N/B) / log(B) passes.

Conclusion

UniqueSort seems better than UniqueHash.

Sorted data is often useful!

Yet UniqueHash is available in some database systems.

|< < 25 > >|