nowfound

Life & fun · November 5, 2019

An Empirical Evaluation of Linear Probing Algorithms

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

An Empirical Evaluation of Linear Probing Algorithms launched on November 5, 2019 with 14 votes, #790 of 3,203 launches that month and more than 75% of that year's launches. The site was still online in September 2026, 6 years on.

Visit github.com ↗Alternativestop 25% of November 2019

In plain words

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 in hash table implementations. The work is categorized under Life & Fun and provides technical analysis for computer scientists and software developers interested in data structure optimization and algorithmic efficiency.

written from the facts on this page · September 2026

Does a similar job

all alternatives →
  • A hash array-mapped trie implementation in C2023 · github.com · ▲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…

  • AP
    A Probing Hash Table Framework2016 · chara.cs.illinois.edu · ▲27
  • FastGraphRAG – Better RAG using good old PageRank2024 · github.com · ▲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…

  • A portable hash map in C2024 · github.com · ▲176

    A small, portable, linear probing hash map. Contribute to e-dant/salmagundi development by creating an account on GitHub.

  • A reimplementation of Google's sparsehash in C2015 · github.com · ▲22

    A simple re-implementation of Google's sparsehash as a learning excercise. - qpfiffer/Simple-Sparsehash

  • A fast HNSW implementation in Rust2024 · github.com · ▲111

    HNSW implementation in Rust. Reference: https://arxiv.org/ftp/arxiv/papers/1603/1603.09320.pdf - swapneel/hnsw-rust

More life & fun this month

the category →

Source: Show HN post ↗

Launched alongside, November 2019

the whole month →
  • Manage all your small projects for free

    Work · 2019 · basecamp.com

  • Product tips in a comic book format

    Growth · 2019 · growth.design

  • A futuristic electric pickup truck from Tesla ⚡️

    Life & fun · 2019 · tesla.com

  • Cocoon▲674

    A private app for the most important people in your life

    Work · 2019 · cocoon.com

  • Adalo▲616

    Build apps for every platform, without code ✨

    Work · 2019 · adalo.com

  • Remove the background from any image for free

    Work · 2019 · stickermule.com