Alternatives and similar repositories for sdk2tree

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

• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆143Updated 8 years ago
• dbis-ilm / pipefabric
  Stream processing engine
  ☆13Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆31Updated 4 years ago
• s-store / s-store
  S-Store Transactional Streaming Data Management System
  ☆22Updated 5 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆158Updated 7 years ago
• graindb / graindb
  ☆20Updated 3 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• t1mm3 / vldb_voila
  Query engine synthesizer based on, our domain-specific language, VOILA
  ☆13Updated 4 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆12Updated 6 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆50Updated 4 months ago
• schroederdewitt / leapfrog-triejoin
  High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)
  ☆23Updated 9 years ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 5 years ago
• ldbc / ldbc_graphalytics
  Generic driver for LDBC Graphalytics implementation
  ☆86Updated 10 months ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 2 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆19Updated 7 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• ldbc / gcore-spark
  Implementation of the G-CORE graph query language on Spark
  ☆15Updated 4 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆15Updated 3 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• dbtoaster / dbtoaster-backend
  The current backend of DBToaster, implemented in Scala.
  ☆65Updated 3 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 9 months ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆21Updated 5 years ago