QR-tree: An efficient and scalable method for evaluation of continuous range queries
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jung, HaRim | - |
dc.contributor.author | Kim, Yong Sung | - |
dc.contributor.author | Chung, Yon Dohn | - |
dc.date.accessioned | 2021-09-05T06:14:54Z | - |
dc.date.available | 2021-09-05T06:14:54Z | - |
dc.date.created | 2021-06-15 | - |
dc.date.issued | 2014-08-01 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/97727 | - |
dc.description.abstract | In this paper, we explore the problem of the scalable evaluation of continuous range queries (CRQs) over moving objects, each of which continually retrieves the moving objects that are currently within a given query region of interest. Most existing methods assume that moving objects continually communicate with the server to report their current locations and the server continuously updates the results of queries. However, such an assumption degrades the system performance, because the communication cost is huge and the server workload is increased when the number of moving objects and queries is enormous. In this paper, we propose a novel query indexing structure, referred to as the Query Region tree (QR-tree), which allows the server to cooperate with moving objects efficiently by leveraging the available computational resources of the moving objects to improve the overall system performance. In addition, we present another version of the QR-tree, called the Bit-vector Query Region tree (BQR-tree), for the evaluation of CRQs that specify additional non-spatial selections. The BQR-tree stores a summary of the non-spatial information specified by CRQs in the form of bit-vectors. Through a series of comprehensive simulations, we verify the efficiency of the QR-tree and the BQR-tree in terms of the communication cost and server workload. (C) 2014 Elsevier Inc. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.subject | MONITORING QUERIES | - |
dc.title | QR-tree: An efficient and scalable method for evaluation of continuous range queries | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Yong Sung | - |
dc.contributor.affiliatedAuthor | Chung, Yon Dohn | - |
dc.identifier.doi | 10.1016/j.ins.2014.02.061 | - |
dc.identifier.scopusid | 2-s2.0-84899939524 | - |
dc.identifier.wosid | 000336706000010 | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.274, pp.156 - 176 | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 274 | - |
dc.citation.startPage | 156 | - |
dc.citation.endPage | 176 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | MONITORING QUERIES | - |
dc.subject.keywordAuthor | Continuous range query | - |
dc.subject.keywordAuthor | Moving object | - |
dc.subject.keywordAuthor | Index structure | - |
dc.subject.keywordAuthor | Query indexing | - |
dc.subject.keywordAuthor | Location-based service | - |
dc.subject.keywordAuthor | Mobile/ubiquitous computing | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
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.