tokenrove / fixie-trieLinks
Compact tries for fixed-width keys
☆26Updated 7 years ago
Alternatives and similar repositories for fixie-trie
Users that are interested in fixie-trie are comparing it to the libraries listed below
Sorting:
- qp tries and crit-bit tries☆121Updated 3 years ago
- A small DFA for under 16 states☆52Updated 7 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- The k-LSM: A relaxed, lock-free, linearizable priority queue☆23Updated 8 years ago
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- A threaded, continuations-based I/O event library for manycore NUMA machines☆73Updated 4 years ago
- Backtrace.io's resilient log record framing format☆40Updated 3 years ago
- fixed-length integer trim☆34Updated 2 years ago
- An-source C library developed and used at AppNexus.☆111Updated 5 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆37Updated 6 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Fast 64 bit evolved hash.☆33Updated 8 years ago
- Lock-free slab allocator / freelist.☆69Updated 10 years ago
- A distributed key-value cache with builtin materialized views.☆25Updated 10 years ago
- I-cache line packing and branch misprediction measuring tool☆18Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- ☆11Updated 7 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- Crit-bit tree (trie) library☆32Updated 11 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- RLU resizable hash-table☆17Updated 10 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A software-based Ethernet switch design built around a memory-efficient, high-performance, and highly-concurrent hash table for compact a…