JonLeonard-PriorityRTree

JonLeonard-PriorityRTree - The Priority R-Tree A...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree Lars Arge Department of Computer Science Duke University, Box 90129 Durham, NC 27708-0129 USA [email protected] Mark de Berg Department of Computer Science TU Eindhoven, P.O.Box 513 5600 MB Eindhoven The Netherlands [email protected] Herman J. Haverkort Institute of Information and Computing Sciences Utrecht University, PO Box 80 089 3508 TB Utrecht, The Netherlands [email protected] Ke Yi Department of Computer Science Duke University, Box 90129 Durham, NC 27708-0129, USA [email protected] ABSTRACT We present the Priority R-tree, or PR-tree, which is the frst R-tree variant that always answers a window query using O (( N/B ) 1 1 /d + T/B ) I/Os, where N is the number oF d - dimensional (hyper-) rectangles stored in the R-tree, B is the disk block size, and T is the output size. This is provably asymptotically optimal and signifcantly better than other R- tree variants, where a query may visit all N/B leaves in the tree even when T =0 . We also present an extensive experimental study oF the practical perFormance oF the PR- tree using both real-liFe and synthetic data. This study shows that the PR-tree perForms similar to the best known R-tree variants on real-liFe and relatively nicely distributed data, but outperForms them signifcantly on more extreme data. 1. INTRODUCTION Spatial data naturally arise in numerous applications, in- cluding geographical information systems, computer-aided design, computer vision and robotics. Therefore spatial database systems designed to store, manage, and manipulate spatial data have received considerable attention over the years. Since these databases often involve massive datasets, disk based index structures for spatial data have been re- searched extensively—see e.g. the survey by Gaede and G¨un- Supported in part by the National Science Foundation through RI grant EIA–9972879, CAREER grant CCR– 9984099, ITR grant EIA–0112849, and U.S.–Germany Co- operative Research Program grant INT–0129182. Supported by the Netherlands’ Organization for Scienti±c Research (NWO). Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. SIGMOD 2004 June 13-18, 2004, Paris, France. Copyright 2004 ACM 1-58113-859-8/04/06 . . . $ 5.00. ther [11]. Especially the R-tree [13] and its numerous vari- ants (see e.g. the recent survey by Manolopoulos et al. [19]) have emerged as practically efficient indexing methods. In this paper we present the Priority R-tree, or PR-tree ,wh ich is the ±rst R-tree variant that is not only practically efficient but also provably asymptotically optimal.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/30/2011 for the course COP 4810 taught by Professor Staff during the Spring '11 term at University of Central Florida.

Page1 / 12

JonLeonard-PriorityRTree - The Priority R-Tree A...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online