Shortest distance query is a fundamental operation in large-scale networks. Many existing
methods in the literature take a landmark embedding approach, which selects a set of graph …

The minimum path pair (MPP) query problem is to find the optimal meeting point of two
minimum paths for two users in a network, where each user's minimum path has its own …

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 …

Dynamic ride sharing is a service that enables shared vehicle rides in real time and on short
notice. It can be an effective solution to counter the problem of increasing traffic jams at peak …

Given two sets of moving objects with nonzero extents, the continuous intersection join
query reports every pair of intersecting objects, one from each of the two moving object sets …

This paper proposes a time-dependent visiting trip planning (TVTP) framework to find the
most efficient visiting order and plan the fastest moving paths based on Internet of Things …

Spatial queries play an important role in many transportation services. Existing solutions to
spatial queries commonly rely on the measurement of road network distance, which is the …

In the new “gig” economy, a user plays the role of a consumer as well as a service provider.
As a service provider, drivers travelling from a source to a destination may opportunistically …

Many spatial applications benefit from the fast answering to a seemingly simple spatial
query:“Is a point of interest (POI)'in-path'to the shortest path between a source and a …

Various efficient indexing techniques have been proposed for formulating broadcast index to
minimize the tune-in cost at mobile clients to support shortest path search in a road network …