• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.455-457
• /
• 2003

Diverse researches are working moving objects. The most important activities in a moving object database system are query and analysis of spatio -temporal data providing decision-making and problem solving support. Traditional spatial database query language and tools are inappropriate of the real world entities. This paper presents a spatio-temporal query and analysis tool with visual environment. It provides effective, interactive and user-friendly as well as statistic analysis. The moving objects database system stores plentiful moving objects data and performs spatio-temporal and nonspatio-temporal queries.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.778-784
• /
• 2005

Miniaturization of computing devices, and advances in wireless communication and positioning systems will create a wide and increasing range of database applications such as location-based services, tracking and transportation systems that has to deal with Moving Objects. Various types of queries could be posted to moving objects, including past, present and future queries. The key problem is how to model the location of moving objects and enable Database Management System (DBMS) to predict the future location of a moving object. It is obvious that there is a need for an innovative, generic, conceptually clean and application-independent approach for spatio-temporal handling data. This paper presents behavioral aspect of the spatio-temporal databases for managing and querying moving objects. Our objective is to impelement and extend the Spatial TAU (STAU) system developed by Dr.Pelekis that provides spatio-temporal functionality to an Object-Relational Database Management System to support modeling and querying moving objecs. The results of the impelementation are demonstrated in this paper.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.725-727
• /
• 2006

The development of GIS and Location-Based Services requires a high-level database that will be able to allow real-time access to moving objects for spatial and temporal operations. MODB.MM is able to meet these requirements quite adequately, providing operations with the abilities of acquiring, storing, and querying large-scale moving objects. It enables a dynamic and diverse query mechanism, including searches by region, trajectory, and temporal location of a large number of moving objects that may change their locations with time variation. Furthermore, MODB.MM is designed to allow for performance upon main memory and the system supports the migration on out-of-date data from main memory to disk. We define the particular query for truncation of moving objects data and design two migration methods so as to operate the main memory moving objects database system and file-based location storage system with.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.287-290
• /
• 2004

In the moving object database system, spatiotemporal join is very import operation when we process join moving objects. Processing time of spatio-temporal join operation increases by geometric progression with numbers of moving objects. Therefore efficient methods of spatio-temporal join is essential to moving object database system. In this paper, we propose spatio-temporal join algorithm with TB-Tree that preserves trajectories of moving objects, and show result of test. We first present basic algorithm, and propose cpu-time tunning algorithm and IO-time tunning algorithm. We show result of test with data set created by moving object generator tool.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.460-464
• /
• 2003

The objects which continuously change their locations in the real world are called moving objects. The works on the existing spatial indices have been proposed the retrieval methods. However, keeping track of the terminal location of moving objects is more important than the efficiency of the query processing in the moving object database. Therefore, many pure spatial indices are not applicable to the moving objects database which should maintain the object's current location as precise as possible. This parer proposes a method for reducing the construction time of indexing moving objects. We analyze the characteristics of the method to re-index all the objects after each time period and the method to update immediately the locations on reporting their locations. We also newly propose a selective immediate update method using the properties of moving objects in order to minimize the number of database updates.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.309-312
• /
• 2005

The need for LBS (Loc,ation Based Services) is increasing due to the wnespread of mobile computing devices and positioning technologies~ In LBS, there are many applications that need to manage moving objects (e.g. taxies, persons). The moving object join operation is to make pairs with spatio-temporal attribute for two sets in the moving object database system. It is import and complicated operation. And processing time increases by geometric progression with numbers of moving objects. Therefore efficient methods of spatio-temporal join is essential to moving object database system. In this paper, we apply spatial join methods to moving objects join. We propose two kind of join methods with TB- Tree that preserves trajectories of moving objects. One is depth first traversal spatio-temporaljoin and another is breadth-first traversal spatio-temporal join. We show results of performance test with sample data sets which are created by moving object ,generator tool.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.612-614
• /
• 2003

In this paper we propose four-dimensional (4D) operators, which can be used to deal with sequential changes of topological relationships between 4D moving objects and we call them 4D development operators. In contrast to the existing operators, we can apply the operators to real applications on 4D moving objects. We also propose a new approach to define them. The approach is based on a dimension-separated method, which considers x-y coordinates and z coordinates separately. In order to show the applicability of our operators we show the algorithms for the proposed operators and development graph between 4D moving objects.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1276-1282
• /
• 2003

The works on the existing spatial indices have been proposed the retrieval methods. However, keeping track of the terminal location of moving objects is more important than the efficiency of the query processing in the moving object database. Therefore, many pure spatial indices are not applicable to the moving objects database which should maintain the object's current location as precise as possible. This paper proposes a method for reducing the construction time of indexing moving objects. We analyze the characteristics of the method to re-index all the objects after each time period and the method to update immediately the locations on reporting their locations. We also newly propose a selective immediate update method using the properties of moving objects in order to minimize the number of database updates.

• The KIPS Transactions:PartD
• /
• v.8D no.2
• /
• pp.105-116
• /
• 2001

Moving objects are spatiotemporal data that location and shape of spatial objects are changed continuously over time. If spatiotemporal moving objects are managed by conventional database system, moving objects management systems have two problems as follows. First, update for location information changed over time is occurred frequently. Second, past and future information of moving objects are not provided by system because only current state of objects is stored in the system. Therefore, in this paper, we propose a spatiotemporal moving objects management system which is able to not only manage historical information of moving objects without frequent update, but also provide all location information about past, current, and near future. In the proposed system, information of moving objects are divided into location information for representing location and motion information for representing moving habits. Especially, we propose the method which can search location information all objects by use of changing process algorithms with minimum history information. Finally, we applied the proposed method to battlefield analysis system, as the result of experiment, we knew that past, current, and near future location information for moving objects are managed by relational database and GIS system.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.441-452
• /
• 2002

If continuous moving objects are managed by conventional database, it is not possible for them to store all position information changed over time in the database. Therefore, a time period of regular rate is determined and position information of moving objects are discretely stored in the system for every time period. However, if continuous moving objects are managed as discrete model, we will have problems which cannot properly answer to the query about uncertain past or future position information. To solve this problem, in this paper, we propose the method and algorithm which use the history information stored in the same database, to estimate the past or future location of moving objects. The cubic spline interpolation is used to estimate the past location and the mean movement value of the history information is used to predict the future location of moving objects. Finally, from the location estimation experimentation of using virtual trajectory and location sample, we proved that the proposed cubic spline function has less error than the linear function.