Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Bkdtree: A Dynamic Scalable kdtree Octavian Procopiuc 1? , Pankaj K. Agarwal 1?? ,
 

Summary: Bkd­tree: A Dynamic Scalable kd­tree
Octavian Procopiuc 1? , Pankaj K. Agarwal 1?? ,
Lars Arge 1? ? ? , and Jeffrey Scott Vitter 2y
1 Department of Computer Science, Duke University
Durham, NC 27708, USA
2 Department of Computer Science, Purdue University
West Lafayette, IN 47907, USA
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.
1 Introduction
The problem of indexing multi­dimensional point data sets arises in many applications
and has been extensively studied. Numerous structures have been developed, high­
lighting the difficulty of optimizing multiple interrelated requirements that such multi­
dimensional indexes must satisfy. More precisely, an efficient index must have high
space utilization and be able to process queries fast, and these two properties should

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

 

Collections: Computer Technologies and Information Sciences