HuangQiang / BC-Tree
BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
☆18Updated 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
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆50Updated last month
- ☆14Updated 3 weeks 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 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆73Updated last month
- ☆53Updated 5 months ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆13Updated 10 months ago
- Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)☆14Updated 3 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆25Updated 3 years ago
- ☆16Updated 3 years ago
- ☆37Updated 4 years ago
- ☆24Updated 2 years ago
- ☆17Updated 3 years ago
- ☆13Updated 2 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 3 months ago
- A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search☆66Updated 3 years ago
- [SIGMOD 2025] Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Ne…☆19Updated this week
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆14Updated 6 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 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
- High Performance Learned Index on Persistent Memory☆47Updated last year
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆132Updated 2 weeks ago
- CPAM: Compressed Parallel Augmented Maps☆23Updated 4 months ago
- A code base for Vexless☆13Updated 11 months ago
- ☆15Updated 8 years ago
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆18Updated 4 years ago
- A C++ library for the analysis of structural dynamic graphs☆26Updated 2 years ago