Modify Compact R-tree Dynamic Index Structure for Myanmar GIS Database

Abstract

Spatial databases have been increasingly and widely used in recent years. In order to handle spatial data efficiently, as required in CAD and GIS applications, a spatial database system needs an index mechanism that will help it retrieve data item quickly according to their spatial locations. However, traditional indexing methods are not well suited to data objects of non-zero size located in multidimensional spaces. In this paper, we propose a category-based compact R-tree structure based on the category of services of Yangon region. The propose system can achieve almost 100% storage utilization and reduce time of search, insert and delete operation. The cost of searching time in this system is faster than normal compact R-tree which uses one index structure for all. The propose system is also aimed to reduce integrating errors of images contain the user location and current location and cover for all categories in desire range without searching the specific categories.