A Real Time GIS Approximation Approach for Multiphase Spatial Query Processing Using Hierarchical-Partitioned-Indexing Technique

Spatial objects are tremendously uneven geometric components, which have not definite shape and large number of coordinate are stored for describing the shape of an object. The geographic database systems is always faced high data volume and complexity of objects/entity and query, this impose strict needs on their storage space and accessing architecture in respect to efficient query processing. To perform any data structure operation –sorting, searching, merging, etc. would be time consuming and expensive. In general, has to be improving concepts such as spatial storage, accessing structure, approximation, partition of an object, and multiphase query processing, before any computation is applied. To achieve the efficient approximations of spatial object, propose a robust, efficient and simple new spatial object partition method, called SOPMs to increase feedback of multiphase spatial query processing which is best suited for convex and non convex multifaceted spatial entity in present GIS application. The idea behind is that an entity (polygon) by partitioning recursively in sub polygon until a least bound quadrangle (LBQ) constraint is valid. To improve and increase the efficiency of SOPMs technique is merged with extended spatial indexing structure.