Document Type

Conference Proceeding


IEEE Computer Society Press


Faculty of Computing, Health and Science


School of Computer and Information Science




This is an Author's Accepted Manuscript of: Xiao, J. (2006). Clustering Spatial Data for Join Operations Using Match-based Partition. Proceedings of International Conference on Computational Intelligence for Modelling, Control and Automation. (pp. 471-476). Vienna, Austria. IEEE Computer Society Press. Available here

© 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.


The spatial join is an operation that combines two sets of spatial data by their spatial relationships. The cost of spatial join could be very high due to the large sizes of spatial objects and the computation-intensive spatial operations. In spatial join processing, a common method to minimize the I/O cost is to partition the spatial objects into clusters and then schedule the processing of the clusters such that the number of times the same objects to be fetched into memory can be minimized. In this paper, we propose a match-based approach to partition a large spatial data set into clusters, which is computed based on the maximal match on the spatial join graph. Simulations have been conducted and the results have shown that, when comparing to existing approaches, our new method can significantly reduce the number of clusters produced in spatial join processing



Access Rights




Link to publisher version (DOI)