Efficient Space Access Mechanism-based Geospatial Data Queries

In recent years, the Geographic Information Systems (GIS) gain rapidly progress, GIS are widely used in public administration, science and business. Accordingly, the data volume needed to be transacted by GIS trend to large; the management, representation and evaluation of spatial data hi information systems gain increasing importance. Due to the high complexity of spatial objects and spatial queries and also due to extremely large spatial data volumes, currently Geographic Information System (GIS) is faced with stringent requirements on large data storage, efficient access method and fast query processing.Spatial index is a key issue in massive geo-data processing. In this paper, B tree. hB tree and R*-tree are analyzed in detail, after backward-looking the development of large spatial data storage and management. Based on the study of spatial access methods, we research the spatial query operation, which is one of the important functions of GIS. Then we analyze an approach for spatial join processing that is based on three steps in detail, and propose a framework design for spatial query system based on R*-tree.Finally, we explore a system implement project for spatial query, which is based on the spatial index out of database. After probing into some key technologies and problems of system implement project, we establish a prototype spatial query system using this implement project.