A C++ library of Concurrent Data Structures

Daily ArXiv Papers.

[SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search

Lightweight profiler library for c++

Python code to study how HNSW works

hnsw implemented by python

build your own vector database -- the littlest hnsw

Concurrent Deferred Reference Counting

Elixir binding for the hnswlib library.

GBBS: Graph Based Benchmark Suite

A curated list of awesome parallel computing resources

Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best seq…

Benchmarks of approximate nearest neighbor libraries in Python

Library for lock-free locks

为HSNW源码加上了详细的注释

A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and related academic and industrial work

A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such algorithms.

Let's implement some synchronization primitives, shall we?

Compact and efficient synchronization primitives for Rust. Also provides an API for creating custom synchronization primitives.

C++17 Cache Data Structure Library

HNSW tutorial

A simple C++11 Thread Pool implementation

Course Project from CelebMask-HQ

Concurrency Control on HNSW

rbtree implementation adapted from linux kernel thus can be used in your own c program(of course in userspace).

Probably the fastest coroutine lib in the world!

Modern concurrency for C++. Tasks, executors, timers and C++20 coroutines to rule them all

Practical multithreading tutorials. Languages supported: C++, Java, C#, Python, Javascript/Nodejs.

a thread-safe concurrent map for go

A fast single-producer, single-consumer lock-free queue for C++