Alternatives and similar repositories for DPC

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

• wheatman / BP-Tree
  ☆16Updated last year
• HuangQiang / BC-Tree
  BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
  ☆18Updated 2 years ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆12Updated 6 years ago
• pkumod / GraphSetIntersection
  Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…
  ☆31Updated 7 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 6 months ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆216Updated last month
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆26Updated 4 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆90Updated 6 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• TatsuyaShirakawa / nndescent
  Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++
  ☆30Updated 8 years ago
• hcho3 / skiplist_cuda
  A parallel (CUDA) implementation of skiplist
  ☆15Updated 7 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• Shekhale / gbnns_theory
  Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''
  ☆19Updated 5 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 7 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• omarobeya / parallel-inplace-radixsort
  ☆23Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆72Updated 9 months ago
• CGCL-codes / DCF
  Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…
  ☆39Updated 8 years ago
• cmuparlay / pbbslib
  ☆25Updated 5 years ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆27Updated last year
• gaoj0017 / ADSampling
  [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
  ☆63Updated last year
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆122Updated 10 months ago
• naivewong / timeunion
  ☆12Updated 3 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆34Updated 10 months ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 11 months ago
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆60Updated 5 years ago