Bkd-Tree: A Dynamic Scalable kd-Tree

Autor:	Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter, Pankaj K. Agarwal
Rok vydání:	2003
Předmět:	Structure (mathematical logic) Multidimensional analysis Tree (data structure) k-d tree Computer science Scalability Search engine indexing Data mining Data structure computer.software_genre Algorithm computer Auxiliary memory
Zdroj:	Advances in Spatial and Temporal Databases ISBN: 9783540405351 SSTD
DOI:	10.1007/978-3-540-45072-6_4
Popis:	In this paper we propose a new index structure, called the Bkd-tree, for indexing large multi-dimensional point data sets. The Bkd-tree is an I/O-efficient dynamic data structure based on the kd-tree. We present the results of an extensive experimental study showing that unlike previous attempts on making external versions of the kd-tree dynamic, the Bkd-tree maintains its high space utilization and excellent query and update performance regardless of the number of updates performed on it.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::adcd8a077743892876a3d5589561599e https://doi.org/10.1007/978-3-540-45072-6_4 Zobrazit plný text záznamu