Continuous spatial query processing: A survey of safe region based techniques

J Qi, R Zhang, CS Jensen… - ACM Computing …, 2018 - dl.acm.org
In the past decade, positioning system-enabled devices such as smartphones have become
most prevalent. This functionality brings the increasing popularity of location-based services …

Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks

MA Cheema, W Zhang, X Lin, Y Zhang, X Li - The VLDB Journal, 2012 - Springer
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbors
queries in Euclidean space as well as in spatial networks. Existing techniques are sensitive …

G*-tree: An efficient spatial index on road networks

Z Li, L Chen, Y Wang - 2019 IEEE 35th International …, 2019 - ieeexplore.ieee.org
In this paper, we propose an efficient hierarchical index, G*-tree, to optimize spatial queries
on road networks. Most existing graph indexes can only support one kind of query, and thus …

Efficient continuous top-k spatial keyword queries on road networks

L Guo, J Shao, HH Aung, KL Tan - GeoInformatica, 2015 - Springer
With the development of GPS-enabled mobile devices, more and more pieces of information
on the web are geotagged. Spatial keyword queries, which consider both spatial locations …

Continuously monitoring alternative shortest paths on road networks

L Li, MA Cheema, ME Ali, H Lu… - Proceedings of the VLDB …, 2020 - forskning.ruc.dk
Modern navigation systems do not only provide shortest paths but also some alternative
paths to provide more options to the users. This paper is the first to study the problem of …

T-PORP: a trusted parallel route planning model on dynamic road networks

B Li, T Dai, W Chen, X Song, Y Zang… - IEEE Transactions …, 2022 - ieeexplore.ieee.org
Route planning over dynamic road networks is an increasingly fundamental problem of
modern transportation systems for human society, especially in the field of Intelligent Supply …

Efficiently processing snapshot and continuous reverse k nearest neighbors queries

MA Cheema, W Zhang, X Lin, Y Zhang - The VLDB Journal, 2012 - Springer
Given a set of objects and a query q, a point p is called the reverse k nearest neighbor (R k
NN) of q if q is one of the k closest objects of p. In this paper, we introduce the concept of …

Service-oriented middleware for large-scale mobile participatory sensing

S Hachem, A Pathak, V Issarny - Pervasive and Mobile Computing, 2014 - Elsevier
In this paper, we introduce MobIoT, a service-oriented middleware that enables large-scale
mobile participatory sensing. Scalability is achieved by limiting the participation of redundant …

SHERLOCK: Semantic management of location-based services in wireless environments

R Yus, E Mena, S Ilarri, A Illarramendi - Pervasive and Mobile Computing, 2014 - Elsevier
Abstract Location-Based Services (LBSs) are attracting great interest nowadays, mainly due
to the economic value they can provide. So, different applications are being developed for …

A general framework for MaxRS and MaxCRS monitoring in spatial data streams

D Amagata, T Hara - ACM Transactions on Spatial Algorithms and …, 2017 - dl.acm.org
This article addresses the MaxRS (Maximizing Range Sum) monitoring problem. Given a set
of weighted spatial stream objects, this problem is to monitor a location of a user-specified …