farsightsec / mtblLinks
immutable sorted string table library
☆81Updated 7 months ago
Alternatives and similar repositories for mtbl
Users that are interested in mtbl are comparing it to the libraries listed below
Sorting:
- High-performance dictionary coding☆105Updated 8 years ago
- Iterator library.☆79Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Feed-forward Bloom filters☆52Updated 14 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 6 years ago
- ☆26Updated 8 years ago
- An inverted trigram index for accelerated string matching in Sqlite.☆78Updated 11 years ago
- Simple out-of-process invoker☆18Updated 2 months ago
- A highly efficient Bloom filter library and command line tool written in Go.☆75Updated 2 years ago
- Utility to measure the performance of pcap network interfaces.☆21Updated 4 years ago
- Tracking, Benchmarking and Sharing Information about an open source embedded data storage engines, internals, architectures, data storage…☆182Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- ltrace clone that uses bcc + uprobes instead of ptrace☆47Updated 7 years ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 6 years ago
- Golomb Coded Sets☆94Updated 8 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆37Updated 6 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A fast secure userspace pseudorandom number generator☆83Updated 11 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- Access Abseil Swiss Tables from C☆112Updated 3 years ago
- Mount Everest Application Framework☆119Updated 3 weeks ago
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- Rolling Hash C++ Library☆187Updated last year
- 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