jonahharris / libcuckoofilterLinks
A C library implementation of a Cuckoo Filter
☆25Updated 3 years ago
Alternatives and similar repositories for libcuckoofilter
Users that are interested in libcuckoofilter are comparing it to the libraries listed below
Sorting:
- Embedded DB Benchmark Framework☆60Updated 4 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- Longest Prefix Match (LPM) library☆46Updated 2 years ago
- Concurrent trie-hash map library☆91Updated last year
- EWAH Compressed Bitmaps☆25Updated 4 years ago
- Static Radix Tree (Patricia trie) implementation in C☆50Updated 8 years ago
- Rabin fingerprinting and deduplication library in C☆28Updated 9 years ago
- A high-performance hash-table for network packet-processing applications (compatible with DPDK)☆37Updated 6 years ago
- a quotient filter written in C☆84Updated 7 years ago
- Count-Min sketch-based approximate counting library☆45Updated 3 weeks ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- AnchorHash - A Scalable Consistent Hash☆25Updated 3 years ago
- Transparently replace domain sockets with a fast shared memory channel☆69Updated 8 years ago
- The finest radix tree this side of the Linux kernel.☆34Updated 9 years ago
- Benchmarking Bloom, Cuckoo, Morton, and PD based filter.☆15Updated 3 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- pure luajit bloom filter implementation☆10Updated 9 years ago
- Helper library for parsing valid/invalid/broken/malformed DNS packets☆16Updated 4 years ago
- generate perfect hashes (alpha)☆77Updated 3 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 3 years ago
- A software-based Ethernet switch design built around a memory-efficient, high-performance, and highly-concurrent hash table for compact a…☆35Updated 9 years ago
- Wannabe Main Memory Database and More☆53Updated 4 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 6 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆160Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago