Optimizing Join Index Based Spatial-Join Processing: A Graph Partitioning Approach
نویسندگان
چکیده
A Join Index is a data structure that optimizes the join query processing in spatial databases. Join indices use pre-computation techniques to speed up online query processing and are useful for applications which require low update rates. The cost of spatial join computation using a join-index with limited buuer space depends primarily on the page access sequence used to fetch the pages of the base relations. Given the join-index, we introduce a suite of methods based on spatial-clustering to compute the spatial-join. The spatial clustering we employ is based on graph partitioning techniques. For all the methods we derive upper-bounds on the lengths of the page-access sequence. Experimental results with Sequoia 2000 data sets, on a sequential system, show that spatial clustering method outperforms the existing methods based on sorting and online clustering heuristics.
منابع مشابه
Optimizing Multi-Way Spatial Joins of Web Feature Services
Web Feature Service (WFS) is a widely used spatial web service standard issued by the Open Geospatial Consortium (OGC). In a heterogeneous GIS application, a user can issue a query that relates two or more spatial datasets at different WFS servers. Multi-way spatial joins of WFSs are very expensive in terms of computation and transmission because of the time-consuming interactions between the s...
متن کاملPlug&Join: An easy-to-use Generic Algorithm for Efficiently Processing Equi and Non-Equi Joins
This paper presents Plug&Join, a new generic algorithm for efficiently processing a broad class of different types of joins in an extensible database system. Plug&Join is not only designed to support equi joins, temporal joins, spatial joins, subset joins and other types of joins, but in contrast to previous algorithms it can be easily customized and it allows efficient processing of new types ...
متن کاملThe Bulk Index Join: A Generic Approach to Processing Non-Equijoins
Efficient join algorithms have been developed for processing different types of non-equijoins like spatial join, band join, temporal join or similarity join. Each of these previously proposed join algorithms is tailor-cut for a specific type of join, and a generalization of these algorithms to other join types is not obvious. We present an efficient algorithm called bulk index join that can be ...
متن کاملA Unified Approach for Indexed and Non-Indexed Spatial Joins
Most spatial join algorithms either assume the existence of a spatial index structure that is traversed during the join process,or solve the problem by sorting, partitioning, or on-the-fly index construction. In this paper, we develop a simple plane-sweeping algorithm that unifies the index-based and non-index based approaches. This algorithm processes indexed as well as non-indexed inputs, ext...
متن کاملGraph Partition Based Muti-Way Spatial Joins
In this paper, we investigate the problem of efficiently computing a multi-way spatial join without spatial indexes. We propose a novel and effective filtering algorithm based on a two phase partitioning technique. To avoid missing hits due to an inherent difficulty in multi-way spatial joins, we propose to firstly partition a join graph into sub-graphs whenever necessary. In the second phase, ...
متن کامل