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
  ☆200Updated last year
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆42Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• wheresvic / zsearch
  A high performance search engine
  ☆105Updated 8 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 9 months ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆122Updated 9 months ago
• phaistos-networks / Trinity
  Trinity IR Infrastructure
  ☆237Updated 5 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆429Updated last year
• dcjones / hat-trie
  An efficient trie implementation.
  ☆253Updated 4 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• simongog / sdsl
  Succinct Data Structure Library
  ☆105Updated 11 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆154Updated 11 months ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 7 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 12 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
  ☆63Updated 9 months ago
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆25Updated 6 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…
  ☆76Updated 4 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 years ago
• SeSaMe-NUS / genie
  ☆80Updated 6 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated 6 months ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆85Updated 5 months ago