Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/62026
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheema, Muhammad Aamir | en |
dc.contributor.author | Brankovic, Ljiljana | en |
dc.contributor.author | Lin, Xuemin | en |
dc.contributor.author | Zhang, Wenjie | en |
dc.contributor.author | Wang, Wei | en |
dc.date.accessioned | 2024-08-08T03:00:42Z | - |
dc.date.available | 2024-08-08T03:00:42Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Proceedings - International Conference on Data Engineering, p. 189-200 | en |
dc.identifier.uri | https://hdl.handle.net/1959.11/62026 | - |
dc.description.abstract | <p>Given a positive value r, a circular range query returns the objects that lie within the distance r of the query location. In this paper, we study the circular range queries that continuously change their locations. We present an efficient and effective technique to monitor such moving range queries by utilising the concept of a safe zone. The safe zone of a query is the area with a property that while the query remains inside it, the results of the query remain unchanged. Hence, the query does not need to be re-evaluated unless it leaves the safe zone. The shape of the safe zone is defined by the so-called guard objects. The cost of checking whether a query lies in the safe zone takes k distance computations, where k is the number of the guard objects. Our contributions are as follows. 1) We propose a technique based on powerful pruning rules and a unique access order which efficiently computes the safe zone and minimizes the I/O cost. 2) To show the effectiveness of the safe zone, we theoretically evaluate the probability that a query leaves the safe zone within one time unit and the expected distance a query moves before it leaves the safe zone. Additionally, for the queries that have diameter of the safe zone less than its expected value multiplied by a constant, we also give an upper bound on the expected number of guard objects. This upper bound turns out to be a constant, that is, it does not depend either on the radius r of the query or the density of the objects. The theoretical analysis is verified by extensive experiments. 3) Our thorough experimental study demonstrates that our proposed approach is close to optimal and is an order of magnitude faster than a nai¿ve algorithm.</p> | en |
dc.language | en | en |
dc.publisher | IEEE | en |
dc.relation.ispartof | Proceedings - International Conference on Data Engineering | en |
dc.title | Multi-guarded safe zone: An effective technique to monitor moving circular range queries | en |
dc.type | Conference Publication | en |
dc.relation.conference | ICDE 2010: 26th IEEE International Conference on Data Engineering (ICDE) | en |
dc.identifier.doi | 10.1109/ICDE.2010.5447864 | en |
local.contributor.firstname | Muhammad Aamir | en |
local.contributor.firstname | Ljiljana | en |
local.contributor.firstname | Xuemin | en |
local.contributor.firstname | Wenjie | en |
local.contributor.firstname | Wei | en |
local.profile.school | School of Science and Technology | en |
local.profile.email | lbrankov@une.edu.au | en |
local.output.category | E1 | en |
local.record.place | au | en |
local.record.institution | University of New England | en |
local.date.conference | 1st to 6th of March, 2010 | en |
local.conference.place | Long Beach, CA, USA | en |
local.publisher.place | United States of America | en |
local.format.startpage | 189 | en |
local.format.endpage | 200 | en |
local.peerreviewed | Yes | en |
local.title.subtitle | An effective technique to monitor moving circular range queries | en |
local.contributor.lastname | Cheema | en |
local.contributor.lastname | Brankovic | en |
local.contributor.lastname | Lin | en |
local.contributor.lastname | Zhang | en |
local.contributor.lastname | Wang | en |
dc.identifier.staff | une-id:lbrankov | en |
local.profile.orcid | 0000-0002-5056-4627 | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.identifier.unepublicationid | une:1959.11/62026 | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
local.title.maintitle | Multi-guarded safe zone | en |
local.output.categorydescription | E1 Refereed Scholarly Conference Publication | en |
local.conference.details | ICDE 2010: 26th IEEE International Conference on Data Engineering (ICDE), Long Beach, CA, USA, 1st to 6th of March, 2010 | en |
local.search.author | Cheema, Muhammad Aamir | en |
local.search.author | Brankovic, Ljiljana | en |
local.search.author | Lin, Xuemin | en |
local.search.author | Zhang, Wenjie | en |
local.search.author | Wang, Wei | en |
local.uneassociation | No | en |
local.atsiresearch | No | en |
local.sensitive.cultural | No | en |
local.year.published | 2010 | en |
local.subject.for2020 | 460501 Data engineering and data science | en |
local.subject.for2020 | 461305 Data structures and algorithms | en |
local.subject.seo2020 | 220499 Information systems, technologies and services not elsewhere classified | en |
local.profile.affiliationtype | External Affiliation | en |
local.profile.affiliationtype | External Affiliation | en |
local.profile.affiliationtype | External Affiliation | en |
local.profile.affiliationtype | External Affiliation | en |
local.profile.affiliationtype | External Affiliation | en |
Appears in Collections: | Conference Publication School of Science and Technology |
Files in This Item:
File | Size | Format |
---|
SCOPUSTM
Citations
52
checked on Dec 14, 2024
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.