We study the classical k NN queries on road networks. Existing solutions mostly focus on
reducing query processing time. In many applications, however, system throughput is a …

In the past decade, many works have focused on the development of moving object
database indexing and querying. Most of those works have concentrated on the common …

Top-k Nearest Neighbors (kNN) problem on road network has numerous applications on
location-based services. As direct search using the Dijkstra's algorithm results in a large …

In this paper, we study the processing of top-k spatial preference queries in road networks. A
top-k spatial preference query retrieves a ranked list of the k best data objects based on the …

With the help of location-based services (LBS), mobile users are able to access their actual
locations, which can be used to search for information around them which they are …

To avoid traffic accidents, drivers must constantly be aware of nearby vehicles.
Unfortunately, nearby vehicles often go unnoticed because of various obstacles such as …

The proliferation of current and next-generation mobile and sensing devices has increased
at an alarming rate. With these state-of-the-art devices, the global positioning system (GPS) …

Common reverse nearest neighbor queries in spatial database run in an inefficient way
because they need to check a query result with almost every nearest neighbor. This wastes …

In this paper, we investigate the problem of computing the safe exit points of moving range
queries in directed road networks where each road segment has a particular orientation …

A top‐k spatial keyword (TkSk) query ranks objects based on the distance to the query
location and textual relevance to the query keywords. Several solutions have been …