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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)☆13Sep 5, 2021Updated 4 years ago
- Massive Sparse Data Clustering Based on Frequent Items (SIGMOD 2023) (CPU version)☆12Sep 13, 2023Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 10 months ago
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Nov 12, 2020Updated 5 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆49Sep 12, 2022Updated 3 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- 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
- ☆16Mar 16, 2021Updated 5 years ago
- Experiments on Multi-Source Domain Adaptation☆26Jan 4, 2019Updated 7 years ago
- SQL Optimizations using MLIR☆12Apr 5, 2020Updated 6 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.☆13Feb 23, 2023Updated 3 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- ☆16Jan 24, 2025Updated last year
- Effective Abstract Reasoning with Dual-Contrast Network☆11Jun 25, 2021Updated 5 years ago
- Secondary index on HBase☆18Oct 24, 2015Updated 10 years ago
- Crawler and parser of the Greek Parliament proceedings (1989-2020)☆20Jun 22, 2022Updated 4 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
- IOManager tries to bridge the gap in existing async framework to build full async networked/storage services☆12Jun 9, 2026Updated 3 weeks ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- ☆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
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆65Jan 22, 2025Updated last year
- Code for "Building an Efficient Key-Value Store in a Flexible Address Space" (EuroSys '22)☆24Mar 17, 2025Updated last year
- Learning-based Approximate k-NN Search in Graph Databases☆11Nov 29, 2021Updated 4 years ago
- ☆18Jun 4, 2025Updated last year
- webGame☆13Aug 20, 2012Updated 13 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Visual Hash for matching copies of visually similar images.☆16Mar 17, 2025Updated last year
- Naive Hilbert R-Tree implementation☆30Jan 31, 2015Updated 11 years ago
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆28May 12, 2025Updated last year
- Spectral Clustering in C++☆17Jan 8, 2013Updated 13 years ago
- RACE sketches for kernel density estimation (KDE)☆14Jan 27, 2020Updated 6 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆25Jun 7, 2023Updated 3 years ago
- ☆17Oct 13, 2022Updated 3 years ago