Capacity-Aware Cluster Rebalancing for Efficient R-Tree Indexing
- 11 October 2026
- book chapter
- Published by Springer Nature
- p. 223-232
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the Costs and Benefits of Learned Indexing for Dynamic High-Dimensional Data2025
- Scaling Learned Metric Index to 100M Datasets2024
- Organizing Similarity Spaces Using Metric Hulls2021
- Balanced K-Means for Clustering2014
- Friendship and mobility2011
- Product Quantization for Nearest Neighbor SearchIEEE Transactions on Pattern Analysis and Machine Intelligence, 2010
- Bulk insertion for R-trees by seeded clusteringData & Knowledge Engineering, 2006
- STR: a simple and efficient algorithm for R-tree packing2002
- A greedy algorithm for bulk loading R-trees1998
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982