Referenced Items are not available for this document.
The spatial join operations combine two sets of spatial data by their spatial relationships. They are among the most important, yet most time-consuming operations in spatial databases. We consider the problem of binary polygon intersection joins based on the filter-and-refine strategy. Our objective is to minimize the I/O cost and the response time for the refinement step. First, a graph model is proposed to formalize the refinement cost and matrix-based sequential data partition algorithms are introduced. Then a parallel data partitioning algorithm is developed with a detailed complexity analysis. Based on the data partition results, a distribution algorithm is also proposed for scheduling parallel spatial join processing
Published in:
Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on
Date of Conference: 10-12 Dec 1997
- Page(s):
- 703 - 716
- Meeting Date :
- 10 Dec 1997-12 Dec 1997
- Print ISBN:
- 0-7803-4229-1
- INSPEC Accession Number:
- 5842355
- Conference Location :
- Melbourne, Vic.
- Digital Object Identifier :
- 10.1109/ICAPP.1997.651536
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
