Abstract
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for processing. Initially, we consider grouping of pairs of requests only, and give two algorithms with exponential and linear complexity. Then, we generalize the linear method, grouping more than two requests per group. We evaluate these methods under different LRU buffer sizes, measuring the cache misses per query. We present experimental results based on real and synthetic data. The results show that careful query scheduling can improve substantially the overall performance of multiple range query processing.
Work supported by the European Union’s TMR program (“Chorochronos” project, contract number ERBFMRX-CT96-0056), and the national PENED program.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W. Aref: “Query processing and optimization in spatial databases”, Technical Report CS-TR-3097, Department of Computer Science, University of Maryland at College Park, MD, 1993.
V. Gaede and O. Guenther: “Multidimensional access methods”, ACM Computer Surveys, to appear. Address for downloading: http://www.wiwi.huberlin.de/gaede/survey.rev.ps.Z.
J. Gray and A. Rueter: Transaction processing — concepts and techniques, Morgan Kaufmann, San Francisco, CA, 1993.
R.H. Gutting: “An introduction to spatial database systems”, The VLDB Journal, vol.3, no.4, pp.357–399, 1994.
A. Guttman: “R-trees: a dynamic index structure for spatial searching”, Proceedings of the 1984 ACM SIGMOD Conference, pp.47–57, Boston, MA, 1984.
H. V. Jagadish: “Linear clustering of objects with multiple attributes”, Proceedings of the 1990 ACM SIGMOD Conference, pp.332–342, Atlantic City, NJ, 1990.
I. Kamel and C. Faloutsos: “On packing R-trees”, Proceedings of the 2nd Conference on Information and Knowledge Management (CIKM), Washington DC, 1993.
R. Laurini and D. Thompson: “Fundamentals of spatial information systems”, Academic Press, London, 1992.
V. Ng and T. Kameda: “Concurrent accesses to R-trees”, Proceedings of 3rd International Symposium on Large Spatial Databases (SSD ’93), pp.142–161, Singapore, 1993.
J. Orenstein: “Spatial query processing in an object-oriented database system”, Proceedings of the 1986 ACM SIGMOD Conference, pp.326–336, Washington DC, 1986.
B.U. Pagel, H.W. Six, H. Toben and P. Widmayer: “Towards an analysis of range query performance in spatial data structures”, Proceedings of the 1993 ACM PODS Conference, pp.214–221, Washington DC, 1993.
F.P. Preparata and M.I. Shamos: Computational geometry: an introduction, Springer-Verlag, New York, 1985.
H. Samet: The design and analysis of spatial data structures, Addison-Wesley, Reading, MA, 1990.
T. Sellis: “Multiple query optimization”, ACM Transactions on Database Systems, vol.13, no.1, pp.23–52, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Papadopoulos, A.N., Manolopoulos, Y. (1998). Multiple range query optimization in spatial databases. In: Litwin, W., Morzy, T., Vossen, G. (eds) Advances in Databases and Information Systems. ADBIS 1998. Lecture Notes in Computer Science, vol 1475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057718
Download citation
DOI: https://doi.org/10.1007/BFb0057718
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64924-3
Online ISBN: 978-3-540-68309-4
eBook Packages: Springer Book Archive