amgt-d1 / DPCLinks
Daichi Amagata and Takahiro Hara, SIGMOD2021
☆15Updated last year
Alternatives and similar repositories for DPC
Users that are interested in DPC are comparing it to the libraries listed below
Sorting:
- BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)☆19Updated 2 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆30Updated 6 years ago
- ☆15Updated 8 months ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆25Updated 8 years ago
- GBBS: Graph Based Benchmark Suite☆213Updated 2 months ago
- ☆25Updated 4 years ago
- ☆22Updated 4 years ago
- A parallel (CUDA) implementation of skiplist☆15Updated 6 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆15Updated 2 months ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- GPU B-Tree with support for versioning (snapshots).☆51Updated 11 months ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- ☆11Updated 2 years ago
- Exact Single-Source SimRank Computation on Large Graphs☆13Updated 5 years ago
- ☆54Updated last year
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Updated 4 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 6 years ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆35Updated 3 months ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆71Updated 5 months ago
- CPAM: Compressed Parallel Augmented Maps☆25Updated last month
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- ☆12Updated last year
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆59Updated 4 years ago