• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.364-370
• /
• 2014

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. Querying databases of such a content is very important for these applications. This paper addresses algorithms that make index structure by using Douglas-Peucker Algorithm and process range query efficiently on moving objects trajectories. We compare and analyze our algorithms and MBR by experiments. Our algorithms make smaller size of index structure and process more efficiently.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.418-421
• /
• 2014

Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.11
• /
• pp.7761-7772
• /
• 2015

This study describes the spatio-temporal distributions in phytoplankton community such as species composition, standing crops and dominant species from April to November 2008 in the Jeju Marine Ranching Area (JMRA). A total of 106 species of phytoplankton belonging to 63 genera was identified. In particular, diatoms and dinoflagellates were occupied more than 61% and 35% of total species, respectively. The annual dominant species were Skeletonema costatum-like species(ls) in April, Torodinium teredo, Cylindrotheca closterium, Scrippsiella trochoidea in June, S. costatum - ls, Thalassionema nitzschioides, Pseudo-nitzschia pungens, Ebria tripartita in September and Corethron pennatum, Dictyocha fibura, Neoceratium teres in November. Phytoplankton cell density ranged between $0.6cells{\cdot}mL^{-1}$ in June and $64.0cells{\cdot}mL^{-1}$ in April. It fluctuated with an annual mean of $11.7cells{\cdot}mL^{-1}$ between the lowest value of $0.9cells{\cdot}mL^{-1}$ in November and the highest value of $37.0cells{\cdot}mL^{-1}$ by S. costatum -ls in April. Diversity index in September was higher than diatom blooming seasons in April. According to the phytoplankton community structure, the biological oceanographic characteristics of the JMRA was characterized by nanoplankton during a year. That is, primary production is deemed to have a higher possibility of being adjusted by a reproduction by material cycle in the ecosystems than nutrients supply from the lands.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.1-18
• /
• 2008

Because we can usually get many information through analyzing trajectories of moving objects on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. Also, because FNR-tree and MON-tree store the segment unit of moving objects, they can't support the trajectory of whole moving objects. In this paper, we propose an efficient trajectory index structures based on signatures on a spatial network, named SigMO-Tree. For this, we divide moving object data into spatial and temporal attributes, and design an index structure which supports not only range query but trajectory query by preserving the whole trajectory of moving objects. In addition, we divide user queries into trajectory query based on spatio-temporal area and similar-tralectory query, and propose query processing algorithms to support them. The algorithm uses a signature file in order to retrieve candidate trajectories efficiently Finally, we show from our performance analysis that our trajectory index structure outperforms the existing index structures like FNR-Tree and MON-Tree.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2919-2925
• /
• 2014

Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.9-17
• /
• 2006

Moving objects database systems manage a set of moving objects which changes its locations and directions continuously. The traditional spatial indexing scheme is not suitable for the moving objects because it aimed to manage static spatial data. Because the location of moving object changes continuously, there is problem that expense that the existent spatial index structure reconstructs index dynamically is overladen. In this paper, we analyzed the insertion/deletion costs for processing the movement of objects. The results of our extensive experiments show that the Dynamic Hashing Index outperforms the original R-tree and the fixed grid typically by a big margin.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.664-674
• /
• 2004

The trajectory preservation property that stores only one trajectory in a leaf node is the most important feature of an index structure, such as the TB-tree for retrieving object's moving paths in the spatio-temporal space. It performs well in trajectory-related queries such as navigational queries and combined queries. But, the MBR of non-leaf nodes in the TB-tree have large amounts of dead space because trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. As dead space increases, the overlap between nodes also increases, and, thus, the classical range query cost increases. We present a new split policy and entry relocation policies, which have no deterioration of the performance for trajectory-related queries, for improving the performance of range queries. To maximally reduce the dead space of a non-leaf node's MBR, the Maximal Area Reduction (MAR) policy is used as a split policy for non-leaf nodes. The entry relocation policy induces entries in non-leaf nodes to exchange each other for the purpose of reducing dead spaces in these nodes. We propose two algorithms for the entry relocation policy, and evaluate the performance studies of new algorithms comparing to the TB-tree under a varying set of spatio-temporal queries.

• 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 Ecology and Environment
• /
• v.39 no.1
• /
• pp.31-42
• /
• 2016

The object of this study was to determine long-term temporal and spatial patterns of nutrients (nitrogen and phosphorus), suspended solids, and chlorophyll (Chl) in Chungju Reservoir, based on the dataset of 1992 - 2013, and then to develop the empirical models of nutrient-Chl for predicting the eutrophication of the reservoir. Concentrations of total nitrogen (TN) and total phosphorus (TP) were largely affected by an intensity of Asian monsoon and the longitudinal structure of riverine (Rz), transition (Tz), and lacustrine zone (Lz). This system was nitrogen-rich system and phosphorus contents in the water were relatively low, implying a P-limiting system. Regression analysis for empirical model, however, showed that Chl had a weak linear relation with TP or TN, and this was mainly associated with turbid, and nutrient-rich inflows in the system. The weak relation was associated with non-algal light attenuation coefficients (Kna), which is inversely related water residence time. Thus, values of Chl had negative functional relation (R² = 0.25, p < 0.001) with nonalgal light attenuation. Thus, the low chlorophyll at a given TP indicated a light-limiting for phytoplankton growth and total suspended solids (TSS) was highly correlated (R² = 0.94, p < 0.001) with non-algal light attenuation. The relations of Trophic State Index (TSI) indicated that phosphorus limitation was weak [TSI (Chl) - TSI (TP) < 0; TSI (SD) - TSI (Chl) > 0] and the effects of zooplankton grazing were also minor [TSI (Chl) - TSI (TP) > 0; TSI (SD) - TSI (Chl) > 0].

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1250-1256
• /
• 2004

The movement of continuously changing positions should be stored and indexed for querying current and past positions. A simple extension of the original R-tree to add time as another dimension, called 3D R-tree, does not handle current position queries and does not address the problem of low space utilization due to high overlap of index nodes. In this paper, 1 propose the dynamic splitting policy for improving the 3D R-tree in order to improve space utilization of split nodes. 1 also extend the original 3D R-tree by introducing a new tagged index structure for being able to query the current and past positions of moving objects. 1 found out that my extension of the original R-tree, called the tagged dynamic 3DR-tree, outperforms both the 3D R-tree and 75-tree when querying current and past position.