• Proceedings of the Korea Database Society Conference
• /
• 1997.10a
• /
• pp.472-482
• /
• 1997

Multi-dimensional data play a crucial role in various fields, as like computer graphics, geographical information system, and multimedia applications. Indexing method fur multi-dimensional data Is a very Important factor in overall system performance. What is proposed in this paper is a new dynamic access method for spatial objects called HL-CIF(Hierarchically Layered Caltech Intermediate Form) tree which requires small amount of storage space and facilitates efficient query processing. HL-CIF tree is a combination of hierarchical management of spatial objects and CIF tree in which spatial objects and sub-regions are associated with representative points. HL-CIF tree adopts "centroid" of spatial objects as the representative point. By reflecting objects′sizes and positions in its structure, HL-CIF tree guarantees the high spatial locality of objects grouped in a sub-region rendering query processing more efficient.

• Proceedings of the Korea Society for Energy Engineering kosee Conference
• /
• 1998.10a
• /
• pp.64-68
• /
• 1998

This paper discusses the potential application of fuzzy set theory to the decision-making in the area of radioactive waste management. the approach proposed in this study is based on the concepts of fuzzy set theory and the hierarchical structure analysis. The linguistic variables and fuzzy numbers are used to aggregate the decision maker's subjective assessments of the decision criteria and of the decision alternatives with respect to these criteria. For each alternative, the fuzzy appropriateness index is evaluated to obtain the final score. Using total integral value method, one of methods for ranking fuzzy numbers, the fuzzy appropriateness indices are ranked. As a case problem, selection of the most suitable option for spent fuel storage is illustrated.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.903-917
• /
• 1995

In most database systems images have been indexed indirectly using related texts such as captions, annotations and image attributes. But there has been an increasing requirement for the image database system supporting the storage and retrieval of images directly by content using the information contained in the images. There has been a few indexing methods based on contents. Among them, Pertains proposed an image indexing method considering spatial relationships and properties of objects forming the images. This is the expansion of the other studies based on '2-D string. But this method needs too much storage space and lacks flexibility. In this paper, we propose a more flexible index structure based on kd-tree using paging techniques. We show an example of extracting keys using normalization from the from the raw image. Simulation results show that our method improves in flexibility and needs much less storage space.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.1
• /
• pp.37-46
• /
• 2010

A Suffix Tree is an efficient data structure that exposes the internal structure of a string and allows efficient solutions to a wide range of complex string problems, in particular, in the area of computational biology. However, as the biological information explodes, it is impossible to construct the suffix trees in main memory. We should find an efficient technique to construct the trees in a secondary storage. In this paper, we present a method for constructing a suffix tree in a disk for large set of DNA strings using new index scheme. We also show a typical application example with a suffix tree in the disk.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.1-11
• /
• 2015

Recently, NAND flash memories are used for storage devices because of fast access speed and low-power. However, applications of FTL on low power computing devices lead to heavy workloads which result in a memory requirement and an implementation overhead. Consequently, studies of B+-Tree on embedded devices without the FTL have been proposed. The studies of B+-Tree are optimized for performance of inserting and updating records, considering to disadvantages of the NAND flash memory that it can not support in-place update. However, if a general garbage collection method is applied to the previous studies of B+-Tree, a performance of the B+-Tree is reduced, because it generates a rearrangement of the B+-Tree by changing of page positions on the NAND flash memory. Therefor, we propose a novel garbage collection method which can apply to the B+-Tree based on the NAND flash memory without the FTL. The proposed garbage collection method does not generate a rearrangement of the B+-Tree by using a block information table and a proxy block. We implemented the B+-Tree and ${\mu}$-Tree with the proposed garbage collection on physical devices with the NAND flash memory. In experiment results, the proposed garbage collection scheme compared to greedy algorithm garbage collection scheme increased the number of inserted keys by up to about 73% on B+-Tree and decreased elapsed time of garbage collection by up to about 39% on ${\mu}$-Tree.

• Journal of Internet Computing and Services
• /
• v.6 no.4
• /
• pp.59-73
• /
• 2005

Caching query results and reusing them in processing of subsequent queries is an important query optimization technique. Materialized view and view indexing are the representative examples of such a technique. The two schemes had received much attention for relational databases, and have been investigated for XML data since XML emerged as the standard for data exchange on the Web. In XML view indexing, XML view xv which is the result of an XML query is represented as an XML view index(XVI), a structure containing the identifiers of xv's underlying XML elements as well as the information on xv. Since XVI for xv stores just the identifiers of the XML elements not the elements themselves, when xv is requested, its XVI should be materialized against xv's underlying XML documents. In this paper, we address the problem of integrating an XML view index management system with an RDBMS based XML storage system. The proposed system was implemented in Java on Windows 2000 Server with each of two different commercial RDBMSs, and used in evaluating performance improvement through XML view indexing as well as its overheads. The experimental results revealed that XML view indexing was very effective with an RDBMS based XML storage system while its overhead was negligible.

• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.663-672
• /
• 2005

This Paper Proposes an approach that removes the redundancy of Path information and uses an inverted index, as an efficient way to store a large volume of XML documents and to retrieve wanted information from there. An XML document is decomposed into nodes based on its tree structure, and stored in relational tables according to the node type, with path information from the root to each node. The existing methods using path information store data for all element paths, which cause retrieval performance to be decreased with increased data volume. Our approach stores only data for leaf element path excluding internal element paths. As the inverted index is made by the leaf element path only, the number of posting lists by key words become smaller than those of the existing methods. For the storage and retrieval of U data, our approach doesn't require the XML schema information of XML documents and any extension of relational database. We demonstrate the better performance of on approach than the existing approaches within the scope of our experiment.

• The Journal of Society for e-Business Studies
• /
• v.18 no.2
• /
• pp.153-173
• /
• 2013

The ontology has been gaining increasing interests by recent arise of the semantic web and related technologies. The focus is mostly on inference query processing that requires high-level techniques for storage and searching ontologies efficiently, and it has been actively studied in the area of semantic-based searching. W3C's recommendation is to use RDFS and OWL for representing ontologies. However memory-based editors, inference engines, and triple storages all store ontology as a simple set of triplets. Naturally the performance is limited, especially when a large-scale ontology needs to be processed. A variety of researches on proposing algorithms for efficient inference query processing has been conducted, and many of them are based on using proven relational database technology. However, none of them had been successful in obtaining the complete set of inference results which reflects the five characteristics of the ontology properties. In this paper, we propose a new index structure called hyper cube index to efficiently process inference queries. Our approach is based on an intuition that an index can speed up the query processing when extensive inferencing is required.

• Journal of the Korea Concrete Institute
• /
• v.23 no.6
• /
• pp.773-780
• /
• 2011

In this study, thermal stress analysis are carried out considering material properties, curing condition, ambient temperature, and casting date of the mass concrete placed in bottom slab and side wall of the in-ground type LNG tank as a super massive structure. Also, based on the numerical results, cracking possibility is predicted and counter measures to prevent the cracking are proposed. For the tasks, two optimum mix proportions were selected. From the results of the thermal stress analysis, the through crack index of 1.2 was satisfied for separately caste concrete lots except for the bottom slab caste in 2 separate sequences. For the double caste bottom slab, it is necessary introduce counter measures such as pre-cooling prior to the site construction. Also, another crack preventive measure is to lower the initial casting temperature by $25^{\circ}C$ or less to satisfy 1.2 through crack index criterion. In the $1^{st}$ and $2^{nd}$ caste bottom slab, the surface crack index was over 1.2. Therefore, the surface cracks can be controlled by implementing the curing conditions proposed in this study. Since the side wall's surface crack index was over 1.0, it is safe to assume that the counter preventive measures can control width and number of cracks.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.7
• /
• pp.592-600
• /
• 2007

Nowadays, researches for replacing material systems for cryotanks by composites have been being performed for the purpose of lightweight launch vehicle. In this paper, a type 3 propellant tank, which is composed of the composite developed for cryogenic use and an aluminum liner, was fabricated and tested considering actual operating environment, that is, cryogenic temperature and pressure. For this aim, liquid nitrogen (LN2) was injected into the fabricated tank and in turn, gaseous nitrogen (GN2) was used for pressurization. During this test procedure, strains and temperatures on the tank surface were measured. The delamination between hoop layer and helical one, was detected during the experiment. Several attempts were followed to investigate the cause analytically and experimentally. Thermo-elastic analysis in consideration of the progressive failure was done to evaluate the failure index. Experimental approach through a LN2 immersion test of composite/aluminum ring specimens suitable for simulating the Type 3 tank structure.