Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 111))

Abstract

The intermediate nodes of traditional R-tree use the smallest bounding rectangle as the indicator, in the case of rapid increasing in the amount of data, it will generate much overlapping and coverage between MBR, the index performance and query efficiency will drop significantly. This paper will use the data structure based on grid coordinate division to indicate the intermediate nodes MBR of R-tree, a new R-tree index (GR-tree) based on grid coordinates division is proposed, grid coordinates make the location of space entities and its MBR confirmed, therefore reduce the overlap and coverage between MBR, and by using coordinate tree and circular linked list to store spatial object entities, during the process of index operation, the performance of inserting, deleting, querying algorithm is superior to that of the traditional R-tree, so it can greatly reduce the time complexity of algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Guttman, A.: R - Trees: A Dynamic Index Structure for Spatial Searching. In: Proc of ACM SIGMOD, pp. 47–57. ACM Press, Boston (1984)

    Google Scholar 

  2. Wang, J.: Spatial information system theory, p. 1211. Science Press, Beijing (2001)

    Google Scholar 

  3. Guo, Z., Wang, Y., Yang, C.: Spatial data indexing query technology research and its application. Computer Engineering and Application 38(23), 176–178 (2002)

    Google Scholar 

  4. Zhao, N.: A kind of multi-level mixing index based on grid and the R-tree. Computer technology and development (2009)

    Google Scholar 

  5. Shashi, S.: Spatial databases. In: Xie, K.-Q. (trans.) Mechanical Industry Press, Beijing (2004)

    Google Scholar 

  6. Zeng, D., Mi, H., Liu, L.: A kind of clustering algorithm based on mesh density and space division tree. Systems Engineering Theory and Practice of the first (2008)

    Google Scholar 

  7. Xiao, W., Feng, Y., Miao, Y.: GIS Spatial Grid Index mechanism based on R-tree spatial index. Journal of Computers 17(10), 45–51 (1994)

    Google Scholar 

  8. He, J., Li, Z., Chen, Y.: GIS Spatial index method based on R-tree spatial index. Journal of Sichuan University (Natural Science Edition) (6), 1341–1346 (2008)

    Google Scholar 

  9. Gu, J., Wu, C.: Common spatial index technical analysis. Microcomputer Applications (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, G., Tang, J. (2011). A New R-tree Spatial Index Based on Space Grid Coordinate Division. In: Jiang, L. (eds) Proceedings of the 2011, International Conference on Informatics, Cybernetics, and Computer Engineering (ICCE2011) November 19–20, 2011, Melbourne, Australia. Advances in Intelligent and Soft Computing, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25188-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25188-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25187-0

  • Online ISBN: 978-3-642-25188-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics