-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
2 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,7 +1,5 @@ | ||
# hloo | ||
|
||
`hloo` (Hash LOOkup) is a library for storing hashes and looking them up using distance queries. | ||
`hloo` (Hash LOOkup) is a library for storing hashes and finding them using distance queries. It uses an algorithm described in [this paper by Google](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/33026.pdf) (without the compression part). | ||
|
||
`hloo` implements the algorithm described in [this paper by Google](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/33026.pdf). | ||
|
||
`hloo` can perform exceptionally well, achieving roughly O(1) time to search on perfectly uniformly distributed hash data. However, in the real world data is often skewed, and in the worst cases (i.e. huge chunks of hashes are the same value) `hloo` will perform on par or slightly worse than a naive full scan of data. Always check the quality of your hashes! | ||
This algorithm can perform exceptionally well, achieving roughly O(1) time to search on perfectly uniformly distributed hash data. However, in the real world data is often skewed, and in the worst cases (i.e. huge chunks of hashes are the same value) it will perform on par or slightly worse than a naive full scan of data. Always check the quality of your hashes! |