Alternatives and similar repositories for lvvlib

Users that are interested in lvvlib are comparing it to the libraries listed below

• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• cruppstahl / libfor
  A very fast scalar implementation for Frame Of Reference integer compression.
  ☆109Updated 9 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• jakogut / tinybloom
  A small, simple, easy to use bloom filter written in C.
  ☆35Updated 14 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• rcoh / treelayout
  Demonstrating the importance of laying out data in memory.
  ☆47Updated 7 years ago
• bakks / virginian
  A GPU Database
  ☆146Updated 7 years ago
• zeevt / csnappy
  Google snappy in C for Linux Kernel
  ☆39Updated 3 years ago
• umbrant / extsort
  External sorting of integers in C
  ☆20Updated 14 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• AlexKashuba / SQLite_JIT
  ☆27Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆137Updated 6 months ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆124Updated last year
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• haproxy-unofficial-obsolete-mirrors / libslz
  Mirror of libslz
  ☆34Updated 6 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• siganakis / tny
  Tiny data structures that pack a punch!
  ☆101Updated 13 years ago
• bshafiee / BFS
  Behrooz File System (BFS)
  ☆54Updated 9 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆163Updated 10 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year