TsinghuaDatabaseGroup / Similarity-Search-and-Join

Related projects: ⓘ

• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆54Updated 9 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 5 years ago
• dbis-ilm / pipefabric
  Stream processing engine
  ☆12Updated 3 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆157Updated 6 years ago
• jcarreira / cirrus-kv
  High-performance key-value store
  ☆12Updated 5 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆80Updated 6 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆0Updated 3 years ago
• caetanosauer / fineline-zero
  ☆12Updated 5 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 6 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated last year
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆37Updated 9 years ago
• ZhangZhenjie / bed-tree
  A flexible tree-based index structure to support edit distance search on strings
  ☆11Updated 6 years ago
• TsinghuaDatabaseGroup / Dima
  simialrity join or search on spark core directly
  ☆25Updated 4 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆26Updated 3 years ago
• efficient / fast-succinct-trie
  ☆24Updated 7 years ago
• hillbig / tx-trie
  Automatically exported from code.google.com/p/tx-trie
  ☆28Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated last year
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 6 years ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆15Updated 5 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 11 years ago
• lijinf2 / losha
  Distributed similarity search
  ☆9Updated 4 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆14Updated 6 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 2 years ago
• lijinf2 / gqr
  ☆16Updated 4 years ago
• junhe / wiser
  A fast text search engine built for SSDs, written in C++.
  ☆11Updated 2 years ago
• InitialDLab / XDB
  An approXimate DB that supports online aggregation queries
  ☆58Updated 5 months ago