BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
☆18Aug 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
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 6 months ago
- Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)☆16Jul 9, 2021Updated 4 years ago
- simd enabled column imprints☆11Feb 12, 2018Updated 8 years ago
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆11Feb 7, 2026Updated 3 weeks ago
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆28Jul 9, 2021Updated 4 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Sep 12, 2022Updated 3 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
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Apr 10, 2024Updated last year
- Parallel, batch-dynamic kdtree☆13Jan 19, 2022Updated 4 years ago
- ☆16Mar 16, 2021Updated 4 years ago
- ☆16Jan 24, 2025Updated last year
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Mar 17, 2025Updated 11 months ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Jun 7, 2023Updated 2 years ago
- Secondary index on HBase☆18Oct 24, 2015Updated 10 years ago
- EuroSys '24: "Trinity: A Fast Compressed Multi-attribute Data Store"☆19Mar 8, 2025Updated 11 months ago
- Accurate and Fast ALSH for Maximum Inner Product Search (KDD 2018)☆25Jul 8, 2021Updated 4 years ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆64Jan 22, 2025Updated last year
- Experiments on Multi-Source Domain Adaptation☆26Jan 4, 2019Updated 7 years ago
- JSONPath Streaming with Bit-Parallel Fast-Forwarding☆33Oct 10, 2024Updated last year
- ☆30Sep 14, 2022Updated 3 years ago
- A read-optimized learned index for unsorted data☆32Aug 10, 2023Updated 2 years ago
- reimplementing scalog from scratch☆31Oct 11, 2020Updated 5 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆212Aug 2, 2023Updated 2 years ago
- A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs☆76Dec 8, 2025Updated 2 months ago
- Naive Hilbert R-Tree implementation☆31Jan 31, 2015Updated 11 years ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 years ago
- Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…☆48Jun 21, 2025Updated 8 months ago
- ☆40Mar 11, 2020Updated 5 years ago
- 稀疏矩阵-向量乘的并行优化算法（OpenMP，AVX）☆11Jul 7, 2021Updated 4 years ago
- 🍭 A single-header C library for printing colored text to the console☆11Aug 6, 2024Updated last year
- Soul - an esoteric concatenative language☆12Apr 30, 2024Updated last year
- ☆10Aug 15, 2019Updated 6 years ago
- continuously update cloud database papers☆83May 22, 2024Updated last year
- ☆39Jun 20, 2020Updated 5 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Sep 8, 2025Updated 5 months ago
- ☆11Feb 21, 2023Updated 3 years ago