Research on Technologies of Spatial Configuration Information Retrieval

The problem of spatial configuration information retrieval is a constraint satisfaction problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data are generally reorganized using index techniques like R-tree to improve the efficiency of query answering in spatial information systems, especially geographic information system (GIS), and the spatial data are approximated by their minimum bounding rectangles (MBRs), so the spatial configuration information retrieval is actually based on the MBRs and some special techniques should be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree. Based on these study results, three search algorithms are designed and presented.