The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
This paper tackles a major privacy concern in current location-based services where users have to continuously report their locations to the database server in order to obtain the ...
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...