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
• phaistos-networks / Trinity
  Trinity IR Infrastructure
  ☆238Updated 6 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆439Updated 4 months ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last year
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• wheresvic / zsearch
  A high performance search engine
  ☆106Updated 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
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆43Updated 10 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• seomoz / simhash-cpp
  Simhashing in C++
  ☆135Updated 2 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆107Updated 12 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆129Updated 2 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆78Updated 4 years ago
• SeSaMe-NUS / genie
  ☆81Updated 7 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆267Updated 3 months ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 8 months ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 7 years ago
• izenecloud / big-data-made-easy
  Big Data Made Easy
  ☆185Updated 7 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated 2 months ago