• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.31-43
• /
• 2007

Sensor data have the characteristics such as numerous and continuous data. Therefore, it is required to develop an index which could retrieve a specific sensor data efficiently from numerous sensed data. The index should have an efficient delete operation for the past data to support the data archiving. In this paper, we have proposed and implemented an index splitting technique to support the sensor data archiving. These splitted indexes compose of a virtual index (that is, index management component), which is shown as single tree from outside. Experimental results show that in the case of 100,000 insert operations the splitted index performs 8% better than the traditional TB-tree maximumly. And the splitted index outperforms TB-tree with retrieving queries when the region of query is small and the size of time domain is large.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.23 no.1
• /
• pp.109-117
• /
• 2011

It was calculated using empirical formulas for the weight of Tetrapod, which was a representative armor unit in the rubble mound breakwater in Korea. As the formulas were evaluated from a curve-fitting with the result of hydraulic test, the uncertainty of experimental error was included. Therefore, the neural network and M5' model tree were used to minimize the uncertainty and predicted the stability number of armor block. The index of agreement between the predicted and measured stability number was calculated to assess the degree of uncertainty for each model. While the neural network with the highest index of agreement have an excellent prediction capability, a significant disadvantage exists that general designers can not easily handle the method. However, although M5' model tree has a lower prediction capability than the neural network, the model tree is easily used by the designers because it has a good prediction capability compared with the existing empirical formula and can be used to propose the formulas like an empirical formula.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.396-408
• /
• 2006

Moving object databases manage a large amount of past location data which are accumulated as the time goes. To retrieve fast the past location of moving objects, we need index structures which consider features of moving objects. The KDB-tree has a good performance in processing range queries. Although we use the KDB-tree as an index structure for moving object databases, there has an over-split problem in the spatial domain since the feature of moving object databases is to increase the time domain. Because the over-split problem reduces spatial regions in the MBR of nodes inverse proportion to the number of splits, there has a problem that the cost for processing spatial-temporal range queries is increased. In this paper, we propose the dynamic split strategy of the KDB-tree to process efficiently the spatial-temporal range queries. The dynamic split strategy uses the space priority splitting method for choosing the split domain, the recent time splitting policy for splitting a point page to maximize the space utilization, and the last division policy for splitting a region page. We compare the performance of proposed dynamic split strategy with the 3DR-tree, the MV3R-tree, and the KDB-tree. In our performance study for range queries, the number of node access in the MKDB-tree is average 30% less than compared index structures.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.1
• /
• pp.39-46
• /
• 2011

The present study introduces a comparison between 3D R-tree and octree which are noticeable candidates to index large point clouds gathered from a 3D terrestrial laser scanner. A query method, which is to find neighboring points within given distances, was devised for the comparison, and time lapses for the query along with memory usages were checked. From tests conducted on point clouds scanned from a building and a stone pagoda, it was shown that octree has the advantage of fast generation and query while 3D R-tree is more memory-efficient. Both index and leaf capacity were revealed to be ruling factors to get the best performance of 3D R-tree, while the number of level was of oetree.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.11-22
• /
• 2004

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. Consequently, reducing cache misses emerges as the most important issue in current main memory databases, in which CPU speeds have been increasing at 60% per year, compared to the memory speeds at 10% per you. In this paper, we design and implement a main-memory database system for real-time mobile GIS. Our system is composed of 5 modules： the interface manager provides the interface for PDA users； the memory data manager controls spatial and non-spatial data in main-memory using virtual memory techniques； the query manager processes spatial and non-spatial query : the index manager manages the MR-tree index for spatial data and the T-tree index for non-spatial index : the GIS server interface provides the interface with disk-based GIS. The MR-tree proposed propagates node splits upward only if one of the internal nodes on the insertion path has empty space. Thus, the internal nodes of the MR-tree are almost 100% full. Our experimental study shows that the two-dimensional MR-tree performs search up to 2.4 times faster than the ordinary R-tree. To use virtual memory techniques, the memory data manager uses page tables for spatial data, non- spatial data, T-tree and MR-tree. And, it uses indirect addressing techniques for fast reloading from disk.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.119-131
• /
• 2009

During a decade, e-Commerce environments supporting real-time transaction processing have been getting larger. In telecommunication and financial environments, research and building for main memory database systems have been doing to support real-time transaction processing. A research on indexing for fast transaction support focuses on reducing cache misses or reducing memory access latency when cache misses happen. In the paper, we propose a prefetch method for tree index structures to reduce memory access latency. We present a prefetch-efficient pCST-tree and show superiority of the proposed tree by experiments.

• 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 Korean Society of Environmental Restoration Technology
• /
• v.23 no.5
• /
• pp.29-43
• /
• 2020

Thermal environment of city is getting worse due to severe urban heat island caused by climate change and urbanization. The cooling effect of street tree is regarded as a effective way to ameliorate the urban heat environment. The effect is largely made up of shadow formation and transpiration. This study aims to identify how the transpiration affects the discomfort index by analyzing comprehensive impact of the transpiration on the air temperature and relative humidity. The changes in the amount of transpiration, air temperature, and relative humidity were estimated for Seogyo-dong area which has a lot of floating population in Seoul, at 2 p.m. in dry day in July and August. On average, the transpiration of the street tree decreased the temperature 0.3℃ and increased the relative humidity 2.6% in an hour. As a result of these changes in temperature and humidity, the discomfort index rose mostly(0.036 on average). It was always get rise especially on the day when the discomfort index was above 80(0.05 on average). However, compared with the significant change in temperature and humidity, the variation of the discomfort index itself was very slight(up to 0.107). Therefore, the effect of transpiration by the street trees might not be effective in the planning to improve the thermal environment(especially on the day when the discomfort index is high). It is necessary to select the species of trees and planting location considering the cooling effect of shade formation synthetically.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.6
• /
• pp.1696-1704
• /
• 2008

The conventional hard disk has been the dominant database storage system for over 25 years. Recently, hybrid systems which incorporate the advantages of flash memory into the conventional hard disks are considered to be the next dominant storage systems. Their features are satisfying the requirements like enhanced data I/O, energy consumption and reduced boot time, and they are sufficient to hybrid storage systems as major database storages. However, we need to improve traditional index management schemes based on B-Tree due to the relatively slow characteristics of hard disk operations, as compared to flashmemory. In order to achieve this goal, we propose a new index management scheme called FNC-Tree. FNC-Tree-based index management enhanced search and update performance by caching data objects in unused free area of flash leaf nodes to reduce slow hard disk I/Os in index access processes. Based on the results of the performance evaluation, we conclude that our scheme outperforms the traditional index management schemes.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.145-153
• /
• 2013

Multimedia contents' searching methods in existing mobile computer environment tend to be brought with many over heads when attempting to search data in large bulks. The MINT system has been studied to resolve such problem. However, MINT system delivers many over heads by searching multimedia contents through applying B-Tree. The suggested method is said to be CST-MCR searching system based on CST-Tree. The specific characteristic of this method is improved MINT system by applying CST-Tree's index. The result of capacity evaluation came out with improved capacity of 4.27% from MINT system and CST-MCR methods in average. Conclusively, it has been proven that the suggested method is superior.