Mobile Big Data Query Based on Double R-Tree and Double Indexing

Abstract:

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-tree) 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 performance.

• Periodical: Advanced Materials Research (Volumes 756-759)
• Pages: 916-921
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.756-759.916
• Online since: September 2013
• Authors: Ye Liang
• Keywords: Big Data, Double Indexing, Double R-Tree, Mobile Query

References

[1] K. Tabassum, M. Hijab, and A. Damodaram, Location Dependent Query Processing – Issues, Challenges and Applications, 2010 Second International Conference on Computer and Network Technology (ICCNT 2010), 2010, pp.239-243.

DOI: 10.1109/iccnt.2010.39

[2] Qing Zhu, and Zuoyan Qin, HyDB: Access Optimization for Data-Intensive Service, 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems (HPCC-ICESS 2012), 2012, pp.580-587.

DOI: 10.1109/hpcc.2012.84

[3] Ye Liang, Double R-tree and Double Indexing for Mobile Objects, Advances in Intelligent and Soft Computing, 2012, Volume 135, pp.271-278.

DOI: 10.1007/978-3-642-27708-5_36

[4] Ye Liang, An Efficient Indexing Maintenance Method for Grouping Moving Objects with Grid, Procedia Environmental Sciences, 2011, 11(1), pp.486-492.

DOI: 10.1016/j.proenv.2011.12.077

[5] Ye Liang, GG TPR-tree Indexing Method for Grouping Moving Objects, Proceedings of International Conference on Computers, Communications, Control and Automation, 2011, pp.375-378.

[6] Jimeng Sun, Dimitris Papadias, Yufei Tao, and Bin Liu, Querying about the past, the present, and the future in spatio-temporal database. 20th International Conference on Data Engineering, 2004, pp.202-213, doi: 10. 1109/ICDE. 2004. 1319997.

DOI: 10.1109/icde.2004.1319997

[7] Simonas Saltenis, Christian Jensen, and S Jensen, Indexing the positions of continuously moving objects, SIGMOD 2000, 2000, pp.331-342.

DOI: 10.1145/335191.335427

[8] Wei Liao, Ning Jing, and Zhinong Zhong, An efficient prediction technique for range aggregation of moving objects, Journal of Computer Research and Development, 2007 Vol. 44(6): 1015-1021.

DOI: 10.1360/crad20070614