Life & fun · alternatives · 2026

24 alternatives to An Empirical Evaluation of Linear Probing Algorithms

An Evaluation of Linear Probing Hashtable Algorithms - senderista/hashtable-benchmarks

This is a GitHub repository containing an empirical evaluation of linear probing algorithms, published in 2019. It presents research comparing the performance characteristics of different linear probing approaches used… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. An Empirical Evaluation of Linear Probing Algorithms launched in 2019; newer entries below may have overtaken it.

1
A hash array-mapped trie implementation in C▲171
Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…
2023 · github.com · its alternatives →
2AP
A Probing Hash Table Framework▲27
2016 · chara.cs.illinois.edu · its alternatives →
3
FastGraphRAG – Better RAG using good old PageRank▲457
Hey there HN! We’re Antonio, Luca, and Yuhang, and we’re excited to introduce Fast GraphRAG, an open-source RAG approach that leverages knowledge graphs and the 25 years old PageRank for better information retrieval and reasoning. Building a good RAG pipeline these days takes a lot of manual optimizations. Most engineers intuitively start from naive RAG: throw everything in a vector database and hope that semantic search is powerful enough. This can work for use cases where accuracy isn’t too important and hallucinations are tolerable, but it doesn’t work for more difficult queries that…
2024 · github.com · its alternatives →
4
A portable hash map in C▲176
A small, portable, linear probing hash map. Contribute to e-dant/salmagundi development by creating an account on GitHub.
2024 · github.com · its alternatives →
5
Glidesort, a new stable sort in Rust up to ~4x faster for random data▲389
Hi all, I've talked about glidesort a few times on HN already, but it's finally ready for release. If you have any questions, feel free to ask. An academic paper on glidesort that goes into a lot more detail than the readme is upcoming, but is not ready yet. I will be giving a talk on glidesort tomorrow at FOSDEM 2023 in the Rust Devroom at 16:10, you can seek me out there as well. In other news, I am leaving academia soon, so if you have interesting (Rust) jobs the coming months feel free to approach me.
2023 · github.com · its alternatives →
6
A reimplementation of Google's sparsehash in C▲22
A simple re-implementation of Google's sparsehash as a learning excercise. - qpfiffer/Simple-Sparsehash
2015 · github.com · its alternatives →
7
A fast HNSW implementation in Rust▲111
HNSW implementation in Rust. Reference: https://arxiv.org/ftp/arxiv/papers/1603/1603.09320.pdf - swapneel/hnsw-rust
2024 · github.com · its alternatives →
8
Chonkie – A Fast, Lightweight Text Chunking Library for RAG▲199
I built Chonkie because I was tired of rewriting chunking code for RAG applications. Existing libraries were either too bloated (80MB+) or too basic, with no middle ground. Core features: - 21MB default install vs 80-171MB alternatives - 33x faster token chunking than popular alternatives - Supports multiple chunking strategies: token, word, sentence, and semantic - Works with all major tokenizers (transformers, tokenizers, tiktoken) - Zero external dependencies for basic functionality Technical optimizations: - Uses tiktoken with multi-threading for faster tokenization - Implements…
2024 · github.com · its alternatives →
9WH
We have built a benchmark platform for graph databases▲83
2022 · memgraph.com · its alternatives →
10
A benchmark for analytical databases (Snowflake, Druid, Redshift)▲137
I created a web page to compare different analytical databases (both self-managed and services, open-source and proprietary) on a realistic dataset. It contains 20+ databases, each with installation and data loading scripts. And they can be compared to each other on a set of 43 queries, by data load time or by storage size. There are switches to select different types of databases for comparison - for example, only MySQL compatible or PostgreSQL compatible. If you play with the switches, many interesting details will be uncovered. Full description:…
2022 · benchmark.clickhouse.com · its alternatives →
11
A radically more scalable alternative to Bayesian Optimization▲96
Experimental Global Optimization Algorithm. Contribute to chrisstroemel/Simple development by creating an account on GitHub.
2018 · github.com · its alternatives →
12
A Golang Package for Consistent Hashing with Bounded Loads▲50
A Go library that implements Consistent Hashing and Consistent Hashing With Bounded Loads. - lafikl/consistent
2017 · github.com · its alternatives →
13
A Lock- and wait-free hashtable (and an array too), written in C▲24
📶 A lock- and wait-free hashtable (and an array too) - mulle-concurrent/mulle-concurrent
2016 · github.com · its alternatives →
14
Tantivy▲68
A full-text, horse-speed search engine library in Rust
2022 · github.com · its alternatives →
15
Checking 320M passwords in milliseconds with serverless bloom filters▲33
Using serverless functions to provide an API for checking potential passwords against an enormous corpus of passwords leaked from security breaches. - jthomas/serverless-pwned-passwords
2017 · github.com · its alternatives →
16
Beamsplitter – a new possibly universal hash▲69
:gem: Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS - DO-SAY-GO/beamsplitter
2020 · github.com · its alternatives →
17
I started a repo for sharing algorithm implementations▲52
Everything that would be here is in the README. I hope this gets big, it has tons of potential.
2013 · github.com · its alternatives →
18
Flippy Bit And The Attack Of The Hexadecimals▲78
Bitwise operations and conversions to hexadecimals
2016 · flippybitandtheattackofthehexadecimalsfrombase16.com · its alternatives →
19
Simple Hash Table Implementation for C▲42
Simple hash table implementation for C. Contribute to watmough/jwHash development by creating an account on GitHub.
2015 · github.com · its alternatives →
20
Purely Functional Data Structures▲61
A guide to functional programming
2016 · amazon.com · its alternatives →
21
A concurrent thread-safe hash map implemented in C++▲17
A concurrent thread-safe hash map implemented in C++ - kshk123/hashMap
2017 · github.com · its alternatives →
22
A benchmark + latency sim for LLM db queries: ClickHouse / Postgres▲12
Performance comparison of ClickHouse vs PostgreSQL using LLM-style query patterns on realistic aircraft tracking data - GitHub - 514-labs/LLM-query-test: Performance comparison of ClickHouse vs PostgreSQL using LLM-style query patterns on realistic aircraft tracking data
2025 · github.com · its alternatives →
23
Semi-index - Speed up JSON parsing in MapReduce-like tasks▲9
Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space" - ot/semi_index
2011 · github.com · its alternatives →
24
Rust Based Per-Token Late Interaction Dense Search▲8
Happy to release FastPlaid, which aim to ease and accelerate ColBERT and ColPali retrieval
2025 · github.com · its alternatives →

Also compare

Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →