R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
STRIPES: an efficient index for predicted trajectories
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient indexing of the historical, present, and future positions of moving objects
Proceedings of the 6th international conference on Mobile data management
Search on transportation network for location-based service
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Stepwise optimization method for k-CNN search for location-based service
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Hi-index | 0.00 |
The issue of how to provide location-based service (LBS) is attracted many researchers. In this paper, we focus on an useful searching type in LBS, forecasting search, which provides search result for a future time based on the current information of moving objects. To deal with such kind of searches, a PV-graph is proposed for analyzing the possible situations of the moving objects. By using PV-graph, forecasting queries in LBS applications can be responded efficiently.