BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
☆17Aug 4, 2023Updated 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:
- Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)☆13Sep 5, 2021Updated 4 years ago
- LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)☆14Jul 8, 2021Updated 4 years ago
- Massive Sparse Data Clustering Based on Frequent Items (SIGMOD 2023) (CPU version)☆12Sep 13, 2023Updated 2 years ago
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆28Jul 9, 2021Updated 4 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 7 months ago
- Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)☆16Jul 9, 2021Updated 4 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆49Sep 12, 2022Updated 3 years ago
- Parallel, batch-dynamic kdtree☆13Jan 19, 2022Updated 4 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Dec 9, 2023Updated 2 years ago
- simd enabled column imprints☆11Feb 12, 2018Updated 8 years ago
- Accurate and Fast ALSH for Maximum Inner Product Search (KDD 2018)☆25Jul 8, 2021Updated 4 years ago
- PyTorch implementation of "A Simple Baseline for Low-Budget Active Learning".☆14Dec 22, 2021Updated 4 years ago
- ☆16Mar 16, 2021Updated 5 years ago
- SQL Optimizations using MLIR☆12Apr 5, 2020Updated 5 years ago
- A clustering algorithm that will perform clustering on each of a time-series of discrete datasets, and explicitly track the evolution of …☆17Sep 7, 2020Updated 5 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Feb 23, 2023Updated 3 years ago
- ☆16Jan 24, 2025Updated last year
- Secondary index on HBase☆18Oct 24, 2015Updated 10 years ago
- Crawler and parser of the Greek Parliament proceedings (1989-2020)☆18Jun 22, 2022Updated 3 years ago
- A 2d game engine and math lib based for JavaScript and HTML5 Canvas☆17Dec 23, 2017Updated 8 years ago
- ☆13Mar 22, 2022Updated 4 years ago
- ☆40Mar 11, 2020Updated 6 years ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Apr 10, 2024Updated last year
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆11Feb 7, 2026Updated last month
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- ☆10Feb 20, 2021Updated 5 years ago
- Term project completed for Scalable Machine Learning course; implemented k-d trees and ball trees to improve performance of parallel kNN …☆11Oct 18, 2022Updated 3 years ago
- SAC: A Co-Design Cache Algorithm for Emerging SMR-based High-Density Disks☆13Jan 13, 2020Updated 6 years ago
- The source code for PM-LSH (PVLDB 2020)☆13Nov 30, 2024Updated last year
- Code for "Building an Efficient Key-Value Store in a Flexible Address Space" (EuroSys '22)☆23Mar 17, 2025Updated last year
- Long-Tail Hashing (Learning to hash from more realistic long-tail datasets), SIGIR 2021, CCF A类.☆16Jul 20, 2021Updated 4 years ago
- Learning-based Approximate k-NN Search in Graph Databases☆11Nov 29, 2021Updated 4 years ago
- ☆17Jun 4, 2025Updated 9 months ago
- Forgetful Bloom filters☆16Mar 8, 2019Updated 7 years ago
- webGame☆13Aug 20, 2012Updated 13 years ago
- Code for Semi-crowdsourced Clustering with Deep Generative Models☆12Dec 9, 2022Updated 3 years ago
- Visual Hash for matching copies of visually similar images.☆16Mar 17, 2025Updated last year
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆28May 12, 2025Updated 10 months ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆25Jun 7, 2023Updated 2 years ago