HuangQiang / BC-TreeLinks
BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
☆19Updated last year
Alternatives and similar repositories for BC-Tree
Users that are interested in BC-Tree are comparing it to the libraries listed below
Sorting:
- LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)☆15Updated 3 years ago
- Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)☆14Updated 3 years ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆54Updated 4 months ago
- ☆13Updated 4 months ago
- Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)☆17Updated 3 years ago
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆28Updated 3 years ago
- [SIGMOD 2025] Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Ne…☆37Updated 3 months ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- ☆38Updated 4 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ☆12Updated 4 months ago
- A fast approximate membership query data structure☆11Updated 10 months ago
- ☆61Updated 9 months ago
- High Performance Learned Index on Persistent Memory☆47Updated 2 years ago
- ⚡ Faster vector search with PDX: A vertical data layout for vectors☆37Updated 2 weeks ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- ☆53Updated last year
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆17Updated 2 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆107Updated this week
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆54Updated 4 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- ☆28Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆14Updated 6 years ago
- ☆16Updated 4 years ago