Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Bkd-tree: A Dynamic Scalable kd-tree Octavian Procopiuc
 

Summary: Bkd-tree: A Dynamic Scalable kd-tree
Octavian Procopiuc

, Pankaj K. Agarwal

,
Lars Arge

, and Jeffrey Scott Vitter


Department of Computer Science, Duke University
Durham, NC 27708, USA
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

  

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

 

Collections: Computer Technologies and Information Sciences