Alternatives and similar repositories for metric-tree-demo

Users that are interested in metric-tree-demo are comparing it to the libraries listed below

• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• troydhanson / kvspool
  A library to support streaming data applications
  ☆24Updated 4 years ago
• veorq / blabla
  like ChaCha, but 64-bit instead of 32-bit thanks to BLAKE2b's permutation
  ☆15Updated 8 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆48Updated 6 years ago
• michaelmior / mvptree
  A fork of D Grant Starkweather's multiple vantage point tree library
  ☆41Updated 7 years ago
• facebookarchive / libafdt
  LIBrary for Asynchronous File Descriptor Transfer
  ☆41Updated 6 years ago
• armon / c-minheap-indirect
  Implements a Min-Heap / Priority Queue in C using an indirection table for memory efficiency.
  ☆28Updated 11 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• hyc / mleak
  malloc leak tracer
  ☆70Updated 3 years ago
• reverbrain / swarm
  Swarm is aiming at your web
  ☆31Updated 9 years ago
• bumptech / nitro
  Queueing/Networking Library
  ☆112Updated 11 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• efficient / ARF
  ☆11Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆74Updated 8 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
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆33Updated 8 years ago
• malbrain / ARTful
  ARTful radix tree
  ☆13Updated 8 years ago
• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆22Updated 11 years ago
• nmathewson / libottery
  A fast secure userspace pseudorandom number generator
  ☆83Updated 11 years ago
• reverbrain / smack
  Low-level IO storage which packs data into sorted (zlib/bzip2/snappy compressed) blobs
  ☆31Updated 12 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆47Updated 8 years ago
• haproxy-unofficial-obsolete-mirrors / libslz
  Mirror of libslz
  ☆34Updated 6 years ago
• abique / mimosa
  My personal C++ framework :^)
  ☆43Updated 5 months ago
• google / hashing-demo
  Sample implementation of a proposed C++ hashing framework
  ☆29Updated 9 years ago
• reverbrain / eblob
  Eblob is an append-only low-level IO library, which saves data in blob files. Created as low-level backend for elliptics
  ☆104Updated 6 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago