• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.247-258
• /
• 2004

Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1270-1281
• /
• 1999

피라미드 기법 1 은 d-차원의 공간을 2d개의 피라미드들로 분할하는 특별한 공간 분할 방식을 이용하여 고차원 데이타를 효율적으로 색인할 수 있는 새로운 색인 방법으로 제안되었다. 피라미드 기법은 고차원 사각형 형태의 영역 질의에는 효율적이나, 유사성 검색에 많이 사용되는 고차원 구형태의 영역 질의에는 비효율적인 면이 존재한다. 본 논문에서는 고차원 데이타를 많이 사용하는 유사성 검색에 효율적인 새로운 색인 기법으로 구형 피라미드 기법을 제안한다. 구형 피라미드 기법은 먼저 d-차원의 공간을 2d개의 구형 피라미드로 분할하고, 각 단일 구형 피라미드를 다시 구형태의 조각으로 분할하는 특별한 공간 분할 방법에 기반하고 있다. 이러한 공간 분할 방식은 피라미드 기법과 마찬가지로 d-차원 공간을 1-차원 공간으로 변환할 수 있다. 따라서, 변환된 1-차원 데이타를 다루기 위하여 B+-트리를 사용할 수 있다. 본 논문에서는 이렇게 분할된 공간에서 고차원 구형태의 영역 질의를 효율적으로 처리할 수 있는 알고리즘을 제안한다. 마지막으로, 인위적 데이타와 실제 데이타를 사용한 다양한 실험을 통하여 구형 피라미드 기법이 구형태의 영역 질의를 처리하는데 있어서 기존의 피라미드 기법보다 효율적임을 보인다.Abstract The Pyramid-Technique 1 was proposed as a new indexing method for high- dimensional data spaces using a special partitioning strategy that divides d-dimensional space into 2d pyramids. It is efficient for hypercube range query, but is not efficient for hypersphere range query which is frequently used in similarity search. In this paper, we propose the Spherical Pyramid-Technique, an efficient indexing method for similarity search in high-dimensional space. The Spherical Pyramid-Technique is based on a special partitioning strategy, which is to divide the d-dimensional data space first into 2d spherical pyramids, and then cut the single spherical pyramid into several spherical slices. This partition provides a transformation of d-dimensional space into 1-dimensional space as the Pyramid-Technique does. Thus, we are able to use a B+-tree to manage the transformed 1-dimensional data. We also propose the algorithm of processing hypersphere range query on the space partitioned by this partitioning strategy. Finally, we show that the Spherical Pyramid-Technique clearly outperforms the Pyramid-Technique in processing hypersphere range queries through various experiments using synthetic and real data.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2298-2309
• /
• 2000

This paper proposes the multidimensioa! nested attribute indexing techniques (MD- NAI) in object-oriented databases using a multidimensional index structure. Since most conventional indexing techniques for object oriented databases use a one-dimensional index stnlcture such as the B-tree, they do not often handle complex qUlTies involving both nested attributes and class hierarchies. We extend a tunable two dimensional class hierachy indexing technique(2D-CHI) for nested attributes. The 2D-CHI is an indexing scheme that deals with the problem of clustering ohjects in a two dimensional domain space that consists of a kev attribute dOI11'lin and a class idmtifier domain for a simple attribute in a class hierachy. In our extended scheme, we construct indexes using multidimensional file organizations that include one class identifier domain per class hierarchy on a path expression that defines the indexed nested attribute. This scheme efficiently suppoI1s queries that involve search conditions on the nested attribute represcnted by an extcnded path expression. An extended path expression is a one in which a class hierarchy can be substituted by an indivisual class or a subclass hierarchy in the class hierarchy.

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

Because existing information retrieval systems, in particular library retrieval systems, use 'exact keyword matching' with user's query, they present user with massive results including irrelevant information. So, a user spends extra effort and time to get the relevant information from the results. Thus, this paper will propose SULRM a Retrieval Model using Subject Classification Table, User profile, and LSI(Latent Semantic Indexing), to provide more relevant results. SULRM uses document filtering technique for classified data and document ranking technique for non-classified data in the results of keyword-based retrieval. Filtering technique uses Subject Classification Table, and ranking technique uses user profile and LSI. And, we have performed experiments on the performance of filtering technique, user profile updating method, and document ranking technique using the results of information retrieval system of our university' digital library system. In case that many documents are retrieved proposed techniques are able to provide user with filtered data and ranked data according to user's subject and preference.

• The Journal of Korean Academy of Prosthodontics
• /
• v.38 no.2
• /
• pp.200-213
• /
• 2000

Lasers have given dentistry a new rapid, economic, and accurate technique for metal joining. Although laser welding has been recommended as an accurate technique, there are some limitations with this technique. For example, the two joining surfaces must have a tight-fitting contact, which may be difficult to achieve in some situations. The tensile samples used for this study were made from a custom-made pure titanium and type III gold alloy plates. 27 of 33 specimens were sectioned perpendicular to their long axis with a carborundum disk and water coolant. Six specimens remained and served as the control group. A group of 6 specimens was posed as butt joints in custom parallel positioning device with a feeler gauge at each of three gaps : 0.00, 0.25. and 0.50mm. All specimens were then machined to produce a uniform cross-sectional dimension, none of the specimens was subjected to any subsequent form of heat treatment. Scanning electron microscopy was performed on representative tested specimens at fractured surfaces in both the parent metal and the weld. Vickers hardness was measured at the center of the welds with a micropenetrometer using a force of 300gm for 15 seconds. Measurement was made at approximately $200{\mu}m\;and\;500{\mu}m$ deep from each surface. One-way analysis of variance (ANOVA) and Scheffe's test was calculated to detect differences between groups. The purpose of this study is to compare the strength and properties of the joint achieved at various butt Joint gaps by the laser welding of type III gold alloy and pure titanium tensile specimens in an argon atmosphere. The results of this study were as follows : 1. When indexing and welding pure titanium, there was no decrease in ultimate tensile strength as compared with the unsectioned alloys for indexing gaps of 0.00 to 0.50mm, although with increasing gap size may come increased distortion (p>0.05). 2. When indexing and welding type III gold alloy, there were significant differences in ultimate tensile strength among groups with weld gaps of 0.00mm, 0.25 and 0.50mm, and the control group. Group with butt contact without weld gap demonstrated a significant higher ultimate tensile strength than groups with weld gaps of 0.25 and 0.50mm (p<0.05). 3. When indexing and welding the different metal combination of type III gold alloy and pure titanium, there were significant differences in ultimate tensile strength between groups with weld gaps of 0.00, 0.25, and 0.50mm. However, the mechanical properties of the welded joint would become too brittle to be acceptable clinically (p<0.05). 4. The presence of large pores in the laser welded joint appears to be the most important factor in controlling the tensile strength of the weld in both pure titanium and type III gold alloy.

• The Journal of the Korea Contents Association
• /
• v.20 no.8
• /
• pp.42-53
• /
• 2020

With the development of social network services, graph structures have been utilized to represent relationships among objects in various applications. Recently, a demand of subgraph matching in real-time graph streams has been increased. Therefore, an efficient approximate Top-k subgraph matching scheme for low latency in real-time graph streams is required. In this paper, we propose an approximate Top-k subgraph matching scheme considering data reuse in graph stream environments. The proposed scheme utilizes the distributed stream processing platform, called Storm to handle a large amount of stream data. We also utilize an existing data reuse scheme to decrease stream processing costs. We propose a distance based summary indexing technique to generate Top-k subgraph matching results. The proposed summary indexing technique costs very low since it only stores distances among vertices that are selected in advance. Finally, we provide k subgraph matching results to users by performing an approximate Top-k matching on the summary indexing. In order to show the superiority of the proposed scheme, we conduct various performance evaluations in diverse real world datasets.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.610-617
• /
• 2003

Similarity matching in video database is of growing importance in many new applications such as video clustering and digital video libraries. In order to provide efficient access to relevant data in large databases, there have been many research efforts in video indexing with diverse spatial and temporal features. however, most of the previous works relied on sequential matching methods or memory-based inverted file techniques, thus making them unsuitable for a large volume of video databases. In order to resolve this problem, this paper proposes an effective and scalable indexing technique using a trie, originally proposed for string matching, as an index structure. For building an index, we convert each frame into a symbol sequence using a window order heuristic and build a disk-resident trie from a set of symbol sequences. For query processing, we perform a depth-first search on the trie and execute a temporal segmentation. To verify the superiority of our approach, we perform several experiments with real and synthetic data sets. The results reveal that our approach consistently outperforms the sequential scan method, and the performance gain is maintained even with a large volume of video databases.

• The Plant Pathology Journal
• /
• v.23 no.4
• /
• pp.260-265
• /
• 2007

Testing a large number of samples from field monitoring and routine indexing is cumbersome and the available virus detection tools were labor intensive and expensive. To circumvent these problems we established tissue blot immunoassay (TBIA) method an alternative detection tool to detect Barley mild mosaic virus (BaMMV) and Barley yellow mosaic virus (BaYMV) infection in the field and greenhouse inoculated plants for monitoring and routine indexing applications, respectively. Initially, leaf and stem were tested to determine suitable plant tissue for direct blotting on nitrocellulose membrane. The dilutions of antibodies were optimized for more efficient and economical purposes. Results showed that stem tissue was more suitable for direct blotting for it had no background that interferes in the reaction. Therefore, this technique was referred as direct stem blot immunoassay or DSBIA, in this study. Re-used diluted (1:1000) antiserum and conjugate up to 3 times with the addition of half strength amount of concentrated antibodies was more effective in detecting the virus. The virus blotted on the nitrocellulose membrane from stem tissues kept at room temperature for 3 days were still detectable. The efficiency of DSBIA and RT-PCR in detecting BaMMV and BaYMV were relatively comparable. Results further proved that DSBIA is a rapid, reliable and economical detection method suitable for monitoring BaMMV and BaYMV infection in the field and practical method in indexing large scale of barley materials for virus resistance screening.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.331-339
• /
• 2004

XML has got to be a new standard for data representation and exchanging by its many good points, and the core part of many new researches and emerging technologies. However, the self-describing characteristic, which is one of XML's good points, caused the spreading of XML documents with different structures, and so the need of the research for the effective XML-document search has been proposed. This paper is for the analysis of the problem in BitCube, which is a bitmap indexing that shows high performance grounded on its fast retrieval. In addition, to resolve the problem of BitCube, we did design and implement xPlaneb(XML Plane Web) which it a new 3-dimensional bitmap indexing made of linked lists. We propose an effective information retrieval technique by replacing BitCube operations with new ones and reconstructing 3-dimensional array index of BitCube with effective nodes. Performance evaluation shows that the proposed technique is better than BitCube, as the amount of document increases, in terms of memory consumptions and operation speed.

• Journal of the Korean Ceramic Society
• /
• v.30 no.12
• /
• pp.1089-1095
• /
• 1993

The $\alpha$-Al2O3 (1100) surfaces were studied with reflection electron microscopy (REM) technique. Severely faceted surfaces were found in the <1120> azimuth. Two methods were applied for indexing the facets. The facets are indexed as (1101) and vicinal facets of (1102), while the macroscopic plane is (1100).