loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
XXIII International Conference of the Chilean Computer Science Society
A Performance Comparison among the Traditional R-trees, the Hilbert R-tree and the SR-tree
Chill?n, Chile
November 06-November 07
ISBN: 0-7695-2008-1
Ricardo Rodrigues Ciferri, State University of Maring? - Brazil
Ana Carolina Salgado, Federal University of Pernambuco - Brazil
Val?ria Ces?rio Times, Federal University of Pernambuco - Brazil
M?rio A. Nascimento, University of Alberta - Canada
Geovane Cayres Magalh?es, State University of Campinas - Brazil
This work investigates the performance of several spatial access methods with respect to the distribution of the indexed spatial objects. Although having gathered storage and insertion costs as well, this work focuses on some issues regarding query costs. The performance results have showed that the R+-tree was the best spatial index structure for the point queries and the enclosure range queries, whereas the R*-trees have produced the best outcomes for the intersection and the containment range queries. The Hilbert R-tree and the SR-tree have generated low performance results for any investigated query type. However, additional performance tests have showed that a variation in both the size and the shape properties of the data rectangles provided competitive results for the Hilbert R-tree and the SR-tree, mainly for the intersection and the containment queries.
Citation:
Ricardo Rodrigues Ciferri, Ana Carolina Salgado, Val?ria Ces?rio Times, M?rio A. Nascimento, Geovane Cayres Magalh?es, "A Performance Comparison among the Traditional R-trees, the Hilbert R-tree and the SR-tree," sccc, pp.3, XXIII International Conference of the Chilean Computer Science Society, 2003
Usage of this product signifies your acceptance of the Terms of Use.