Skip to content

Conversation

@leon-barrett
Copy link

These resulted in dramatic performance improvements in our usage. The
biggest gain was from using a lookup table to avoid computing exp as
often. Alas, I don't have exact benchmark numbers handy.

The specific speedups are:

  • Use a lookup table for powers of bytes
  • Use murmur3 hash instead of md5
  • Short-circuit estimateSize when we can skip many powers

These resulted in dramatic performance improvements in our usage. The
biggest gain was from using a lookup table to avoid computing `exp` as
often. Alas, I don't have exact benchmark numbers handy.

The specific speedups are:

* Use a lookup table for powers of bytes
* Use murmur3 hash instead of md5
* Short-circuit estimateSize when we can skip many powers
@CLAassistant
Copy link

CLAassistant commented Dec 28, 2017

CLA assistant check
All committers have signed the CLA.

@leon-barrett
Copy link
Author

Thanks for this useful library! I used it in a case where I was computing many intersections, so I needed to speed up some of the computations, and I thought it would be helpful to contribute back my speedups. I hope they prove helpful.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants