Sciweavers

64 search results - page 8 / 13
» Efficient Location Updates for Continuous Queries over Movin...
Sort
View
ICDE
1998
IEEE
139views Database» more  ICDE 1998»
13 years 11 months ago
Cost and Imprecision in Modeling the Position of Moving Objects
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...
SIGMOD
2010
ACM
267views Database» more  SIGMOD 2010»
14 years 11 days ago
Processing proximity relations in road networks
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...
Zhengdao Xu, Hans-Arno Jacobsen
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
14 years 9 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
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...
DASFAA
2008
IEEE
156views Database» more  DASFAA 2008»
13 years 7 months ago
Load Balancing for Moving Object Management in a P2P Network
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 ...
DEXA
2007
Springer
173views Database» more  DEXA 2007»
14 years 1 months ago
A P2P Technique for Continuous k-Nearest-Neighbor Query in Road Networks
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...
Fuyu Liu, Kien A. Hua, Tai T. Do