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 3 years ago
• dbis-ilm / pipefabric
  Stream processing engine
  ☆13Updated 4 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆141Updated 8 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆158Updated 7 years ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• graindb / graindb
  ☆19Updated 3 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 3 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆11Updated 9 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆50Updated 6 years ago
• s-store / s-store
  S-Store Transactional Streaming Data Management System
  ☆22Updated 5 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated last month
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 6 months 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
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆48Updated 3 months ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 7 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated 11 months ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 5 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆128Updated 2 years ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆12Updated 6 years ago