Consider a database that represents the location of moving objects, such as taxi-cabs (typical query: retrieve the cabs that are currently within 1 mile of 33 Michigan Ave., Chica...
Ouri Wolfson, Sam Chamberlain, Son Dao, Liqin Jian...
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
Abstract. Online games and location-based services now form the potential application domains for the P2P paradigm. In P2P systems, balancing the workload is essential for overall ...
Mohammed Eunus Ali, Egemen Tanin, Rui Zhang, Lars ...
Due to the high frequency in location updates and the expensive cost of continuous query processing, server computation capacity and wireless communication bandwidth are the two li...