ADBIS 2003: Advances in Databases and Information Systems pp 323-338 | Cite as
Distance Join Queries of Multiple Inputs in Spatial Databases
Abstract
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “D distance -value” of this n-tuple is the value of a linear function of distances of the n objects that make up this n-tuple, according to the edges of the QG. This paper addresses the problem of finding the Kn-tuples between n spatial datasets that have the smallest D distance -values, the so-called K-Multi-Way Distance Join Query (K-MWDJQ), where each set is indexed by an R-tree-based structure. This query can be viewed as an extension of K-Closest-Pairs Query (K-CPQ) [4] for n inputs. In addition, a recursive non-incremental branch-and-bound algorithm following a Depth-First search for processing synchronously all inputs without producing any intermediate result is proposed. Enhanced pruning techniques are also applied to the n R-trees nodes in order to reduce the total response time of the query, and a global LRU buffer is used to reduce the number of disk accesses. Finally, an experimental study of the proposed algorithm using real spatial datasets is presented.
Keywords
Spatial databases Distance join queries R-trees Performance studyPreview
Unable to display preview. Download preview PDF.
References
- 1.Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: and Efficient and Robust Access Method for Points and Rectangles. In: Proc. ACM SIGMOD Conf., pp. 322–331 (1990)Google Scholar
- 2.Brinkhoff, T., Kriegel, H.P., Seeger, B.: Efficient Processing of Spatial Joins Using R-trees. In: Proc. ACM SIGMOD Conf., pp. 237–246 (1993)Google Scholar
- 3.Brown, P.: Object-Relational Database Development: A Plumber’s Guide. Prentice Hall, Englewood Cliffs (2001)Google Scholar
- 4.Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest Pair Queries in Spatial Databases. In: Proc. ACM SIGMOD Conf., pp. 189–200 (2000)Google Scholar
- 5.Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Algorithms for Processing K Closest Pair Queries in Spatial Databases. Technical Report, Department of Informatics, Aristotle University of Thessaloniki (Greece) (2001)Google Scholar
- 6.Digital Chart of the World: Real spatial datasets of the world at 1:1,000,000 scale (1997), http://www.maproom.psu.edu/dcw
- 7.Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proc. ACM SIGMOD Conf., pp. 47–57 (1984)Google Scholar
- 8.Hjaltason, G.R., Samet, H.: Incremental Distance Join Algorithms for Spatial Databases. In: Proc. ACM SIGMOD Conf., pp. 237–248 (1998)Google Scholar
- 9.Mamoulis, N., Papadias, D.: Integration of Spatial Join Algorithms for Processing Multiple Inputs. In: Proc. ACM SIGMOD Conf., pp. 1–12 (1999)Google Scholar
- 10.Mamoulis, N., Papadias, D.: Multiway Spatial Joins. ACM Transactions on Database Systems (TODS) 26(4), 424–475 (2001)MATHCrossRefGoogle Scholar
- 11.Manolopoulos, Y., Theodoridis, Y., Tsotras, V.: Advanced Database Indexing. Kluwer Academic Publishers, Dordrecht (1999)Google Scholar
- 12.Oracle Technology Network; Oracle Spatial, an Oracle Technical White Paper (2001), http://otn.oracle.com/products/oracle9i/pdf/OracleSpatial.pdf
- 13.Park, H.H., Cha, G.H., Chung, C.W.: Multi-way Spatial Joins Using RTrees: Methodology and Performance Evaluation. In: Proc. 6th Int. Symp. of Spatial Databases (SSD), pp. 229–250 (1999)Google Scholar
- 14.Papadias, D., Mamoulis, N., Theodoridis, Y.: Processing and Optimization of Multiway Spatial Joins Using R-Trees. In: Proc. ACM Symp. on Principles of Database Systems (PODS), pp. 44–55 (1999)Google Scholar
- 15.Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)Google Scholar
- 16.Shin, H., Moon, B., Lee, S.: Adaptive Multi-Stage Distance Join Processing. In: Proc. ACM SIGMOD Conf., pp. 343–354 (2000)Google Scholar