Spatial Joins: Algorithms, Cost Models and Optimization Techniques

Spatial Joins: Algorithms, Cost Models and Optimization Techniques

Nikos Mamoulis (University of Hong Kong, Hong Kong), Yannis Theodoridis (University of Piraeus, Greece) and Dimitris Papadias (Hong Kong University of Science and Technology, Hong Kong)
Copyright: © 2005 |Pages: 31
DOI: 10.4018/978-1-59140-387-6.ch007
OnDemand PDF Download:
No Current Special Offers


This chapter describes algorithms, cost models and optimization techniques for spatial joins. Joins are among the most common queries in Spatial Database Management Systems. Due to their importance and high processing cost, a number of algorithms have been proposed covering all possible cases of indexed and non-indexed inputs. We first describe some popular methods for processing binary spatial joins and provide models for selectivity and cost estimation. Then, we discuss evaluation of multiway spatial joins by integrating binary algorithms and synchronous tree traversal. Going one step further, we show how analytical models can be used to combine the various join operators in optimal evaluation plans. The chapter can serve as a comprehensive reference text to the researcher who wants to learn about this important spatial query operator and to the developer who wants to include spatial query processing modules in a Database System.

Complete Chapter List

Search this Book: