We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Robert Sedgewick from Princeton presented a new algorithm for cardinality estimation at AofA '16.
It is inspired in HyperLogLog, but it reduces de memory footprint (even more!).
Would be great (and easy) implement it and use it as default in libDori.
For more information, you can find the slides of the presentation here
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Robert Sedgewick from Princeton presented a new algorithm for cardinality estimation at AofA '16.
It is inspired in HyperLogLog, but it reduces de memory footprint (even more!).
Would be great (and easy) implement it and use it as default in libDori.
For more information, you can find the slides of the presentation here
The text was updated successfully, but these errors were encountered: