Efficiently-Searching-In-Memory-

By UWHustle

Efficiently-Searching-In-Memory- Alternatives

Similar projects and alternatives to Efficiently-Searching-In-Memory-

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better Efficiently-Searching-In-Memory- alternative or higher similarity.

Efficiently-Searching-In-Memory- reviews and mentions

Posts with mentions or reviews of Efficiently-Searching-In-Memory-. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-06-03.
  • Efficiently Searching In-Memory Sorted Arrays: Revenge of Interpolation Search? [pdf]
    2 projects | news.ycombinator.com | 3 Jun 2023
    Big fan on your presentation on binary search that amortised multiple concurrent searches. I did several variations on binary search and always compared against the best one. [0] From what I remember, some variations were compiled to a branchless implementation and some were compiled to implementations that used a branch. I had many passes of analysis by pasting into godbolt with identical compilers and flags. Power of 2 binary search did better on small arrays iirc, but are the first to hit conflict misses. For larger arrays, I believe the branchy search algorithms start to do better since half their branches get predicted correctly.

    I haven't looked at ITP, and other than being cautious about the cost I've seen of unrelated hybrid algorithms, I would need a substantial amount of time to analyze it enough to comment further. I'm on the BQN discord if you wanted a different form of communication.

    [0] https://github.com/UWHustle/Efficiently-Searching-In-Memory-...

Stats

Basic Efficiently-Searching-In-Memory- repo stats
1
-
-
-

Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com