• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4908-4928
• /
• 2017

Recent research into wireless sensor network (WSN)-related technology that senses various data has recognized the need for spatio-temporal queries for searching necessary data from wireless sensor nodes. Answers to the queries are transmitted from sensor nodes, and for the efficient transmission of the sensed data to the application server, research on index processing methods that increase accuracy while reducing the energy consumption in the node and minimizing query delays has been conducted extensively. Previous research has emphasized the importance of accuracy and energy efficiency of the sensor node's routing process. In this study, we propose an itinerary-based R-tree (IR-tree) to solve the existing problems of spatial query processing methods such as efficient processing and expansion of the query to the spatio-temporal domain.

• KIEAE Journal
• /
• v.14 no.5
• /
• pp.49-57
• /
• 2014

This research is about analysis and evaluation of biodiversity of Suwon's street tree, then understanding the problem of it and finally finding a solution. Because the increasing damage of the street trees by disease and insects, insecticide is applied to prevent further damage. However, this insecticide is found to be cancer genic and causing hygienic threat to civilians. Therefore, by gathering Suwon's internal statistics about Suwon's street tree, the trees are divided into three categories, tall evergreen trees, deciduous trees, shrubs following Frank's 30-20-10 theory(1990). Also, according to species diversity index, the problem of disease and insect is researched in terms of biodiversity, and here we suggests solutions to counter such problems. According to the results, the trees planted in Suwon was found to be 31 families, 43 genus and 58 species. The most used kinds, almost 85% of the whole species, are found to be Rhododendron indicum (L.) Sweet, Buxus koreana Nakai ex Chung & al, Euonymus japonicus Thunb, Ligustrum obtusifolium Siebold & Zucc. Besides these, the rest of 15% of street trees had little variety. Therefore, it is necessary to plant tree variously and equally in terms of biodiversity. If this Frank's 10-20-30 solution is not enough to completely solve coulure problem, then further research will be done on soil properties, and local features for improvement of Suwon street tress.

• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.111-123
• /
• 2005

Many indexing methods were proposed so that process moving object efficiently. Among them, indexing methods like the 3D R-tree treat temporal and spatial domain as the same. Actually, however. both domain had better process separately because of difference in character and unit. Especially in this paper we deal with limited region such as indoor environment since spatial domain is limited but temporal domain is grown. In this paper we present a novel indexing structure, namely STS-tree(Separation of Time and Space tree). based on limited region. STS-tree is a hybrid tree structure which consists of R-tree and one-dimensional TB-tree. The R-tree component indexes static object and spatial information such as topography of the space. The TB-tree component indexes moving object and temporal information.

• Journal of Korean Society of Forest Science
• /
• v.105 no.3
• /
• pp.351-359
• /
• 2016

This study was conducted to analyze the effect of climate change on the tree-ring growth of Pinus koraiensis in Korea. Annual tree-ring growth data of P. koraiensis collected by the $5^{th}$ National Forest Inventory were first organized to analyze yearly growth patterns of the species. When tree-ring growth data were analyzed through cluster analysis based on similarity of climatic conditions, five clusters were identified. Yearly growing degree days and standard precipitation index based on daily mean temperature and precipitation data from 1951 to 2010 were calculated by cluster. Using the information, yearly temperature effect index(TEI) and precipitation effect index(PEI) by cluster were estimated to analyze the effect of climatic conditions on the growth of the species. Tree-ring growth estimation equations by cluster were developed by using the product of yearly TEI and PEI as independent variable. The tree-ring growth estimation equations were applied to the climate change scenarios of RCP 4.5 and RCP 8.5 for predicting the changes in tree-ring growth by cluster of P. koraiensis from 2011 to 2100. The results of this study are expected to provide valuable information necessary for estimating local growth characteristics of P. koraiensis and for predicting changes in tree-ring growth patterns caused by climate change.

• Journal of Forest and Environmental Science
• /
• v.15 no.1
• /
• pp.1-9
• /
• 1999

Noticing the intrinsic growing habit variations of hardwood species which is indigenous to the natural deciduous forest, eighteen tree species in overstory were selected for comparative evaluating tree form so as to develop the tree form index (TFI). Selected six tree form attributes were arbitrarily divided four assessment criteria and given appropriate scores. Eighteen tree species were undergone corresponding scores, converted to percentage base, and estimated TFI by the summation of the six scoring values. Cluster analysis was carried out to review which attribute would have been shared among species based on dissimilarity of scores for each pair of species in $18{\times}6$ data matrix. The result showed that Populus davidiana had the highest TFI value of 80.8 and Carpinus cordata had the lowest TFI va1ue of 46.3. The species which received more than 70 of TFI are Populus davidiana, Betula costata, Fraxinus mandshurica, and Ulmus davidiana var. japonica, characterized by the advantage of straight and longer bole, the narrower crown, and the thinner branch. On the contrary, such species as Sorbus alnifolia. Prunus sargentii, Acer mandshuricum, Juglans mandshurica, and Carpinus cordata received less than 60 of TFI, characterized by the disadvantage of the crooked or forked stem. the wider or deeper crown. and the thicker branch. In the dendrogram produced by cluster analysis, arbitrary value of Euclidean distance 10 divided eighteen species into four distinctive groups. and the typical characteristics of each group were discussed.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.453-463
• /
• 2002

With the prevalence of multi-dimensional data such as images, content-based retrieval of data is becoming increasingly important. To handle multi-dimensional data, multi-dimensional index structures such as the R-tree, Rr-tree, TV-tree, and MVP-tree have been proposed. Numerous research results on how to effectively manipulate these structures have been presented during the last decade. Query processing strategies, which is important for reducing the processing time, is one such area of research. In this paper, we propose query processing algorithms for R-tree based structures. The novel aspect of these algorithms is that they make use of the notion of VP filtering, a concept borrowed from the MVP-tree. The filtering notion allows for delaying of computational overhead until absolutely necessary. By so doing, we attain considerable performance benefits while paying insignificant overhead during the construction of the index structure. We implemented our algorithms and carried out experiments to demonstrate the capability and usefulness of our method. Both for range query and incremental query, for all dimensional index trees, the response time using VP filtering was always shorter than without VP filtering. We quantitatively showed that VP filtering is closely related with the response time of the query.

• 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.34 no.2
• /
• pp.109-118
• /
• 2007

Recently, flash memory is used to store data in mobile computing devices such as PDAs, SmartCards, mobile phones and MP3 players. These devices need index structures like the B-tree to efficiently support some operations like insertion, deletion and search. The BFTL(B-tree Flash Translation Layer) technique was first introduced which is for implementing the B-tree on flash memory. Flash memory has characteristics that a write operation is more costly than a read operation and an overwrite operation is impossible. Therefore, the BFTL method focuses on minimizing the number of write operations resulting from building the B-tree. However, we indicate in this paper that there are many rooms of improving the performance of the I/O cost in building the B-tree using this method and it is not practical since it increases highly the usage of the SRAM memory storage. In this paper, we propose a BOF(the B-tree On Flash memory) approach for implementing the B-tree on flash memory efficiently. The core of this approach is to store index units belonging to the same B-tree node to the same sector on flash memory in case of the replacement of the buffer used to build the B-tree. In this paper, we show that our BOF technique outperforms the BFTL or other techniques.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.771-772
• /
• 2009

최근 대표적인 공간 인덱스 구조인 R-tree를 기반으로 KD-tree나 Quad-tree와 같은 공간 분할 특성을 이용하여 인덱싱 성능을 향상시키기 위한 연구가 활발하다. 본 논문에서는 기존에 제시된 R-tree 기반 인덱스 구조인 SQR-tree와 PMR-tree의 특성을 결합하여 대용량 공간 데이타를 보다 효율적으로 처리하는 인덱스 구조인 MSQR-tree(Mapping-based SQR-tree)를 제시한다. SQR-tree는 Quad-tree를 확장한 SQ-tree와 각 SQ-tree 리프 노드마다 실제로 공간 객체를 저장하는 R-tree가 연계되어 있는 인덱스 구조이고, PMR-tree는 R-tree에 R-tree 리프 노드를 직접 접근할 수 있는 매핑 트리를 적용한 인덱스 구조이다. 본 논문에서 제시하는 MSQR-tree는 SQR-tree를 기본 구조로 가지고 R-tree마다 매핑 트리가 적용된 구조를 갖는다. 따라서, MSQR-tree에서는 SQR-tree와 같이 질의가 여러 R-tree에서 분산 처리되고, PMR-tree와 같이 매핑 트리를 통해 R-tree 리프 노드를 빠르게 접근할 수 있다. 마지막으로 성능 실험을 통해 MSQR-tree의 우수성을 입증하였다.

• Journal of Korean Society of Forest Science
• /
• v.85 no.3
• /
• pp.539-551
• /
• 1996

In this study, a number of distance-dependent competition indices on tree-level which incorporate the tree sizes and distances to competitors, and traditional stand-level density measures were estimated from the data compiled with position-dependent survey in a Pinus densiflora stand. The performance of the estimated competition indices was examined by comparing the relationship with the diameter growth, and a dbh growth function, in which the competition index is considered as a one of influence factors, are developed. In the searching method of competing trees, the competition index estimated with $30^{\circ}$ competition interrupting angle showed the highest correlation with the annual dbh growth, while the expanding the competing zone distance had no significant effect on the performance of competition index in estimating annual dbh growth. The most of the examined stand-level competition indices, based on distance-dependent single-tree competition indices, were evaluated to describe similarly the stand competition status. As a result of partial correlation analysis in which the effect of age and site index are eliminated, Alemdag's mean competition index and relative spacing index were determined to have the highest correlation with dbh. The relative spacing index, which can be easily measured in field without measuring the position of individual trees, was considered to be a better suited one for estimating mean dbh of a stand. Among distance-dependent competition indices on tree-level, Hegyi's competition index showed the best performance in their correlation with annual dbh growth, if eliminated the effect of site index and dbh. This enabled to derive the following annual dbh growth function of individual trees which incorporate age, dominant height, dbh and Hegyi's competition index as influence factors : $$dbh^{\prime}=3.975362676{\cdot}age^{-1.099274613}{\cdot}ho^{0.199893990}{\cdot}dbh^{0.269430865}{\cdot}HgCI^{-0.353643587}$$ This function is coincided to the growth principle in which site index has a positive effect on the annual dbh growth, while high age or competition causes to reduce the annual dbh growth, and can be used as a function in single tree growth model.