One-dimensional spatial join processing using a DOT-based index structure

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Spatial join is an operation that finds a set of object pairs with a given spatial relationship from a spatial database. It is very costly, and thus requires an efficient algorithm for its execution that fully exploits the features of underlying spatial indexes. In this paper, we propose a novel one-dimensonal spatial join algorithm based on DOT indexing. The proposed algorithm reduces the cost of disk accesses by deciding the access order of pages containing spatial objects to minimize the number of buffer replacements. It also minimizes the CPU cost by using a quarter division technique, which divides a query region into a set of subregions that contain consecutive space-filling curves as long as possible. Our algorithm is very easy to integrate with an existing DBMS because it uses B+-trees as a base structure for DOT indexing. We verify the effectiveness of the proposed algorithm via extensive experiments using data sets with various sizes and distributions. The results show that the proposed join algorithm performs up to 3 times better than the previous R -tree-based join algorithm.

Original languageEnglish
Pages (from-to)101-115
Number of pages15
JournalComputer Systems Science and Engineering
Volume28
Issue number2
Publication statusPublished - 2013 Mar 1

Fingerprint

Join
Processing
Indexing
Spatial Index
Space-filling Curves
B-tree
Minimise
R-tree
Spatial Database
Costs
Replacement
Divides
Buffer
Consecutive
Division
Efficient Algorithms
Program processors
Integrate
Query
Verify

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Won, Jung Lm ; Back, Hyun ; Yoon, Jee Hee ; Park, Sang Hyun ; Kim, Sang Wook. / One-dimensional spatial join processing using a DOT-based index structure. In: Computer Systems Science and Engineering. 2013 ; Vol. 28, No. 2. pp. 101-115.
@article{0adf064291c24c49a253c77513277623,
title = "One-dimensional spatial join processing using a DOT-based index structure",
abstract = "Spatial join is an operation that finds a set of object pairs with a given spatial relationship from a spatial database. It is very costly, and thus requires an efficient algorithm for its execution that fully exploits the features of underlying spatial indexes. In this paper, we propose a novel one-dimensonal spatial join algorithm based on DOT indexing. The proposed algorithm reduces the cost of disk accesses by deciding the access order of pages containing spatial objects to minimize the number of buffer replacements. It also minimizes the CPU cost by using a quarter division technique, which divides a query region into a set of subregions that contain consecutive space-filling curves as long as possible. Our algorithm is very easy to integrate with an existing DBMS because it uses B+-trees as a base structure for DOT indexing. We verify the effectiveness of the proposed algorithm via extensive experiments using data sets with various sizes and distributions. The results show that the proposed join algorithm performs up to 3 times better than the previous R -tree-based join algorithm.",
author = "Won, {Jung Lm} and Hyun Back and Yoon, {Jee Hee} and Park, {Sang Hyun} and Kim, {Sang Wook}",
year = "2013",
month = "3",
day = "1",
language = "English",
volume = "28",
pages = "101--115",
journal = "Computer Systems Science and Engineering",
issn = "0267-6192",
publisher = "CRL Publishing",
number = "2",

}

One-dimensional spatial join processing using a DOT-based index structure. / Won, Jung Lm; Back, Hyun; Yoon, Jee Hee; Park, Sang Hyun; Kim, Sang Wook.

In: Computer Systems Science and Engineering, Vol. 28, No. 2, 01.03.2013, p. 101-115.

Research output: Contribution to journalArticle

TY - JOUR

T1 - One-dimensional spatial join processing using a DOT-based index structure

AU - Won, Jung Lm

AU - Back, Hyun

AU - Yoon, Jee Hee

AU - Park, Sang Hyun

AU - Kim, Sang Wook

PY - 2013/3/1

Y1 - 2013/3/1

N2 - Spatial join is an operation that finds a set of object pairs with a given spatial relationship from a spatial database. It is very costly, and thus requires an efficient algorithm for its execution that fully exploits the features of underlying spatial indexes. In this paper, we propose a novel one-dimensonal spatial join algorithm based on DOT indexing. The proposed algorithm reduces the cost of disk accesses by deciding the access order of pages containing spatial objects to minimize the number of buffer replacements. It also minimizes the CPU cost by using a quarter division technique, which divides a query region into a set of subregions that contain consecutive space-filling curves as long as possible. Our algorithm is very easy to integrate with an existing DBMS because it uses B+-trees as a base structure for DOT indexing. We verify the effectiveness of the proposed algorithm via extensive experiments using data sets with various sizes and distributions. The results show that the proposed join algorithm performs up to 3 times better than the previous R -tree-based join algorithm.

AB - Spatial join is an operation that finds a set of object pairs with a given spatial relationship from a spatial database. It is very costly, and thus requires an efficient algorithm for its execution that fully exploits the features of underlying spatial indexes. In this paper, we propose a novel one-dimensonal spatial join algorithm based on DOT indexing. The proposed algorithm reduces the cost of disk accesses by deciding the access order of pages containing spatial objects to minimize the number of buffer replacements. It also minimizes the CPU cost by using a quarter division technique, which divides a query region into a set of subregions that contain consecutive space-filling curves as long as possible. Our algorithm is very easy to integrate with an existing DBMS because it uses B+-trees as a base structure for DOT indexing. We verify the effectiveness of the proposed algorithm via extensive experiments using data sets with various sizes and distributions. The results show that the proposed join algorithm performs up to 3 times better than the previous R -tree-based join algorithm.

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

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

M3 - Article

AN - SCOPUS:84879226859

VL - 28

SP - 101

EP - 115

JO - Computer Systems Science and Engineering

JF - Computer Systems Science and Engineering

SN - 0267-6192

IS - 2

ER -