Bkd-tree: A dynamic scalable kd-tree Export

@misc{nn_tree-bkd, abstract = {In this paper we propose a new data 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.}, author = {Procopiuc, O. and Agarwal, P. and Arge, L. and Vitter, J.}, citeulike-article-id = {1297792}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/procopiuc02bkdtree.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/procopiuc02bkdtree.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/procopiuc02bkdtree.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/procopiuc02bkdtree.html}, keywords = {bkd-tree, data-structures, diplomarbeit}, posted-at = {2007-08-21 11:24:55}, priority = {3}, title = {Bkd-tree: A dynamic scalable kd-tree}, url = {http://citeseer.ist.psu.edu/procopiuc02bkdtree.html}, year = {2002} }

TY - GEN ID - nn_tree-bkd L3 - citeulike-article-id:1297792 N2 - In this paper we propose a new data 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. TI - Bkd-tree: A dynamic scalable kd-tree KW - bkd-tree KW - data-structures KW - diplomarbeit AU - Procopiuc, O AU - Agarwal, P AU - Arge, L AU - Vitter, J PY - 2002/// UR - http://citeseer.ist.psu.edu/procopiuc02bkdtree.html ER -