{"title":"一种基于r树的优化查询索引方法","authors":"Wei Zhang, Xing Yang, Wangping Wu, Gang Xiang","doi":"10.1109/CSO.2011.84","DOIUrl":null,"url":null,"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.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"189 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"An Optimized Query Index Method Based on R-Tree\",\"authors\":\"Wei Zhang, Xing Yang, Wangping Wu, Gang Xiang\",\"doi\":\"10.1109/CSO.2011.84\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":210815,\"journal\":{\"name\":\"2011 Fourth International Joint Conference on Computational Sciences and Optimization\",\"volume\":\"189 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Fourth International Joint Conference on Computational Sciences and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2011.84\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2011.84","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.