时空数据管理技术应用-移动数据.ppt

31 获得加速度 ? o ( t ) = o (0)+ v ? t + ? a ? t 2 ? o ( t )=3 o ( t ? 1) ? 3 o ( t ? 2)+ o ( t ? 3) ? o ( t ? 1), o ( t ? 2), o ( t ? 3) === o ( t ). ? 获得速度和加速度 . 32 圆形轨迹 ? o ( t ? 1), o ( t ? 2) === o ( t ). ? 获取半径 . 33 基于预测的体系结构 34 35 Continuous Nearest Neighbor Monitoring in Road Networks ? Continuous NN monitoring: Long-running queries demand constant update of their results. ? Existing methods are designed for Euclidean spaces. ? Consider a road network (where edge weights correspond to their length, or travel time). Queries and objects move in the network. ? Network distance: the length (i.e., sum of weights) of the shortest path connecting them. (Example: taxi – pedestrians) 36 Continuous NN monitoring in a Road Network ? Queries and objects move in an unpredictable manner in the network, issuing an update whenever they move ? Network edges issue weight updates ? Central server processes the stream of updates, and continuously reports the k NNs of each query according to network distance ? Aim: to minimize the query processing time 37 Data Structure ? Edges: ? indexed with a quadtree. ? the objects in it, ? an influence list. ? Queries ? its current NNs ? expansion tree . 1 空间数据处理的应用 移动对象管理 2 Content ? Moving object management system ? Index structure for Moving object ? Query process for moving object ? Continuous query of moving object in road network 3 Reference papers ? Sunil Prabhaker, Yuni Xia, etc., Query indexing and velocity constrained indexing: scalable Techniques for continuous queries on moving objects, IEEE Transactions on computers, vol.51,no.10,2002 ? Y. Tao, C. Faloutsos, D. Papadias, B. Liu , Prediction and Indexing of Moving Objects with Unknown Motion Patterns, SIGMOD 2004 ? Yufei Tao, Dimitris Papadias, Jian Zhai, Qing Li, Venn Sampling: A Novel Prediction Technique for Moving Object