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
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆140Updated 8 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• schroederdewitt / leapfrog-triejoin
  High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)
  ☆22Updated 9 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
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated 11 months ago
• dbis-ilm / pipefabric
  Stream processing engine
  ☆12Updated 4 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 6 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 9 years ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated 10 months ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 4 years ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆135Updated 2 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆128Updated 10 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆128Updated 2 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆46Updated 2 months ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆86Updated 7 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
• Accla / graphulo
  Graphulo: Accumulo library of matrix math primitives and graph algorithms
  ☆79Updated 2 weeks ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago