• Journal of Korean Society on Water Environment
• /
• v.35 no.6
• /
• pp.539-549
• /
• 2019

In 2016, Benthic Macroinvertebrates Streambed Index (BMSI) was proposed as an index to evaluate streams as benthic macroinvertebrate depending on the substrate type of streambed. However, orignal BMSI were selected without consideration of water quality. Analyzes without water quality do not constitute biological indices based solely on the substrate type of streambed. Therefore, in this study, the indicator value was improvement in consideration of water quality, and the distribution characteristics of benthic macroinvertebrates according to the substrate type of streambed were analyzed under relatively equal water quality conditions. We surveyed 20,155 sampling units in Korea from 2008 to 2018, and we re-estimated each lithophility of 191 taxa. As a result of estimating the streambed of each newly lithophilic value classification group considering the water quality, it was different from the original lithophilic value. Representative integer lithophilic values were newly calculated from 126 taxa among the 191 index taxa used in the analysis. The correlation between new constructed BMSI and community structure was compared and analyzed. It showed extreamely significance (p<0.001) in the dominance index, diversity index, abundance index, and evenness index of the community structure. Diversity index, abundance index, and evenness index showed positive correlation, and dominance index showed negative correlation. The correlation coefficient (r) was the highest in the richness index of about 0.664.

• International Journal of Internet, Broadcasting and Communication
• /
• v.5 no.1
• /
• pp.14-17
• /
• 2013

RDF data is widely used for exchanging data nowadays to enable semantic web era. This leads to the need for storing and retrieving these data efficiently and effectively. Recently, the structure index in graph-based perspective is considered as a promising approach to deal with issues of complex query graphs. However, even though there are many researches based on structure indexing, there can be a better architectural approach instead of addressing the issue as a part. In this research, we propose architecture for storing, query processing and retrieving RDF data in efficient manner using structure indexing. Our research utilizes research results from iStore and 2 relation-based approaches and we focus on improving query processing to reduce the time of loading data and I/O cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1807-1824
• /
• 2015

As the technologies advance, mobile peer-to-peer (MP2P) networks or systems become one of the major ways to share resources and information. On such a system, the information retrieval (IR), including the development of scalable infrastructures for indexing, becomes more complicated due to a huge increase on the amount of information and rapid information change. To keep the systems on MP2P networks more reliable and consistent, the index structures need to be updated frequently. For a semantic IR system, the index structure is even more complicated than a classic IR system and generally has higher update cost. The most well-known indexing technique used in semantic IR systems is Latent Semantic Indexing (LSI), of which the index structure is generated by singular value decomposition (SVD). Although LSI performs well, updating the index structure is not easy and time consuming. In an MP2P environment, which is fully distributed and dynamic, the update becomes more challenging. In this work, we consider how to update the sematic index generated by LSI and keep the index consistent in the whole MP2P network. The proposed Concept Space Update (CSU) protocol, based on distributed 2-Phase locking strategy, can effectively achieve the objectives in terms of two measurements: coverage speed and update cost. Using the proposed effective synchronization mechanism with the efficient updates on the SVD, re-computing the whole index on the P2P overlay can be avoided and the consistency can be achieved. Simulated experiments are also performed to validate our analysis on the proposed CSU protocol. The experimental results indicate that CSU is effective on updating the concept space with LSI/SVD index structure in MP2P semantic IR systems.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.753-768
• /
• 2003

In this paper, we propose a multi-dimensional index structure, tailed a VA(Vector Approximate)-tree that is constructed with vector approximates of multi-dimensional feature vectors. To save storage space for index structures, the VA-tree employs vector approximation concepts of VA-file that presents feature vectors with much smaller number of bits than original value. Since the VA-tree is a tree structure, it does not suffer from performance degradation owing to the increase of data. Also, even though the VA-tree is MBR(Minimum Bounding Region) based tree structure like a R-tree, its split algorithm never allows overlap between MBRs. We show through various experiments that our proposed VA-tree is a suitable index structure for large amount of multi-dimensional data.

• Journal of Navigation and Port Research
• /
• v.36 no.3
• /
• pp.163-168
• /
• 2012

Recently, people's desire for the waterfront space has been increasing, and more people want to spend their leisure time close to the water. This paper proposes a damage detection technique using the static strain for the floating structure. An existing damage index, in which the modal strain energy was utilized to identify possible location of damage, is expanded to apply the static strain. The new damage index is expressed in terms of the static strains of undamaged and damaged structures. After calculating damage index, the possible damage locations in the structure are determined by the pattern recognition technique. The accuracy and feasibility of the proposed method is demonstrated by using experimental strain data from a scale model of floating structure.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.54-62
• /
• 2010

Inverted index structures have become the most efficient data structure for high performance indexing of large text collections, especially online index maintenance, In-Place and merge-based index structures are the two main competing strategies for index construction in dynamic search environments. In the above-mentioned two strategies, a contiguity of posting information is the mainstay of design for online index maintenance and query time. Whereas with the emergence of new storage device(SSD, SCRAM), those do not consider a contiguity of posting information in the design of index structures because of its superiority such as low access latency and I/O throughput speeds. However, SSD(Solid State Drive) is not well suited for traditional inverted structures due to the poor random write throughput in practical systems. In this paper, we propose the new efficient online index structure(SPM) for SSD that significantly reduces the query time and improves the index maintenance performance.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.58-71
• /
• 2002

Generally, multi-dimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amount of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel high-dimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-n$\times$mD(disk) architecture which is the hybrid type of nP-nD and lP-nD. Its node structure increases fan-out and reduces the height of a index tree. Also, A range search algorithm that maximizes I/O parallelism is devised, and it is applied to K-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.

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

Location-Based Services(LBS) give rise to location-dependent queries of which results depend on the positions of moving objects. Because positions of moving objects change continuously, indexes of moving object must perform update operations frequently for keeping the changed position information. Existing spatial index (Grid File, R-Tree, KDB-tree etc.) proposed as index structure to search static data effectively. There are not suitable for index technique of moving object database that position data is changed continuously. In this paper, I propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. The results of my extensive experiments show the dynamic hashing index outperforms the $R^$ $R^*$-tree and the fixed grid.

• Journal of Korea Multimedia Society
• /
• v.17 no.10
• /
• pp.1182-1188
• /
• 2014

Recently, the research on database outsourcing has been actively done with the popularity of cloud computing. However, because users' data may contain sensitive personal information, such as health, financial and location information, the data encryption methods have attracted much interest. Existing data encryption schemes process a query without decrypting the encrypted databases in order to support user privacy protection. On the other hand, to efficiently handle the large amount of data in cloud computing, it is necessary to study the distributed index structure. However, existing index structure and query processing algorithms have a limitation that they only consider single-column query processing. In this paper, we propose a grid-based multi column indexing scheme and an encrypted query processing algorithm. In order to support multi-column query processing, the multi-dimensional index keys are generated by using a space decomposition method, i.e. grid index. To support encrypted query processing over encrypted data, we adopt the Hilbert curve when generating a index key. Finally, we prove that the proposed scheme is more efficient than existing scheme for processing the exact and range query.

• Journal of Distribution Science
• /
• v.12 no.3
• /
• pp.25-32
• /
• 2014

Purpose - This study reviews changes in the steel export-import structure between Korea and Japan using a trade related index; it focuses on analyzing comparative advantage based on time-series analysis statistics data using the trade intensity index (TII), revealed comparative advantage index (RCA), and trade specialization index (TSI). Research design, data, and methodology - In terms of their economic phase, Korea and Japan have a mutually complementary character. Therefore, this study aims to understand each country's trade structure to strengthen Korea-Japan economic cooperation, examine trade drawbacks, analyze factors that affect trade, and identify ways to improve and expand trade. Results - The results indicate immense potential for mutual cooperation and complementariness, which will yield guaranteed adequate profits comparable to those of any regional economic integrated community. Conclusion - From our viewpoint, Northeast economic cooperation can facilitate industry technological cooperation with Japanese partners in the prevailing environment that is characterized by increasing competition among industries and the need to secure stable resource supplies as well as the expansion of the export market and diversification, which can have significant positive implications.