• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.11-20
• /
• 1999

Because conventional spatial databases process the spatial information that is valid at current time, it is difficult to manage historical information efficiently which has been changed from the past to current. Recently, there are rapid increasing of interest to solve this problem so that makes databases to support historical information as well as spatial management at the same time. It can be eventually used in a various application areas. The formal semantics in a database is used to represent database structures and operations in order to prove the correctiveness of them in terms or mathematics. It also plays an important role in database to design a database and database management system. So in this paper, we suggest spatiotemporal domain, object, data, and spatiotemporal geometric/topological operations. And we not only formalize relational algebra/calculus using formal semantics for a spatiotemporal data model, but also show the example of real orld with them.

• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.375-384
• /
• 2005

Most of data objects in the real world have spatial and temporal information simultaneously. One of the objectives of spatiotemporal databases is to provide a very expressive framework for spatiotemporal database applications. The object oriented spatiotemporal model can manage spatiotemporal data efficiently because the model is able to store the complete history of any objects. Therefore, in order to handle the spatiotemporal data in object oriented fashion, we proposed a low dimensional spatiotemporal model in the object oriented fashion that extended dimensionally two dimensional spatial model of OpenGIS to fit into the real world information and to include temporal information. In order to proof the proposed model, we design a data provider component which consists of the data source, the session, the command, and the rowset component, and implement it. The proposed four dimensional spatiotemporal data model and provider in the object oriented fashion can be used to store, retrieve and manage the object oriented spatiotemporal data.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1039-1051
• /
• 1999

시공간 데이타베이스는 현실세계의 객체에 대하여 효율적인 공간 관리와 이력 관리를 지원한다. 이러한 시공간 데이타베이스는 시간차원과 공간차원이라는 이질적 데이타 공간을 관리하여야 하는 대단히 복잡한 시스템이다. 따라서 데이타에 대한 효율적 접근 방법에 대한 연구가 필수적이며, 이는 효율적 색인 기법의 개발을 통하여 이룰 수 있다. 그러나 시공간 데이타에 대한 접근방법 연구는 거의 이루어지지 않고 있으며 극소수의 사례들마저도 공간 객체의 이력 개념을 지원하는 것이 아니라 멀티미디어 객체의 상대적 시간만을 지원하고 있다. 따라서 이 논문에서는 공간 데이타의 이력을 표현하는 시공간 데이타에 대하여 효율적으로 색인하기 위한 방안으로서 시간과 공간을 단일화된 색인 영역으로 통합하는 단일화된 시공간 색인 모델을 제시하고, 이를 기존의 R-트리를 기반으로 확장한 색인을 설계 및 구현하였으며, 아울러 다양한 유형의 시공간 연산에 대한 색인의 성능을 평가하였다.Abstract Spatiotemporal databases are able to support an efficient spatial management as well as historical management for an object in the real world. It is very complex to manage these two dimensions why there exists on difference of inborn property of temporal and spatial dimensions. Therefore an efficient access method should be studied, and it can be done by means of development of efficient indexing technology.However, there is a few related work in the research of access methods of spatiotemporal data. Also the previous works do not support the concept of history for spatial object, and only support the relative time among multimedia objects. Therefore, in this paper, we propose a unified Spatiotemporal index model as an efficient index for Spatiotemporal data. And we not only design Spatiotemporal index that has been extended to historical management facility on the basis of conventional R-tree, but also implement it. Finally we have evaluated performance of index for the various kinds of Spatiotemporal operations.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.4
• /
• pp.45-56
• /
• 2010

This paper suggests constraint data modeling based on constraint data presentation techniques to perform complex spatial database operation naturally. We were able to identify the limitation of extendibility of dimension and non-equal framework via relevant research for former schema of spatial database and query processing. Therefore we described generalized tuple of spatial data and the definition of suggested constraint data modeling. Also we selected MLPQ/PReSTO tool among constraint database prototype and compare standard functionality of ARC/VIEW. Then we design scenario for spatial operation using MLPQ/PReSTO and we suggested application effect after query processing. Based on above explanation, we were able to identify that we can process spatial data naturally and effectively using simple constraint routine on same framework via constraint data modeling.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2004.12a
• /
• pp.81-88
• /
• 2004

GIS (geographic information system) applications increasingly require the representation of geospatial objects with fuzzy extent and querying of time-varying information. In this paper, we Introduce a FSTDB (fuzzy spatiotemporal database) to represent and manage states and events causing changes of dynamic fuzzy objects using fuzzy set theory. We also propose the algorithms for the operators to be included in a GIS to make it able to answer queries depending on fuzzy predicates during a time interval and a method to identify the development process of objects during a certain period based on the designed database. They can be used in application areas handling time-varying geospatial data, including global change (as in climate or land cover change) and social (demographic, health, ect.) application.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.52-63
• /
• 2003

Spatiotemporal moving objects are changing their Positions and/or shape over time in real world. As most of the indices of moving object are based on the R-tree. they have defects of the R-tree which are dead space and overlap. Some of the indices amplify the defects of the R-tree. In the paper, to solve the problems, we propose the MPR-tree(Moving Point R-tree) using Projection operation which has more effective search than existing moving point indices on time slice query and spatiotemporal range query. The MPR-tree connects positions of the same moving objects over time by using linked list, so it processes the combined query about trajectory effectively. The usefulness of the Projection operation is confirmed during processing moving object queries and in practical use of space from experimentation to compare MPR-tree with existing indices of moving objects. The proposed MPR-tree would be useful in the LBS, the car management using GPS, and the navigation system.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.

• Journal of Computing Science and Engineering
• /
• v.5 no.3
• /
• pp.210-222
• /
• 2011

In this work, we study the problem of privacy-preservation data publishing in moving objects databases. In particular, the trajectory of a mobile user in a plane is no longer a polyline in a two-dimensional space, instead it is a two-dimensional surface of fixed width $2A_{min}$, where $A_{min}$ defines the semi-diameter of the minimum spatial circular extent that must replace the real location of the mobile user on the XY-plane, in the anonymized (kNN) request. The desired anonymity is not achieved and the entire system becomes vulnerable to attackers, since a malicious attacker can observe that during the time, many of the neighbors' ids change, except for a small number of users. Thus, we reinforce the privacy model by clustering the mobile users according to their motion patterns in (u, ${\theta}$) plane, where u and ${\theta}$ define the velocity measure and the motion direction (angle) respectively. In this case, the anonymized (kNN) request looks up neighbors, who belong to the same cluster with the mobile requester in (u, ${\theta}$) space: Thus, we know that the trajectory of the k-anonymous mobile user is within this surface, but we do not know exactly where. We transform the surface's boundary poly-lines to dual points and we focus on the information distortion introduced by this space translation. We develop a set of efficient spatiotemporal access methods and we experimentally measure the impact of information distortion by comparing the performance results of the same spatiotemporal range queries executed on the original database and on the anonymized one.

• Journal of Korea Spatial Information System Society
• /
• v.5 no.1 s.9
• /
• pp.65-74
• /
• 2003

Location-based service is an important spatiotemporal database application area that provides the location-aware information of wireless terminals via positioning devices such as GPS. With the rapid advances of wireless communication systems, the requirement of mobile application areas including traffic, mobile commerce and supply chaining management became the center of attention for various research issues in spatiotemporal databases. In this paper we present the A-Quadtree, an efficient indexing method for answering location-based queries where the movement vector information (e.g., speed and velocity) is not presented. We implement the A-Quadtree with an index structure for object identifiers as a.Net component to apply the component to multiplatforms. We present our approach and describe the performance evaluation through various experiments. In our experiments, we compare the performance with previous approaches and show the enhanced efficiency of our method.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.179-186
• /
• 2008

The converge of location-aware devices, GIS functionalities and the increasing accuracy and availability of positioning technologies pave the way to a range of new types of location-based services. The field of spatiotemporal data mining where relationships are defined by spatial and temporal aspect of data is encountering big challenges since the increased search space of knowledge. Therefore, we aim to propose algorithms for mining spatiotemporal patterns in mobile environment in this paper. Moving patterns are generated utilizing two algorithms called All_MOP and Max_MOP. The first one mines all frequent patterns and the other discovers only maximal frequent patterns. Our proposed approach is able to reduce consuming time through comparison with DFS_MINE algorithm. In addition, our approach is applicable to location-based services such as tourist service, traffic service, and so on.