Efficiently Searching In-Memory Sorted Arrays: Revenge of Interpolation Search? [pdf]

This page summarizes the projects mentioned and recommended in the original post on news.ycombinator.com

InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
  • Efficiently-Searching-In-Memory-Sorted-Arrays

    Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?

  • 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-...

  • 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-...

  • InfluxDB

    Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

    InfluxDB logo
NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a more popular project.

Suggest a related project

Related posts

  • SoftHSM2 Maintainer Needed

    1 project | news.ycombinator.com | 3 May 2024
  • DuckDB-VSS: Vector Similarity Search for DuckDB

    1 project | news.ycombinator.com | 2 May 2024
  • OpenMLDB v0.9.0 Release: Major Upgrade in SQL Capabilities Covering the Entire Feature Servicing Process

    1 project | dev.to | 2 May 2024
  • From 0 to glTF with WebGPU: Basic Materials and Textures

    1 project | news.ycombinator.com | 2 May 2024
  • ESpeak-ng: speech synthesizer with more than one hundred languages and accents

    21 projects | news.ycombinator.com | 1 May 2024