Abstract
Query efficiency of geographic information system is a critical factor which depends on the query algorithm, and query algorithm is dependent on indexing structure. Based on the R-Tree spatial index, a method optimizing the query index is proposed for GIS most adjacent query and multi-dimensional data structure is designed. Query performance of the structure is analyzed theoretically and advantages are proved. The spatial overlap is effectively reduced and the query efficiency is improved. Application results show that the method can meet the application requirements with low-speed operating environment, and has a certain predictability constraints for query time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
