HuangQiang / BC-Tree
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
- 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
- Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)☆17Updated 3 years ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆51Updated 2 months ago
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆28Updated 3 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- ☆12Updated 3 months ago
- ☆38Updated 4 years ago
- ☆14Updated 2 months ago
- ☆59Updated 7 months ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ⚡ Faster vector search with PDX: A vertical data layout for vectors☆33Updated this week
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆14Updated 6 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆19Updated 3 years ago
- ☆16Updated 4 years ago
- High Performance Learned Index on Persistent Memory☆47Updated 2 years ago
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆90Updated 2 months ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- ☆12Updated 6 years ago
- ☆15Updated 8 years ago
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- ☆28Updated 2 years ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆14Updated last year
- [SIGMOD 2025] Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Ne…☆28Updated 2 months ago
- 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
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆24Updated last year
- ☆53Updated 11 months ago