HuangQiang / BC-TreeLinks
BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
☆19Updated 2 years ago
Alternatives and similar repositories for BC-Tree
Users that are interested in BC-Tree are comparing it to the libraries listed below
Sorting:
- ☆15Updated 9 months ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 3 months ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Updated last year
- simd enabled column imprints☆11Updated 7 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆61Updated 9 months ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆89Updated 6 years ago
- ☆38Updated 5 years ago
- Parallel Balanced Binary Tree Structures☆120Updated 7 months ago
- ☆12Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆26Updated last year
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- ☆55Updated last year
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 4 years ago
- ☆13Updated 9 months ago
- ☆30Updated 3 years ago
- ☆15Updated 5 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Updated 3 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 5 years ago
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆11Updated last week
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Updated 2 years ago
- ☆12Updated 6 years ago
- [SIGMOD 2025] Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Ne…☆53Updated 5 months ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆13Updated 10 months ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 7 months ago
- Simple baselines for "Learned Indexes"☆158Updated 7 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago