luispedro / diskhashLinks
Diskbased (persistent) hashtable
☆164Updated 11 months ago
Alternatives and similar repositories for diskhash
Users that are interested in diskhash are comparing it to the libraries listed below
Sorting:
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Bloom-filter based minimal perfect hash function library☆265Updated 2 months ago
- A collection of succinct data structures☆209Updated last year
- An efficient trie implementation.☆255Updated 4 years ago
- Succinct Data Structure Library☆107Updated 11 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Compact Data Structures Library☆128Updated 11 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Rolling Hash C++ Library☆188Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- High-performance dictionary coding☆106Updated 8 years ago
- C library implementing the ridiculously fast CLHash hashing function☆281Updated last year
- qp tries and crit-bit tries☆121Updated 3 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- Bloom filters for C++11☆363Updated 3 years ago
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆50Updated 5 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- C++11 port of the PostgreSQL DBMS☆69Updated 9 years ago
- a quotient filter written in C☆86Updated 8 years ago
- A simple and small bloom filter implementation in plain C.☆302Updated 3 years ago
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago