Location-dependent query processing: Where we are and where we are heading
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 …
intense research in mobile data services. Some of these services provide the user with …
Keyword search on spatial databases
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 …
keywords. For example, online yellow pages allow users to specify an address and a set of …
Towards mobility data science (vision paper)
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 …
With the availability of GPS-equipped mobile devices and other inexpensive location …
On trip planning queries in spatial databases
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 …
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
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 …
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
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 …
(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
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 …
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
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 …
moving objects. The framework distinguishes itself from existing work by being the first to …
Continuous nearest neighbor monitoring in road networks
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 …
dynamic scenarios, where the queries and the data objects move frequently and arbitrarily …
Temporal spatial-keyword top-k publish/subscribe
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 …
generated at an unprecedented scale. These geo-textual data cover a wide range of topics …