Bkd-Tree: A Dynamic Scalable kd-Tree
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 46-65
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Implementing I/O-efficient Data Structures Using TPIE2002
- External Memory Data Structures2002
- A Framework for Index Bulk Loading and DynamizationLecture Notes in Computer Science, 2001
- On two-dimensional indexability and optimal range search indexing1999
- Improving the query performance of high-dimensional index structures by bulk load operations1998
- The hB $^\Pi$ -tree: a multi-attribute index supporting concurrency, recovery and node consolidationThe VLDB Journal, 1997
- The R*-tree: an efficient and robust access method for points and rectangles1990
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Decomposable searching problemsInformation Processing Letters, 1979
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975