G-Tree: An Efficient and Scalable Index for Spatial Search on Road Networks

@article{Zhong2015GTreeAE,
  title={G-Tree: An Efficient and Scalable Index for Spatial Search on Road Networks},
  author={Ruicheng Zhong and Guoliang Li and Kian-Lee Tan and Lizhu Zhou and Zhiguo Gong},
  journal={IEEE Transactions on Knowledge and Data Engineering},
  year={2015},
  volume={27},
  pages={2175-2189}
}
In the recent decades, we have witnessed the rapidly growing popularity of location-based systems. Three types of location-based queries on road networks, single-pair shortest path query, k nearest neighbor (kNN) query, and keyword-based kNN query, are widely used in location-based systems. Inspired by R-tree, we propose a height-balanced and scalable index, namely G-tree, to efficiently support these queries. The space complexity of G-tree is O(|V|log|V|) where |V| is the number of vertices in… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Similar Papers

Loading similar papers…