Young Duk Seo , En Suk Hong , Bong Hee Hong

The KIPS Transactions:PartD, Vol. 11, No. 7, pp. 1399-1408, Dec. 2004
10.3745/KIPSTD.2004.11.7.1399,   PDF Download:

Abstract

Because there are so many spatio-temporal data in Moving Object Databases, a single disk system can not gain the fast response time and total throughput. So it is needed to take a parallel processing system for the high effectiveness query process. In these existing parallel processing systems, it does not consider characters of moving object data. Moving object data have to be thought about continuous report to the Moving Object Databases. So it is necessary think about the new Declustering System for the high performance system. In this paper, we propose the new Declustering Policies of Moving object data for high effectiveness query processing. At first, consider a spatial part of MBB(Minimum Bounding Box) then take a SD(SemiAllocation Disk) value. Second time, consider a SD value and time value which is node made at together as SDT-Proximity. And for more accuracy Declustering effect, consider a Load Balancing. Evaluation shows performance improvement of average 15% compare with Round-Robin method about 5% and 10% query area. And performance improvement of average 6% compare with Spatial Proximity method.

Statistics
Cite this article