• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.582-587
• /
• 2008

Structural join is one of the most typical techniques for evaluating XML path queries. Recent researches for structural joins focus on techniques of skipping unnecessary elements using the horizontal distribution information of elements that is indexed on a structure like B+ tree. However, those techniques make the structural join complicated and cannot guarantee efficient join processing due to the overhead of an index structure. In this paper, we propose a new structural join technique that exploits the level information of XML elements. Our technique can skip unnecessary elements using level information, which is vertical distribution information of elements. Through the experimental results, we show that our technique can evaluate structural joins efficiently.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.641-649
• /
• 2005

As XML is widely used with the development of internet, many researches on the XML storage and query processing have been done Several index techniques have been proposed to efficiently process XML path queries. Recently, structural join has received murk attention as a method to protest the path query. Structural join technique process a path query by identifying the containment relationship of elements. Especially, it has an advantage that we can get the result set by simply comparing related elements only instead of scanning whole document. However during the comparison process, unnecessary elements that are not included in the result set can be scanned. So we propose a new technique, the level structural join. In this technique, we use both the relationship and the level distribution of elements in the path query. Using this technique, we tao improve the performance of query processing only by comparing elements with specific level in the target inverted level.

• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1178-1178
• /
• 1999

A spatial join has the property that its execution time exponentially increases in proportion to the number of spatial objects. Recently, there have been many attempts for improving the performance of the spatial join by using parallel processing schemes, In the case of executing parallel spatial join using the parallel machine with shared disk architecture, the disk bottleneck of parallel processing of spatial join worsens in comparison with sequential spatial join. This paper presents the algorithms of task creation and assignment to reduce the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing between processors, This paper proposes object caching which is a higher level of abstraction than page caching, and uses it to do creation and assignment of tasks according to temporal and spatial localities for minimizing disk access time. The object caching shows the performance improvement of 50%. The task creation and assignment using localities gives the gain of 30% and 20%. Overall performance evaluation of the proposed algorithms shows 7.2 times speed up than those of sequential execution of spatial joins.

• Journal of KIISE:Databases
• /
• v.41 no.4
• /
• pp.256-261
• /
• 2014

The problem of top-${\kappa}$ set similarity joins finds the top-${\kappa}$ pairs of records ranked by their similarities between two sets of input records. We propose an efficient algorithm to return top-${\kappa}$ similarity join pairs using a sampling technique. From a sample of the input records, we construct a histogram of set similarity joins, and then compute an estimated similarity threshold in the histogram for top-${\kappa}$ join pairs within the error bound of 95% confidence level based on statistical inference. Finally, the estimated threshold is applied to the traditional similarity join algorithm which uses the min-heap structure to get top-${\kappa}$ similarity joins. The experimental results show the good performance of the proposed algorithm on large real datasets.

• Journal of Korean Society for Quality Management
• /
• v.45 no.4
• /
• pp.933-942
• /
• 2017

Purpose: The purpose of this paper is to evaluate the performance quality of the open source DBMSs. Performance quality is defined as processing time for Join queries. Query processing time is measured and compared in the most widely used open source DBMSs and commercial DBMS. Methods: By varying the number of tuples of two relations to be joined, the average processing time(seconds) of a Join query in each DBMS was obtained experimentally. ANOVA and Tukey HSD test were used in order to compare the performance quality of DBMSs. Results: There was a significant difference between the performance qualities of the three DBMSs at all experimental levels where the number of tuples was 100, 1,000, 2,000, 10,000, and 50,000. As a result of the Tukey HSD test, two open source DBMSs (MariaDB, MySQL) were classified in the same group only at the tuple level of 100. The commercial DBMS (MS-SQL Server) belonged to another group. At level of more than 1,000 tuples, all three DBMSs belonged to different groups. Conclusion: Within the open source DBMS group, MariaDB showed the better performance quality except for a small number of tuples. Thus the results show that MariaDB can be the alternative to MySQL which is currently most widely used. Between open source DBMS and commercial DBMS groups, MS-SQL Server always shows the best performance quality, but the less number of tuples, the less the difference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1399-1406
• /
• 2009

In the internet broadcast, efficient and scalable mechanism of multicast is needed for the communication between groups. Furthermore, Optimization of the multicast tree is required to improve the performance of overlay multicast. This optimization is well-known as NP-complete. If a node in the tree has limited out-degree, a user who wants to join the group has to find parent user who has already joined. In this paper, the users who want to join the group need to setup their level using delay test from source node. And then new users can find candidate parent nodes effectively using ACK-SEND approach and take proper position by comparing level. The closer node of the user to root node should be located in lower level. Also, even if a barrier is caused, fast recovery will be guaranteed using ACK-SEND approach. Through this, the newcomer node can fine their location in the multicast tree and join the group fast and effectively.

• The KIPS Transactions:PartB
• /
• v.15B no.4
• /
• pp.355-364
• /
• 2008

In general, we can use an inverted index for retrieving element lists from structured documents. An inverted index can retrieve a list of elements that have the same tag name. In this approach, however, the cost of query processing is linear to the length of a path query because all the structural relationships (parent-child and ancestor-descendant) should be resolved by structural join operations. In this paper, we propose an inverted index technique and a novel structural join technique for accelerating XML path query evaluation. Our inverted index can retrieve element lists for path segments in a parent-child relationship. Our structural join technique can handle lists of element pairs while the existing techniques handle lists of elements. We show through experiments that these two proposed techniques are integrated to accelerate evaluation of XML path queries.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.88-97
• /
• 2000

Applied with multicast transmission techniques in mobile computing environments, a mobile host will experience join and graft delay, happened when a host wants to join a multicast group in the fixed network, if there are no same multicast group member in the new cell the mobile host enters. Due to low bandwidth and higher error rate, there happens many additional traffic. In this paper, we propose a pre-join technique which new mobile support station joins the multicast group in advance based on signal strength hint in the current cell. We use the multiple level acknowledgement strategy that executes acknowledgment separately between the fixed part and the wireless transmission path. Using our strategy, it is an efficient technique in case there are more cells that has no multicast group members and less mobile host movements.

• Journal of Korean society of Dental Hygiene
• /
• v.18 no.2
• /
• pp.217-226
• /
• 2018

Objectives: The purpose of this study is to find out differences in oral health status, defined as their oral health and oral health quality of life among the elderly depending on their income and education levels. Methods: This study used 922 senior citizens over 65 from the data (2015) of the 6th National Health and Nutrition Survey (NHNS). The regression analysis was adopted to identify factors affecting their oral health status which has effect on their oral health quality of life. The statistical package SPSS 21.0 was employed. Frequency analysis, chi-squared analysis and regression analysis were used, and the significance level or Cronbach's alpha value was 0.05. Results: Depending on income levels, there were differences in their oral health status as to whether they use oral hygiene products, take dental examinations, join private health-insurances, and delay dental treatments or not. And educational levels also made significant differences in their oral health status as to whether they smoke, drink alcohol, how many times they brush teeth a day, whether they use oral hygiene products, take dental treatments, and join private health-insurances. Regression analysis on the relationship between their oral health status and the oral health quality of life showed that there were significant differences depending on whether they take dental treatments, delay dental medical treatments, smoke, take oral examinations, how many times they brush teeth a day, and whether they use oral hygiene products, or join private health-insurances. Conclusions: The study shows that a comprehensive plan is needed to raise attention on proper oral health-care and ultimately to improve the quality of life by considering the daily number of tooth brushing, oral hygiene product use, regular dental treatments, and other medical uses.

• Journal of Korean Academic Society of Home Health Care Nursing
• /
• v.19 no.2
• /
• pp.112-118
• /
• 2012

Purpose: This study was examined to identify the correlation health-promoting behavior, self-esteem, and life satisfaction of the elderly. Method: The subjects consisted of 115 elderly. The data collected from Oct to Dec 2011 were analyzed using descriptive statistics, t-test, ANOVA, and Pearson correlation coefficients. Result: The mean scores of health-promoting behavior ($2.33{\pm}.34$), self-esteem ($2.87{\pm}.58$), and life satisfaction ($2.98{\pm}.44$) of elderly were the average. Health-promoting behavior was significantly different according to age, educational level, religion, spouse, living arrangement, economic status, and join groups. Self-esteem was significantly different according to religion, economic status, and join groups. Life satisfaction was significantly different according to age, economic status, and join groups. Significant correlations were found between health-promoting behavior, self-esteem, and life satisfaction. Conclusion: These findings indicate that health-promoting behavior, self-esteem, and life satisfaction may be necessities to pursue successful aging of elderly. In addition, above mentioned results will be reflected in improving the quality of life programs.