Store the estimated locations of items in the super blocks so that we can improve our lookup time when using binarySearch #528
Comments
hmottestad
added a commit
to HASMAC-AS/qEndpoint
that referenced
this issue
Nov 27, 2024
hmottestad
added a commit
to HASMAC-AS/qEndpoint
that referenced
this issue
Nov 27, 2024
5 tasks
hmottestad
added a commit
to HASMAC-AS/qEndpoint
that referenced
this issue
Dec 4, 2024
hmottestad
added a commit
to HASMAC-AS/qEndpoint
that referenced
this issue
Dec 11, 2024
…ly update mid point, also look closer to the midpoint to begin with
hmottestad
added a commit
to HASMAC-AS/qEndpoint
that referenced
this issue
Dec 11, 2024
… track of the estimated location of values in the underlying long array. This assumes that the values are ordered.
ate47
pushed a commit
that referenced
this issue
Dec 12, 2024
* we need to specify the version of jackson * GH-528 improve binary search in super blocks by keeping track of the estimated location of values in the underlying long array. This assumes that the values are ordered. * improved bit shifting in select1 by using Long.numberOfTrailingZeroes * only create the new Values if we are going to query the native store * reduce memory pressure * revert some changes based on review
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
No description provided.
The text was updated successfully, but these errors were encountered: