One-dimensional spatial join processing using a DOT-based index structure
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Won, Jung-Im | - |
dc.contributor.author | Back, Hyun | - |
dc.contributor.author | Yoon, Jee-Hee | - |
dc.contributor.author | Park, Sanghyun | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.date.accessioned | 2022-07-16T10:58:25Z | - |
dc.date.available | 2022-07-16T10:58:25Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2013-03 | - |
dc.identifier.issn | 0267-6192 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/163249 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | C R L Publishing Ltd. | - |
dc.title | One-dimensional spatial join processing using a DOT-based index structure | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.scopusid | 2-s2.0-84879226859 | - |
dc.identifier.bibliographicCitation | Computer Systems Science and Engineering, v.28, no.2, pp.101 - 115 | - |
dc.relation.isPartOf | Computer Systems Science and Engineering | - |
dc.citation.title | Computer Systems Science and Engineering | - |
dc.citation.volume | 28 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 101 | - |
dc.citation.endPage | 115 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | DOT index | - |
dc.subject.keywordPlus | Space-filling curve | - |
dc.subject.keywordPlus | Spatial database | - |
dc.subject.keywordPlus | Spatial indexes | - |
dc.subject.keywordPlus | Spatial join | - |
dc.subject.keywordPlus | Decision trees | - |
dc.subject.keywordPlus | Forestry | - |
dc.subject.keywordPlus | Indexing (of information) | - |
dc.subject.keywordPlus | Trees (mathematics) | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordPlus | Data Bases | - |
dc.subject.keywordPlus | Decision Making | - |
dc.subject.keywordPlus | Forestry | - |
dc.subject.keywordPlus | Indexing | - |
dc.subject.keywordAuthor | DOT index | - |
dc.subject.keywordAuthor | Space-filling curve | - |
dc.subject.keywordAuthor | Spatial database | - |
dc.subject.keywordAuthor | Spatial index | - |
dc.subject.keywordAuthor | Spatial join | - |
dc.identifier.url | http://delab.yonsei.ac.kr/assets/files/publication/legacy/4-1455-2446-1-ED.pdf | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.