Spatial R-Tree Index Based on Grid Division for Query Processing

Esraa Rslan, Hala Abdel Hameed, Ehab Ezzat
2017 International Journal of Database Management Systems  
Tracing moving objects have turned out to be essential in our life and have a lot of uses like: GPS guide, traffic monitor based administrations and location-based services. Tracking the changing places of objects has turned into important issues. The moving entities send their positions to the server through a system and large amount of data is generated from these objects with high frequent updates so we need an index structure to retrieve information as fast as possible. The index structure
more » ... hould be adaptive, dynamic to monitor the locations of objects and quick to give responses to the inquiries efficiently. The most wellknown kinds of queries strategies in moving objects databases are Rang, Point and K-Nearest Neighbour and inquiries. This study uses R-tree method to get detailed range query results efficiently. But using R-tree only will generate much overlapping and coverage between MBR. So R-tree by combining with Gridpartition index is used because grid-index can reduce the overlap and coverage between MBR. The query performance will be efficient by using these methods. We perform an extensive experimental study to compare the two approaches on modern hardware.
doi:10.5121/ijdms.2017.9602 fatcat:662lp5ylyngpnpubs3jiszda7y