Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62026
Title: Multi-guarded safe zone: An effective technique to monitor moving circular range queries
Contributor(s): Cheema, Muhammad Aamir (author); Brankovic, Ljiljana  (author)orcid ; Lin, Xuemin (author); Zhang, Wenjie (author); Wang, Wei (author)
Publication Date: 2010
DOI: 10.1109/ICDE.2010.5447864
Handle Link: https://hdl.handle.net/1959.11/62026
Abstract: 

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.

Publication Type: Conference Publication
Conference Details: ICDE 2010: 26th IEEE International Conference on Data Engineering (ICDE), Long Beach, CA, USA, 1st to 6th of March, 2010
Source of Publication: Proceedings - International Conference on Data Engineering, p. 189-200
Publisher: IEEE
Place of Publication: United States of America
Fields of Research (FoR) 2020: 460501 Data engineering and data science
461305 Data structures and algorithms
Socio-Economic Objective (SEO) 2020: 220499 Information systems, technologies and services not elsewhere classified
Peer Reviewed: Yes
HERDC Category Description: E1 Refereed Scholarly Conference Publication
Appears in Collections:Conference Publication
School of Science and Technology

Files in This Item:
1 files
File SizeFormat 
Show full item record

SCOPUSTM   
Citations

52
checked on Dec 14, 2024
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.