farsightsec / mtbl
immutable sorted string table library
☆80Updated 2 months ago
Alternatives and similar repositories for mtbl:
Users that are interested in mtbl are comparing it to the libraries listed below
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Iterator library.☆79Updated 5 years ago
- EWAH Compressed Bitmaps☆25Updated 4 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Hyper-Compact Virtual Estimators for Big Network Data Based on Register Sharing☆33Updated 7 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Git mirror for the FastBit library Subversion repository.☆71Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Utility to measure the performance of pcap network interfaces.☆21Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 8 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- An inverted trigram index for accelerated string matching in Sqlite.☆77Updated 10 years ago
- a quotient filter written in C☆84Updated 7 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago
- A distributed key-value cache with builtin materialized views.☆26Updated 10 years ago
- Userspace TCP/IP stack☆68Updated 11 years ago
- Simple out-of-process invoker☆18Updated 9 months ago
- ☆27Updated 8 years ago
- Eblob is an append-only low-level IO library, which saves data in blob files. Created as low-level backend for elliptics☆104Updated 5 years ago
- Fast 64 bit evolved hash.☆32Updated 7 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- ☆24Updated 10 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 11 months ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago