A buffer model for evaluating R-tree performance
Pages 264 - 265
Abstract
No abstract available.
References
[1]
N. Beckmann, H.P. Kriegel, R. Schneider, B. Seeger, "The //*-tree: an Efficient and robust Access Method for Points and Rectangles", Proc. ACM SIGMOD, p. 323-331, 1990.
[2]
A. Bhide, A. Dan, D. Dias, "A Simple Analysis of LRU Buffer Replacemtn Policy and its Relationship to Buffer Warm-up Transient", Proc. IEEE Data Eng., 1993.
[3]
A. Guttman, "R-trees: a Dynamic Index Structure fo Spatial Searching", Proc. ACM SIGMOD, p. 47-57, 1984.
[4]
I. Kamel, C. Faloutsos, "On Packing R-trees", Proc. 2nd International Conf. on Information and Knowled Management (CKIM-93), p. 490-499, Arlington, VA, November 1993.
[5]
I. Kamel, C. Faloutsos, "Hilbert R-tree: An improved R- tree Using Fractals", Proc. International Conf. on Very Large Databases 1995 (VLDB-95).
[6]
S.T. Leutenegger, J. Edgington, M.A. Lopez, "Efficient Bulk Loading of R-trees", University of Denver Computer Science Technical Report #95.1. To be submitted for publication.
[7]
S.T. Leutenegger, M.A. Lopez, "A Modeling Study of R-tree Packing Algorithms", University of Denver Computer Science Technical Report #95.2. To be submitted for publication.
[8]
N. Roussopoulos, D. Leifker, "Direct Spatial Search on Pictorial Databases Using Packed R-trees", Proc. ACM SIGMOD, 1985.
[9]
T. Sellis, N. Roussopoulos, C. Faloutsos, "The R+ Tree: A Dynamic Index for Multidimensional Objects", Proc. 13th International Conference on Very Large Databases (VLDB-87), p. 507-518, September 1987.
Index Terms
- A buffer model for evaluating R-tree performance
Recommendations
An accurate performance model of shared buffer ATM switches under hot spot traffic
Asynchronous transfer mode (ATM) switches based on shared buffering are known to have better performance and buffer utilization than input or output queued switches. Shared buffer switches do not suffer from head of line blocking which is a problem in ...
The LBF R-tree: Efficient Multidimensional Indexing with Graceful Degradation
IDEAS '07: Proceedings of the 11th International Database Engineering and Applications SymposiumIn 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
May 1996
273 pages
May 1996279 pages
Copyright © 1996 ACM.
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: 15 May 1996
Published in SIGMETRICS Volume 24, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 347Total Downloads
- Downloads (Last 12 months)34
- Downloads (Last 6 weeks)7
Reflects downloads up to 10 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in