Efficient processing of spatial joins with DOT-based indexing

Hyun Back, Jung Im Won, Jee Hee Yoon, Sang Hyun Park, Sang Wook Kim

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A spatial join is a query that searches for a set of object pairs satisfying a given spatial relationship from a database. It is one of the most costly queries, and thus requires an efficient processing algorithm that fully exploits the features of the underlying spatial indexes. In our earlier work, we devised a fairly effective algorithm for processing spatial joins with double transformation (DOT) indexing, which is one of several spatial indexing schemes. However, the algorithm is restricted to only the one-dimensional cases. In this paper, we extend the algorithm for the two-dimensional cases, which are general in Geographic Information Systems (GIS) applications. We first extend DOT to two-dimensional original space. Next, we propose an efficient algorithm for processing range queries using extended DOT. This algorithm employs the quarter division technique and the tri-quarter division technique devised by analyzing the regularity of the space-filling curve used in DOT. This greatly reduces the number of space transformation operations. We then propose a novel spatial join algorithm based on this range query processing algorithm. In processing a spatial join, we determine the access order of disk pages so that we can minimize the number of disk accesses. We show the superiority of the proposed method by extensive experiments using data sets of various distributions and sizes. The experimental results reveal that the proposed method improves the performance of spatial join processing up to three times in comparison with the widely-used R-tree-based spatial join method.

Original languageEnglish
Pages (from-to)1292-1312
Number of pages21
JournalInformation Sciences
Volume180
Issue number8
DOIs
Publication statusPublished - 2010 Apr 15

Fingerprint

Indexing
Join
Processing
Range Query
Division
Spatial Index
Query
Space-filling Curves
R-tree
Geographic Information Systems
Query processing
Query Processing
Geographic information systems
Efficient Algorithms
Regularity
Minimise
Experimental Results
Experiment

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

Back, Hyun ; Won, Jung Im ; Yoon, Jee Hee ; Park, Sang Hyun ; Kim, Sang Wook. / Efficient processing of spatial joins with DOT-based indexing. In: Information Sciences. 2010 ; Vol. 180, No. 8. pp. 1292-1312.
@article{61cac2888c3647c09eb51fc77fdb7e96,
title = "Efficient processing of spatial joins with DOT-based indexing",
abstract = "A spatial join is a query that searches for a set of object pairs satisfying a given spatial relationship from a database. It is one of the most costly queries, and thus requires an efficient processing algorithm that fully exploits the features of the underlying spatial indexes. In our earlier work, we devised a fairly effective algorithm for processing spatial joins with double transformation (DOT) indexing, which is one of several spatial indexing schemes. However, the algorithm is restricted to only the one-dimensional cases. In this paper, we extend the algorithm for the two-dimensional cases, which are general in Geographic Information Systems (GIS) applications. We first extend DOT to two-dimensional original space. Next, we propose an efficient algorithm for processing range queries using extended DOT. This algorithm employs the quarter division technique and the tri-quarter division technique devised by analyzing the regularity of the space-filling curve used in DOT. This greatly reduces the number of space transformation operations. We then propose a novel spatial join algorithm based on this range query processing algorithm. In processing a spatial join, we determine the access order of disk pages so that we can minimize the number of disk accesses. We show the superiority of the proposed method by extensive experiments using data sets of various distributions and sizes. The experimental results reveal that the proposed method improves the performance of spatial join processing up to three times in comparison with the widely-used R-tree-based spatial join method.",
author = "Hyun Back and Won, {Jung Im} and Yoon, {Jee Hee} and Park, {Sang Hyun} and Kim, {Sang Wook}",
year = "2010",
month = "4",
day = "15",
doi = "10.1016/j.ins.2009.11.029",
language = "English",
volume = "180",
pages = "1292--1312",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "8",

}

Efficient processing of spatial joins with DOT-based indexing. / Back, Hyun; Won, Jung Im; Yoon, Jee Hee; Park, Sang Hyun; Kim, Sang Wook.

In: Information Sciences, Vol. 180, No. 8, 15.04.2010, p. 1292-1312.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient processing of spatial joins with DOT-based indexing

AU - Back, Hyun

AU - Won, Jung Im

AU - Yoon, Jee Hee

AU - Park, Sang Hyun

AU - Kim, Sang Wook

PY - 2010/4/15

Y1 - 2010/4/15

N2 - A spatial join is a query that searches for a set of object pairs satisfying a given spatial relationship from a database. It is one of the most costly queries, and thus requires an efficient processing algorithm that fully exploits the features of the underlying spatial indexes. In our earlier work, we devised a fairly effective algorithm for processing spatial joins with double transformation (DOT) indexing, which is one of several spatial indexing schemes. However, the algorithm is restricted to only the one-dimensional cases. In this paper, we extend the algorithm for the two-dimensional cases, which are general in Geographic Information Systems (GIS) applications. We first extend DOT to two-dimensional original space. Next, we propose an efficient algorithm for processing range queries using extended DOT. This algorithm employs the quarter division technique and the tri-quarter division technique devised by analyzing the regularity of the space-filling curve used in DOT. This greatly reduces the number of space transformation operations. We then propose a novel spatial join algorithm based on this range query processing algorithm. In processing a spatial join, we determine the access order of disk pages so that we can minimize the number of disk accesses. We show the superiority of the proposed method by extensive experiments using data sets of various distributions and sizes. The experimental results reveal that the proposed method improves the performance of spatial join processing up to three times in comparison with the widely-used R-tree-based spatial join method.

AB - A spatial join is a query that searches for a set of object pairs satisfying a given spatial relationship from a database. It is one of the most costly queries, and thus requires an efficient processing algorithm that fully exploits the features of the underlying spatial indexes. In our earlier work, we devised a fairly effective algorithm for processing spatial joins with double transformation (DOT) indexing, which is one of several spatial indexing schemes. However, the algorithm is restricted to only the one-dimensional cases. In this paper, we extend the algorithm for the two-dimensional cases, which are general in Geographic Information Systems (GIS) applications. We first extend DOT to two-dimensional original space. Next, we propose an efficient algorithm for processing range queries using extended DOT. This algorithm employs the quarter division technique and the tri-quarter division technique devised by analyzing the regularity of the space-filling curve used in DOT. This greatly reduces the number of space transformation operations. We then propose a novel spatial join algorithm based on this range query processing algorithm. In processing a spatial join, we determine the access order of disk pages so that we can minimize the number of disk accesses. We show the superiority of the proposed method by extensive experiments using data sets of various distributions and sizes. The experimental results reveal that the proposed method improves the performance of spatial join processing up to three times in comparison with the widely-used R-tree-based spatial join method.

UR - http://www.scopus.com/inward/record.url?scp=75149120648&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=75149120648&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2009.11.029

DO - 10.1016/j.ins.2009.11.029

M3 - Article

AN - SCOPUS:75149120648

VL - 180

SP - 1292

EP - 1312

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 8

ER -