Earticle

초록

영어

With the continuous development of wireless communication and mobile positioning technologies, spatio-temporal queries of moving objects attract more and more attention. In practical application, affected by the sampling frequency of the devices, the position information of moving objects restricted to the road network is often with uncertainty. In this paper, on the basis of the distributed computing framework-Hadoop, it firstly constructs the UPBI index mixing certain and uncertain data. Secondly, it proposes the probabilistic range parallel queries algorithm and the probabilistic calculating method of moving objects on road network. Finally, it gives space constraint r-Restrict to reduce the query scope of the possible path, and simultaneously gives sample pair division to resolve the problem of repetitive calculation. The experiment proves that index and query algorithm proposed effectively solve the mass data problem about moving objects, and enhance query efficiency and precision.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Problem Formulation
 4. Index Structure
  4.1 Spatial Index
  4.2 Temporal Index
 5. Probabilistic Range Queries
  5.1 Query Algorithm
  5.2 Possible Paths Calculation
 6. Experimental Evaluation
  6.1 Performance of the Query Time
  6.2 Performance of the Query Precision
 7. Conclusion
 Acknowledgment
 References

키워드

저자

• Yaqing Shi [ PLA University of Science and Technology Nanjing, China ]
• Jun Feng [ Hohai University Nanjing, China ]
• Zhengping Ren [ PLA University of Science and Technology Nanjing, China ]
• Wenjuan Xie [ PLA University of Science and Technology Nanjing, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Smart Home

• 간기

  격월간

• pISSN

  1975-4094

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605