이동객체궤적에 대한 효율적인 범위질의

Abstract

Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in manny applications. The management and analysis of spatio-temporal and multimedia data is a hot issue in database research because such data types are handled in manny applications. So, the management and analysis of spatio-temporal data is very important in database research. Also, Query processing of such content is very important for these applications. In n-dimensional spatial data, Minimum Boundary Rectangle was used to handle the moving object trajectories data. But, this method has inaccurate approximation. So, It makes many dead space and performs unnecessary operation when processing a query. This paper addresses algorithms that make index structure by using Douglas-Peucker Algorithm and process range query efficiently on moving objects trajectories. We developed algorithm that makes index structure using approximation. And We compare and analyze our algorithms and Minimum Boundary Rectangle by experiments. Experiments of this dissertation can be easily checked that our algorithms make smaller size of index structure and process more efficiently.