Article

Free access

A model for the prediction of R-tree performance

Authors:

Yannis Theodoridis,

Timos SellisAuthors Info & Claims

PODS '96: Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 161 - 171

https://doi.org/10.1145/237661.237705

Published: 03 June 1996 Publication History

PDF eReader

References

[1]

N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, "The R*-tree: an efficient and robust access method for points and rectangles", In Proceedings of ACM SIGMOD Conference on Management of Data, May 1990.

Digital Library

Google Scholar

[2]

D. Comer, "The Ubiquitous B-Tree", ACM Computing Surveys, vol. 11 (2), pp. 121-137, June 1979.

Digital Library

Google Scholar

[3]

C. Faloutsos, I. KameI, "Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension", In Proceedings of the 13th A CM Symposium on Principles of Database Systems (PODS), May 1994.

Digital Library

Google Scholar

[4]

M. Frecston, "The BANG file: a new kind of grid file", In Proceedings of A CM SIGMOD Conference on Management of Data, May 1987.

Digital Library

Google Scholar

[5]

C. Faloutsos, T. Sellis, N. Roussopoulos, "Analysis of Object Oriented Spatial Access Methods", In Proceedings of A CM SIGMOD Conference on Management of Data, May 1987.

Digital Library

Google Scholar

[6]

A. Guttman, "R-trees: a dynamic index structure for spatial searching", In Proceedings of A CM SIGMOD Conference on Management of Data, June 1984.

Digital Library

Google Scholar

[7]

R.H. Guting, "An Introduction to Spatial Database Systems", VLDB Journal, vol.3(4), pp. 357-399, October 1994.

Digital Library

Google Scholar

[8]

A. Henrich, H.-W. Six, P. Widmayer, "The LSD tree: spatial access to multidimensional point and non point objects", In Proceedings of the 15th international Conference on Very Large Data Bases (VLDB), August 1989.

Digital Library

Google Scholar

[9]

I. Kamel, C. Faloutsos, "On Packing R-trees", In Proceedings of the 2nd International Conference on bzformation and Knowledge Management (CIKM), November 1993.

Digital Library

Google Scholar

[10]

I. Kamel, C. Faloutsos, "Hilbert R-tree: An Improved R-tree Using Fractals", In Proceedings of the 20th International Conference on Very. Large Data Bases (VLDB), September 1994.

Digital Library

Google Scholar

[11]

D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching, Addison- Wesley, Reading, MA, 1973.

Digital Library

Google Scholar

[12]

D. Knuth, The Art of Computer Programming, vol.2, Addison Wesley, 1981.

Digital Library

Google Scholar

[13]

J. Nievergelt, H. Hinterberger, K.C. Sevcik, "The Grid File: An Adaptable, Symmetric Multikey file Structure", A CM Transactions on Database Systems, vol.9(1), pp. 38-71, March 1984.

Digital Library

Google Scholar

[14]

B.-U. Pagel, H.-W. Six, H. Toben, P. Widmayer, "Towards an Analysis of Range Query performance", in Proceedings of the 12th ACM Symposium on Principles of Database Systems (PODS), May 1993.

Digital Library

Google Scholar

[15]

B.-U. Pagel, H.-W. Six, M. Winter, "Window Query-Optimal Clustering of Spatial Objects", In Proceedings of the 14th A CM Symposium on Principles of Database Systems (PODS), May 1995.

Digital Library

Google Scholar

[16]

D. Papadias, Y. Theodoridis, T. Sellis, M.J. Egenhofer, "Topological Relations in the World of Minimum Bounding Rectangles: a Study with R-trees", in Proceedings of A CM SIGMOD Conference on Management of Data, May 1995.

Digital Library

Google Scholar

[17]

N. Roussopoulos, S. Kelley, F. Vincent, "Nearest Neighbor Queries", In Proceedings of A CM SIGMOD Conference on Management of Data, May 1995.

Digital Library

Google Scholar

[18]

N. Roussopoulos, D. Leifker, "Direct Spatial Search on Pictorial Databases Using Packed R-trees", In Proceedings of A CM SIGMOD Conference on Management of Data, May 1985.

Digital Library

Google Scholar

[19]

T. Sellis, N. Roussopoulos, C. Faloutsos, "The R+-tree: a dynamic index for multidimensional objects", In Proceedings of the 13th International Conference on Very Large Data Bases (VLDB), September 1987.

Digital Library

Google Scholar

[20]

Y. Theodoridis, T. Sellis, "Optimization Issues in R-tree Construction", In Proceedings of International Workshop on Geographic Information Systems (IGIS), March 1994.

Digital Library

Google Scholar

[21]

Y. Theodoridis, D. Papadias, "Range Queries Involving Spatial Relations: A Performance Analysis", In Proceedings of the 2nd International Conference on Spatial hzformation Theory (COSIT), September 1995.

Google Scholar

[22]

Y. Theodoridis, M. Vazirgiannis, T. Sellis, "Spatio-Temporal Indexing for Large Multimedia Applications", In Proceedings of the 3rd IEEE Conference on Multimedia Computing and Systems (ICMCS), June 1996.

Digital Library

Google Scholar

[23]

J.S. Vitter, "Faster Methods for Random Sampling", Communications of the A CM, vol. 27(7), pp. 703-718, July 1984.

Digital Library

Google Scholar

[24]

J.S. Vitter, "Random Sampling with Reservoir", A CM Transactions on Mathematical Software, vol. 11, pp. 37-57, March 1985.

Digital Library

Google Scholar

Cited By

View all

Cernuda JLogan LGainaru AKlasky SLofstead JKougkas ASun X(2024)Hades: A Context-Aware Active Storage Framework for Accelerating Large-Scale Data Analysis2024 IEEE 24th International Symposium on Cluster, Cloud and Internet Computing (CCGrid)10.1109/CCGrid59990.2024.00070(577-586)Online publication date: 6-May-2024
https://doi.org/10.1109/CCGrid59990.2024.00070
Vu TEldawy AHristidis VTsotras V(2022)Incremental partitioning for efficient spatial data analyticsProceedings of the VLDB Endowment10.14778/3494124.349415015:3(713-726)Online publication date: 4-Feb-2022
https://dl.acm.org/doi/10.14778/3494124.3494150
Bavi KLian X(2022)Range-constrained probabilistic mutual furthest neighbor queries in uncertain databasesKnowledge and Information Systems10.1007/s10115-022-01807-065:6(2375-2402)Online publication date: 24-Dec-2022
https://dl.acm.org/doi/10.1007/s10115-022-01807-0
Show More Cited By

Recommendations

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 ...
Performance of R-Tree with Slim-Down and Reinsertion Algorithm
ICSAP '10: Proceedings of the 2010 International Conference on Signal Acquisition and Processing

With the development of information technology, the amount of the multimedia data become more and more. The growth of these data brings the need for more effective methods in retrieval. The multimedia retrieval systems always index these data on the ...
The LBF R-tree: Efficient Multidimensional Indexing with Graceful Degradation
IDEAS '07: Proceedings of the 11th International Database Engineering and Applications Symposium

In multi-dimensional database environments, we typically require effective indexing mechanisms for all but the smallest data sets. While numerous such methods have been proposed, the R-tree has emerged as one of the most common and reliable indexing ...

Comments

Information & Contributors

Information

Published In

PODS '96: Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

June 1996

249 pages

ISBN:0897917812

DOI:10.1145/237661

Chairman:
Richard Hull
Univ. of Colorado

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: 03 June 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS96

Sponsor:

SIGMOD/PODS96: Joint ACM SIGMOD International Conference on Management of Data and ACM Symposium on Principles of Database Systems

June 4 - 6, 1996

Quebec, Montreal, Canada

Acceptance Rates

PODS '96 Paper Acceptance Rate 22 of 84 submissions, 26%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

185
Total Citations
View Citations
1,459
Total Downloads

Downloads (Last 12 months)181
Downloads (Last 6 weeks)29

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cernuda JLogan LGainaru AKlasky SLofstead JKougkas ASun X(2024)Hades: A Context-Aware Active Storage Framework for Accelerating Large-Scale Data Analysis2024 IEEE 24th International Symposium on Cluster, Cloud and Internet Computing (CCGrid)10.1109/CCGrid59990.2024.00070(577-586)Online publication date: 6-May-2024
Vu TEldawy AHristidis VTsotras V(2022)Incremental partitioning for efficient spatial data analyticsProceedings of the VLDB Endowment10.14778/3494124.349415015:3(713-726)Online publication date: 4-Feb-2022
Bavi KLian X(2022)Range-constrained probabilistic mutual furthest neighbor queries in uncertain databasesKnowledge and Information Systems10.1007/s10115-022-01807-065:6(2375-2402)Online publication date: 24-Dec-2022
Yang JCao SXiangli PLi XZhang X(2022)Multi-dimensional Data Quick Query for Blockchain-Based Federated LearningWireless Algorithms, Systems, and Applications10.1007/978-3-031-19211-1_43(529-540)Online publication date: 24-Nov-2022
Mamoulis N(2022)Spatial Data ManagementundefinedOnline publication date: 2-Mar-2022
Yue SWang PDi BSong L(2021)Load-balanced Task Allocation for Covid-19 Close Contact Detection in Heterogeneous MEC Networks2021 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOBECOM46510.2021.9685368(1-6)Online publication date: Dec-2021
Jayaraman UGupta P(2021)Efficient similarity search on multidimensional space of biometric databasesNeurocomputing10.1016/j.neucom.2020.08.084452(623-652)Online publication date: Sep-2021
Khader MAl-Naymat G(2020)Density-based Algorithms for Big Data Clustering Using MapReduce FrameworkACM Computing Surveys10.1145/340395153:5(1-38)Online publication date: 28-Sep-2020
Lai CWang TLiu CWang L(2019)Probabilistic Top-${k}$ Dominating Query Monitoring Over Multiple Uncertain IoT Data Streams in Edge Computing EnvironmentsIEEE Internet of Things Journal10.1109/JIOT.2019.29209086:5(8563-8576)Online publication date: Oct-2019
Tzouramanis TTiakas EPapadopoulos AManolopoulos YCuzzocrea AAllan JPaton NSrivastava DAgrawal RBroder AZaki MCandan SLabrinidis ASchuster AWang H(2018)The Range Skyline QueryProceedings of the 27th ACM International Conference on Information and Knowledge Management10.1145/3269206.3271693(47-56)Online publication date: 17-Oct-2018
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.

Cited By

Index Terms

Recommendations

Temporally enhanced network-constrained (TENC) R-tree

Performance of R-Tree with Slim-Down and Reinsertion Algorithm

The LBF R-tree: Efficient Multidimensional Indexing with Graceful Degradation