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 13 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
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago
• pschanely / scoredb
  A simple database optimized for returning results by custom scoring functions.
  ☆20Updated 9 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• jmhodges / minhash
  An implementation of the MinHash algorithm in ruby using Murmur Hash
  ☆25Updated 16 years ago
• AlexKashuba / SQLite_JIT
  ☆27Updated 6 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 9 years ago
• umbrant / extsort
  External sorting of integers in C
  ☆20Updated 14 years ago
• seiflotfy / cmts
  Count-Min Tree Sketch: Approximate counting for NLP
  ☆10Updated 7 years ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆38Updated 3 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 8 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
• dankamongmen / libtorque
  A threaded, continuations-based I/O event library for manycore NUMA machines
  ☆72Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• dgryski / hokusai
  hokusai -- sketching streams in real-time
  ☆78Updated 8 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• lantiga / tinydnnc
  ☆11Updated 8 years ago
• jimbelton / sxe
  libsxe, mak and related components
  ☆50Updated 2 years ago
• jakogut / tinybloom
  A small, simple, easy to use bloom filter written in C.
  ☆35Updated 13 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆26Updated 10 years ago
• Amaury / AngstromDB
  Very simple noSQL database, created as an example during a talk. See FineDB for a real high-performance noSQL database.
  ☆14Updated 11 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆25Updated 6 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• efficient / ARF
  ☆11Updated 7 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