Distributed processing of continuous range queries over moving objects

by   Hui Zhu, et al.

Monitoring range queries over moving objects is essential to extensive location-based services. The challenge faced with these location-based services is having to process numerous concurrent range queries over a large volume of moving objects. However, the existing range query processing algorithms are almost centralized based on one single machine, which are hard to address the challenge due to the limited memory and computing resources. To address this issue, we propose a distributed search solution for processing concurrent range queries over moving objects in this work. Firstly, a Distributed Dynamic Index (DDI) that consists of a global grid index and local dynamic M-ary tree indexes was proposed to maintain the moving objects and support the search algorithm. Next, a Distributed Range Query Algorithm (DRQA) was designed based on DDI, which introduces an incremental search strategy to monitor the range queries as objects evolve; during the process, it further designs a computation sharing paradigm for processing multiple concurrent queries by making full use of their common computation to decrease the search cost. Finally, three object datasets with different distributions were simulated on a New York road network and three baseline methods were introduced to more sufficiently evaluate the performance of our proposal. Compared with state-of-the-art method, the initial query cost of the DRQA algorithm reduces by 22.7% and the incremental query cost drops by 15.2 existing approaches.


page 1

page 2

page 3

page 4


Distributed Continuous Range-Skyline Query Monitoring over the Internet of Mobile Things

A Range-Skyline Query (RSQ) is the combination of range query and skylin...

Efficient Continuous Top-k Geo-Image Search on Road Network

With the rapid development of mobile Internet and cloud computing techno...

REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries

Trajectory similarity computation is a fundamental component in a variet...

Fairest Neighbors: Tradeoffs Between Metric Queries

Metric search commonly involves finding objects similar to a given sampl...

An In-Depth Study of Continuous Subgraph Matching (Complete Version)

Continuous subgraph matching (CSM) algorithms find the occurrences of a ...

Analyzing Query Performance and Attributing Blame for Contentions in a Cluster Computing Framework

Analyzing contention for resources in a cluster computing environment ac...

Frequency-Competitive Query Strategies to Maintain Low Congestion Potential Among Moving Entities

We consider the problem of using location queries to monitor the congest...

Please sign up or login with your details

Forgot password? Click here to reset