Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/155

Processing and Optimization of Multiway Spatial Joins Using R-trees

Authors Papadias, Dimitris
Mamoulis, Nikos
Theodoridis, Yannis
Issue Date 1999
Source Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems , 1999, p. 44-55
Summary One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all object pairs satisfying some spatial predicate. A multiway join combines data originated from more than two relations. Although several techniques have been proposed for pairwise spatial joins, only limited work has focused on multiway spatial join processing. This paper solves multiway spatial joins by applying systematic search algorithms that exploit R-trees to efficiently guide search, without building temporary indexes or materializing intermediate results. In addition to general methodologies, we propose cost models and an optimization algorithm, and evaluate them through extensive experimentation.
Note Proceedings of the 1999 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '99; Philadelphia, PA, USA; ; 31 May 1999 through 2 June 1999; Code 55469
Subjects
Rights © ACM, 1999. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, PA, USA, 31 May-2 June, 1999, ACM Press, New York, USA, 1999, p. 44-55
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Scopus
Find@HKUST
Files in this item:
File Description Size Format
pods99.pdf 136385 B Adobe PDF