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
  ☆53Updated 14 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 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
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 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
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆124Updated last year
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• rcoh / treelayout
  Demonstrating the importance of laying out data in memory.
  ☆47Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• apache / lucy
  Mirror of Apache Lucy
  ☆99Updated 7 years ago
• cruppstahl / libfor
  A very fast scalar implementation for Frame Of Reference integer compression.
  ☆109Updated 9 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 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
• jimbelton / sxe
  libsxe, mak and related components
  ☆50Updated 2 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• umbrant / extsort
  External sorting of integers in C
  ☆20Updated 14 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 8 years ago
• stevedekorte / vertexdb
  C based graph db server using tokyocabinet & libevent
  ☆299Updated 7 years ago
• jedisct1 / Pincaster
  A fast persistent nosql database with a HTTP/JSON interface, not only for geographical data.
  ☆171Updated last week
• RaphaelJ / fast_strstr
  A fast substitution to the stdlib's strstr() sub-string search function.
  ☆116Updated 10 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆138Updated 7 months ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago