article

Free access

The R*-tree: an efficient and robust access method for points and rectangles

Authors:

Norbert Beckmann,

Hans-Peter Kriegel,

Ralf Schneider,

Bernhard SeegerAuthors Info & Claims

ACM SIGMOD Record, Volume 19, Issue 2

Pages 322 - 331

https://doi.org/10.1145/93605.98741

Published: 01 May 1990 Publication History

PDF eReader

Abstract

The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the R^*-tree which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory. Using our standardized testbed in an exhaustive performance comparison, it turned out that the R^*-tree clearly outperforms the existing R-tree variants. Guttman's linear and quadratic R-tree and Greene's variant of the R-tree. This superiority of the R^*-tree holds for different types of queries and operations, such as map overlay, for both rectangles and multidimensional points in all experiments. From a practical point of view the R^*-tree is very attractive because of the following two reasons 1 it efficiently supports point and spatial data at the same time and 2 its implementation cost is only slightly higher than that of other R-trees.

References

[1]

D Greene 'An implementation and Performance Analysis of Spatial Data Access Methods', Proc 5th I n t Conf on Data Engineering, 606-615, 1989

Digital Library

Google Scholar

[2]

A Guttman 'R-trees a dynamic index structure for spatial searching', Proc ACM SIGMOD Int Conf on Management of Data, 47-57, 1984

Digital Library

Google Scholar

[3]

K Hlnrlchs 'The grid file system ~mplementatlon and case studies for appl~catxons', D~ssertat~on No 7734, Eldgen6sslsche Technlsche Hochschule (ETH), Zuench, 1985

Google Scholar

[4]

D Knuth 'The art of computer programming', Vol 3 sorting and searclung, Addison-Wesley Publ C o, Reading, Mass, 1973

Digital Library

Google Scholar

[5]

H P Krlegel, M Schlwletz, R Schneider, B Seeger 'Performance comparison of point and spatlal access methods', Proc Syrup on the Design and Implementation of Large Spatial Databases', Santa Barbara, 1989, Lecture Notes m Computer Science

Digital Library

Google Scholar

[6]

J Nlevergelt, H Hmterberger, K C Sevcd< 'The grid file an adaptable, symmetric mult~ey file structure', ACM Trans on Database Systems, Vol 9, 1, 38- 71, 1984

Digital Library

Google Scholar

[7]

N Roussopoulos, D Lelfker 'Direct spatial search on plctonal databases using packed R-trees', Proc ACM SIGMOD Int Conf on Managment of Data, 17-31, 1985

Digital Library

Google Scholar

[8]

B Seeger, H P Krlegel 'Design and implementation of spatial access methods', Proc 14th Int Conf on Very Large Databases, 360-371, 1988

Digital Library

Google Scholar

[9]

B Seeger, HP Krlegel 'The design and implementation of the buddy tree', Computer Science Techmcal Report 3/90, Umverslty of Bremen, submitted for pubhcatlon, 1990

Google Scholar

Cited By

View all

Maddipatla SPakala RHaeri HChen CJerath KBrennan S(2024) Using Databases to Implement Algorithms: Estimation of Allan Variance Using B + -tree Data Structure 2024 American Control Conference (ACC)10.23919/ACC60939.2024.10644386(2164-2169)Online publication date: 10-Jul-2024
https://doi.org/10.23919/ACC60939.2024.10644386
Xu WLin JHe DZhang F(2024)FAST-LIO2: Fast Direct LiDAR-Inertial OdometrySSRN Electronic Journal10.2139/ssrn.4675561Online publication date: 2024
https://doi.org/10.2139/ssrn.4675561
Dong BWu KByna S(2024)The Art of Sparsity: Mastering High-Dimensional Tensor Storage2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00094(439-446)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00094
Show More Cited By

Index Terms

The R*-tree: an efficient and robust access method for points and rectangles

Recommendations

The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data

The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, ...
Temporally enhanced network-constrained (TENC) R-tree
MobiGIS '16: Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems

This paper describes a new Network-constrained Moving objects indexing structure, which extends the state-of-the-art for this kind of data. The indexing structure we propose is called Temporally Enhanced Network-Constrained R-tree (TENC R-tree), which ...
Matching colored points with rectangles

Let S be a point set in the plane such that each of its elements is colored either red or blue. A matching of S with rectangles is any set of pairwise-disjoint axis-aligned closed rectangles such that each rectangle contains exactly two points of S. ...

Comments

Information & Contributors

Information

Published In

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. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1990

Published in SIGMOD Volume 19, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3,478
Total Citations
View Citations
12,125
Total Downloads

Downloads (Last 12 months)1,069
Downloads (Last 6 weeks)111

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Maddipatla SPakala RHaeri HChen CJerath KBrennan S(2024) Using Databases to Implement Algorithms: Estimation of Allan Variance Using B + -tree Data Structure 2024 American Control Conference (ACC)10.23919/ACC60939.2024.10644386(2164-2169)Online publication date: 10-Jul-2024
https://doi.org/10.23919/ACC60939.2024.10644386
Xu WLin JHe DZhang F(2024)FAST-LIO2: Fast Direct LiDAR-Inertial OdometrySSRN Electronic Journal10.2139/ssrn.4675561Online publication date: 2024
https://doi.org/10.2139/ssrn.4675561
Dong BWu KByna S(2024)The Art of Sparsity: Mastering High-Dimensional Tensor Storage2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00094(439-446)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00094
Bian ZYan XZhang JYiu MTang B(2024)QSRP: Efficient Reverse $k-\text{Ranks}$ Query Processing on High-Dimensional Embeddings2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00351(4614-4627)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00351
Zhu YChen LGao YMa RZheng BZhao J(2024)HJG: An Effective Hierarchical Joint Graph for ANNS in Multi-Metric Spaces2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00326(4275-4287)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00326
Zhang LEltabakh MRundensteiner EAlnuaim K(2024)CLIMBER: Pivot-Based Approximate Similarity Search Over Big Data Series2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00301(3933-3946)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00301
Zong CDong ZYang XWang BZhu HQiu TZhu R(2024)Exploring Optimal Parameters for Expected Results on Radius-Bounded k-Core Queries2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00183(2312-2324)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00183
Zhou HYang LXiao YHe YHu JQian W(2024)SAM: A Spatial-Aware Learned Index for Disk-Based Multi-dimensional SearchWeb and Big Data10.1007/978-981-97-7241-4_1(3-18)Online publication date: 28-Aug-2024
https://doi.org/10.1007/978-981-97-7241-4_1
Alrashid HLiu YMagdy A(2023)PAGE: Parallel Scalable Regionalization FrameworkACM Transactions on Spatial Algorithms and Systems10.1145/3611011Online publication date: 28-Jul-2023
https://doi.org/10.1145/3611011
Wu SChen LHuang PChang YHo CShih W(2023)WARM-tree: Making Quadtrees Write-efficient and Space-economic on Persistent MemoriesACM Transactions on Embedded Computing Systems10.1145/360803322:5s(1-26)Online publication date: 31-Oct-2023
https://dl.acm.org/doi/10.1145/3608033
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations