Location-dependent query processing: Where we are and where we are heading

S Ilarri, E Mena, A Illarramendi - ACM computing surveys (CSUR), 2010 - dl.acm.org
The continuous development of wireless networks and mobile devices has motivated an
intense research in mobile data services. Some of these services provide the user with …

Keyword search on spatial databases

I De Felipe, V Hristidis, N Rishe - 2008 IEEE 24th International …, 2008 - ieeexplore.ieee.org
Many applications require finding objects closest to a specified location that contains a set of
keywords. For example, online yellow pages allow users to specify an address and a set of …

Towards mobility data science (vision paper)

M Mokbel, M Sakr, L **ong, A Züfle, J Almeida… - arxiv preprint arxiv …, 2023 - arxiv.org
Mobility data captures the locations of moving objects such as humans, animals, and cars.
With the availability of GPS-equipped mobile devices and other inexpensive location …

On trip planning queries in spatial databases

F Li, D Cheng, M Hadjieleftheriou, G Kollios… - … symposium on spatial …, 2005 - Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning
Query (TPQ). Given a set of points of interest P in space, where each point belongs to a …

Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring

K Mouratidis, D Papadias… - Proceedings of the 2005 …, 2005 - dl.acm.org
Given a set of objects P and a query point q, ak nearest neighbor (k-NN) query retrieves the
k objects in P that lie closest to q. Even though the problem is well-studied for static datasets …

Aggregate nearest neighbor queries in spatial databases

D Papadias, Y Tao, K Mouratidis, CK Hui - ACM Transactions on …, 2005 - dl.acm.org
Given two spatial datasets P (eg, facilities) and Q (queries), an aggregate nearest neighbor
(ANN) query retrieves the point (s) of P with the smallest aggregate distance (s) to points in …

Continuous monitoring of top-k queries over sliding windows

K Mouratidis, S Bakiras, D Papadias - Proceedings of the 2006 ACM …, 2006 - dl.acm.org
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with
the highest scores according to f. Even though the problem is well-studied in conventional …

A generic framework for monitoring continuous spatial queries over moving objects

H Hu, J Xu, DL Lee - Proceedings of the 2005 ACM SIGMOD …, 2005 - dl.acm.org
This paper proposes a generic framework for monitoring continuous spatial queries over
moving objects. The framework distinguishes itself from existing work by being the first to …

Continuous nearest neighbor monitoring in road networks

K Mouratidis, ML Yiu, D Papadias, N Mamoulis - 2006 - ink.library.smu.edu.sg
Recent research has focused on continuous monitoring of nearest neighbors (NN) in highly
dynamic scenarios, where the queries and the data objects move frequently and arbitrarily …

Temporal spatial-keyword top-k publish/subscribe

L Chen, G Cong, X Cao, KL Tan - 2015 IEEE 31St international …, 2015 - ieeexplore.ieee.org
Massive amount of data that are geo-tagged and associated with text information are being
generated at an unprecedented scale. These geo-textual data cover a wide range of topics …