A Moving Objects Index Method Integrating GeoHash and Quadtree
Authors
Ya Ban, Rui Wang, Hongjing Liu, Jing Yuan, Hao Luo, Fuli Yang, Ling Yu, Xinping Xu
Corresponding Author
Ya Ban
Available Online April 2018.
- DOI
- 10.2991/cmsa-18.2018.87How to use a DOI?
- Keywords
- GeoHash; bottom-up update; Quadtree; nearest neighbor query; moving object index
- Abstract
To take into account of frequent update, efficiency and query capability, a new full-time index structure was proposed with help of one-to-one match between Quad-tree nodes and GeoHash codes, named GQ-tree, which supported moving objects updating frequently. An efficient index update algorithm based on GeoHash encoding was proposed to improved efficiency. Algorithms of efficient nearest neighbor query, spatiotemporal query, and continuous query were proposed with the help of Hash table, linked list and GeoHash of moving object position. Experimental results prove GQ-tree is better than existing methods in terms of index update, spatiotemporal query and so on.
- Copyright
- © 2018, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Ya Ban AU - Rui Wang AU - Hongjing Liu AU - Jing Yuan AU - Hao Luo AU - Fuli Yang AU - Ling Yu AU - Xinping Xu PY - 2018/04 DA - 2018/04 TI - A Moving Objects Index Method Integrating GeoHash and Quadtree BT - Proceedings of the 2018 International Conference on Computer Modeling, Simulation and Algorithm (CMSA 2018) PB - Atlantis Press SP - 385 EP - 388 SN - 1951-6851 UR - https://doi.org/10.2991/cmsa-18.2018.87 DO - 10.2991/cmsa-18.2018.87 ID - Ban2018/04 ER -