Alternatives and similar repositories for ds2i

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

• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• ot / succinct
  A collection of succinct data structures
  ☆207Updated last year
• phaistos-networks / Trinity
  Trinity IR Infrastructure
  ☆238Updated 5 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆437Updated last month
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆42Updated 10 years ago
• wheresvic / zsearch
  A high performance search engine
  ☆107Updated 8 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 6 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆124Updated last year
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• seomoz / simhash-cpp
  Simhashing in C++
  ☆135Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆107Updated 11 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 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
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆280Updated 7 months ago
• izenecloud / big-data-made-easy
  Big Data Made Easy
  ☆185Updated 7 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆128Updated 2 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆86Updated 7 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 4 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago