Mobile Big Data Query Based on Double R-tree and Double Indexing
The amount of data in our industry and the world is exploding.Data is being collected and stored at unprecedented rates.The challenge is not only to store and manage the vast volume of data,which is also called big data,but also to analyze and query from it.In order to put forward the universal method to response mobile big data query,queries are separated and grouped according to kinds of query for massive mobile objects in the space.The indexing method for grouping the mobile objects with Grid (GG TPR-trec) has great efficiency to manage a massive capacity of mobile objects within a limited area,but it only could meet a part of requirements for mobile big data query if the GG TPR-tree was used solely.This thesis offers solutions to simple immediate query,simple continuous query,active window query,and continuous window query,dynamic condition query and other query requests by employing DTDI index structure.The experiments prove that with the support of DTDI index structure,query of massive mobile objects has higher precision and better query perfomance.
Kewords-mobile query big data double R-tree and double indexing
Liang Ye
Department of Computer Science Beijing Foreign Studies University Beijing,China
国际会议
太原
英文
1056-1059
2012-12-08（万方平台首次上网日期，不代表论文的发表时间）