• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.3-13
• /
• 2004

The TPR-tree exploits bounding rectangles based on the function of time in order to index moving objects. As time passes on, each edge of a BR expands with the fastest velocity vector. Since the expansion of the BR results in a serious overlaps between neighboring nodes, the performance of range query is getting worse. In this paper, we propose schemes to reorganize bounding rectangles of nodes. When inserting a moving object, we exploit a forced merging scheme to merge two overlapped nodes and re-split it. When deleting a moving object, we used forced reinsertion schemes to reinsert other objects of a node into a tree. The forced reinsertion schemes are classified into a deleted node reinsertion scheme and an overlapped nodes reinsertion scheme. The overlapped nodes reinsertion scheme outperforms the forced merging scheme and the deleted node reinsertion scheme in all experiments.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• 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.8 no.2 s.17
• /
• pp.53-73
• /
• 2006

Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.

• Journal of KIISE:Databases
• /
• v.27 no.4
• /
• pp.585-595
• /
• 2000

비디오 데이터에서 움직임 객체에 대한 움직임 경로는 내용-기반 검색을 위해 비디오 데이터를 색인하는 데 있어 매우 중요한 역할을 한다. 따라서, 본 논문에서는 비디오 데이터에서 움직임 객체의 움직임 경로를 모델링하기 위한 새로운 시공간 표현 기법을 제안한다. 비디오 데이터를 위한 보다 효율적인 내용-기반 검색을 위해, 제안하는 기법은 시간, 공간 관계성과 더불어 일정 시간 간격 동안 움직인 객체의 이동 거리(moving distance)를 고려한다. 아울러, 제안하는 표현 기법에 기반하여 단일 움직임 객체의 움직임 경로와 다수 움직임 객체들의 움직임 경로를 위한 새로운 유사성 측정 알고리즘을 제시하며, 이들 알고리즘은 검색 결과에 대해서 유사성에 준하여 순위(Ranking)를 부여할 수 있다. 마지막으로, 성능 평가를 통하여 제안된 시공간 표현 기법은 기조의 Li 방법과 Shan의 방법에 비해 동등한 재현율을 유지하며, 정확율 측면에서 약 20%의 성능 향상을 보인다.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.84-97
• /
• 2007

Selectivity estimation techniques in query optimization have been used in commercial databases and histograms are popularly used for the selectivity estimation. Recently, the techniques for spatio-temporal databases have been restricted to existing temporal and spatial databases. In addition, the selectivity estimation techniques focused on time-series data such as moving objects. It is also impossible to estimate selectivity for range queries with a time interval. Therefore, we construct two histograms, CMH (current multidimensional histogram) and PMH (past multidimensional histogram), to estimate the selectivity of multidimensional sequence data in spatio-temporal databases and propose effective selectivity estimation methods using the histograms. Furthermore, we solve a problem about the range query using our proposed histograms. We evaluated the effectiveness of histograms for range queries with a time interval through various experimental results.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.451-462
• /
• 2008

Recently, with the advent of applications using locations of moving objects, it becomes crucial to develop efficient index schemes for spatio-temporal databases. The $TPR^*$-tree is most popularly accepted as an index structure for processing future-time queries. In the $TPR^*$-tree, the future locations of moving objects are predicted based on the CBR(Conservative Bounding Rectangle). Since the areas predicted from CBRs tend to grow rapidly over time, CBRs thus enlarged lead to serious performance degradation in query processing. Against the problem, we propose a new method to adjust CBRs to be tight, thereby improving the performance of query processing. Our method examines whether the adjustment of a CBR is necessary when accessing a leaf node for processing a user query. Thus, it does not incur extra disk I/Os in this examination. Also, in order to make a correct decision, we devise a cost model that considers both the I/O overhead for the CBR adjustment and the performance gain in the future-time owing to the CBR adjustment. With the cost model, we can prevent unusual expansions of BRs even when updates on nodes are infrequent and also avoid unnecessary execution of the CBR adjustment. For performance evaluation, we conducted a variety of experiments. The results show that our method improves the performance of the original $TPR^*$-tree significantly.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.343-356
• /
• 2007

Due to advances in position monitoring technologies such as global positioning systems and sensor networks, recent position information of moving objects has the form of streaming data which are updated continuously and rapidly. In this paper we propose an efficient trajectory maintenance method that stores the streaming position data of moving objects in the limited size of storage space and estimates past positions based on the stored data. For this, we first propose a new concept of incremental extraction of position information. The incremental extraction means that, whenever a new position is added into the system, we incrementally re-compute the new version of past position data maintained in the system using the current version of past position data and the newly added position. Next, based on the incremental extraction, we present an overall framework that stores position information and estimates past positions in the stream environment. We then propose two polynomial-based methods, line-based and curve-based methods, as the method of estimating the past positions on the framework. We also propose three incremental extraction methods: equi-width, slope-based, and recent-emphasis extraction methods. Experimental results show that the proposed incremental extraction provides the relatively high accuracy (error rate is less than 3%) even though we maintain only a little portion (only 0.1%) of past position information. In particular, the curve-based incremental extraction provides very low error rate of 1.5% even storing 0.1% of total position data. These results indicate that our incremental extraction methods provide an efficient framework for storing the position information of moving objects and estimating the past positions in the stream environment.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.261-273
• /
• 2004

Advances in information and communication technologies have been creating new classes of applications in the area of databases. For example, in moving object databases, which track positions of a lot of objects, or stream databases, which process data streams from a lot of sensors, data Processed in such database systems are usually changed very rapidly and continuously. However, traditional database systems have a problem in processing these rapidly and continuously changing data because they suppose that a data item stored in the database remains constant until It is explicitly modified. The problem becomes more serious in the R-tree, which is a typical index structure for multidimensional data, because modifying data in the R-tree can generate cascading node splits or merges. To process frequent updates more efficiently, we propose a novel update technique for the R-tree, which we call the leaf-update technique. If a new value of a data item lies within the leaf MBR that the data item belongs, the leaf-update technique changes the leaf node only, not whole of the tree. Using this leaf-update manner and the leaf-access hash table for direct access to leaf nodes, the proposed technique can reduce update cost greatly. In addition, the leaf-update technique can be adopted in diverse variants of the R-tree and various applications that use the R-tree since it is based on the R-tree and it guarantees the correctness of the R-tree. In this paper, we prove the effectiveness of the leaf-update techniques theoretically and present experimental results that show that our technique outperforms traditional one.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1167-1176
• /
• 2004

Along the advent of Internet technology, the computing environment has been considerably changed in many application domains. Especially, a lot of researches for e-Logistics have been done for the last 3 years. The e-Logistics means the virtual business activity and service architecture among the logistics companies based on the Internet technology. To construct effectively the e-Logistics framework, researches on the development of the Moving Object Technology(MOT) including GPS and GIS with spatiotemporal databases technique so far has been done The Moving Object Technology stands for the efficient management for the spatiotemporal objects such as vehicles, airplanes, and vessels which change continuously their spatial location along with time flows. However, most systems manage just only the location information detected lately by many reasons so that the uncertainty processing for the past and future location of the moving objects is still very hard. In this paper, we propose the moving object uncertainty model and system design for e-Logistics applications. The MOMS architecture in e-Logistics is suggested and the detailed explain of sub-systems including the uncertainty processor of moving objects is described. We also explain the comprehensive examples of MOMS and uncertainty processing in Delivery Parcel Application that is one of major application of e-Logistics domain.