• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.452-472
• /
• 2005

We propose XIR-Branching, a novel method for processing partial match queries on heterogeneous XML documents using information retrieval(IR) techniques and novel instance join techniques. A partial match query is defined as the one having the descendent-or-self axis '//' in its path expression. In its general form, a partial match query has branch predicates forming branching paths. The objective of XIR-Branching is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Branching has its basis on the conventional schema-level methods using relational tables(e.g., XRel, XParent, XIR-Linear[21]) and significantly improves their efficiency and scalability using two techniques: an inverted index technique and a novel prefix match join. The former supports linear path expressions as the method used in XIR-Linear[21]. The latter supports branching path expressions, and allows for finding the result nodes more efficiently than containment joins used in the conventional methods. XIR-Linear shows the efficiency for linear path expressions, but does not handle branching path expressions. However, we have to handle branching path expressions for querying more in detail and general. The paper presents a novel method for handling branching path expressions. XIR-Branching reduces a candidate set for a query as a schema-level method and then, efficiently finds a final result set by using a novel prefix match join as an instance-level method. We compare the efficiency and scalability of XIR-Branching with those of XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Branching is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions, and by several factors for branching path expressions.

• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1133-1148
• /
• 2012

This paper presents a hierarchical structuring method for the multidimensional type inheritance indices (MD-TIXs) that support the processing of XML queries in XML databases. MD-TIX uses a multidimensional index structure for efficiently supporting ancestor-descendant explorations that involve both nested element and type inheritance hierarchies. However, In the case of a long Xpath, the building and maintenance of MD-TIX are very difficult because of index entry construction problem. So, we propose a type inheritance index hierarchy method for solving this difficulty. We first construct base indices that support direct relationship explorations between adjacent two types on a given Xpath, and then, based on these base indices, we construct hierarchically the derived indices that support indirect relationship explorations between any two types of Xpath until constructing one target index for supporting the full Xpath. And we also present an algorithm that efficiently constructs a partial index hierarchy for supporting given a set of sub-pathes explorations.

• Spatial Information Research
• /
• v.20 no.5
• /
• pp.99-109
• /
• 2012

Recently, due to the growth of social media and spread of smart-phone, the amount of data has considerably increased by full use of SNS (Social Network Service). According to it, the Big Data concept is come up and many researchers are seeking solutions to make the best use of big data. To maximize the creative value of the big data held by many companies, it is required to combine them with existing data. The physical and theoretical storage structures of data sources are so different that a system which can integrate and manage them is needed. In order to process big data, MapReduce is developed as a system which has advantages over processing data fast by distributed processing. However, it is difficult to construct and store a system for all key words. Due to the process of storage and search, it is to some extent difficult to do real-time processing. And it makes extra expenses to process complex event without structure of processing different data. In order to solve this problem, the existing Complex Event Processing System is supposed to be used. When it comes to complex event processing system, it gets data from different sources and combines them with each other to make it possible to do complex event processing that is useful for real-time processing specially in stream data. Nevertheless, unstructured data based on text of SNS and internet articles is managed as text type and there is a need to compare strings every time the query processing should be done. And it results in poor performance. Therefore, we try to make it possible to manage unstructured data and do query process fast in complex event processing system. And we extend the data complex function for giving theoretical schema of string. It is completed by changing the string key word into integer type with filtering which uses keyword set. In addition, by using the Complex Event Processing System and processing stream data at real-time of in-memory, we try to reduce the time of reading the query processing after it is stored in the disk.

• Journal of Digital Contents Society
• /
• v.17 no.5
• /
• pp.383-390
• /
• 2016

is a service providing story synopses that match user's query. This paper presents a classification of character types by clustering of character tendencies found in the user log of . We also present a visualization method of showing genre-action relationships to each character type, and investigate the genre-action relationships of the major character types. We found that a small number of character types can represent more than half of the character tendencies and the character types tend to have a relationship to particular genres and actions. According to this properties, it would be desirable to provide supports for creative writing classified by character types.

• Spatial Information Research
• /
• v.19 no.2
• /
• pp.57-64
• /
• 2011

This paper describes how to storing and querying trajectory information on PostgreSQL/PostGIS. Recently as technology of mobile devices is advancing, many researches for location-based services and moving object's trajectory have been studied. Trajectory is the set of information of the location by the time, and is one of the most im portant information for location-based services. Traditional spatial database systems do not support trajectory data types and functions. In this paper, we propose a trajectory data type and query functions for moving objects on PostgreSQL/PostGIS.

• Journal of Information Technology Services
• /
• v.16 no.1
• /
• pp.73-82
• /
• 2017

Recently in-memory data stream processing has been actively applied to various subjects such as query processing, OLAP, data mining, i.e., frequent item sets, association rules, clustering. However, finding regular periodic patterns of events in an infinite data stream gets less attention. Most researches about finding periods use autocorrelation functions to find certain changes in periodic patterns, not period itself. And they usually find periodic patterns in time-series databases, not in data streams. Literally a period means the length or era of time that some phenomenon recur in a certain time interval. However in real applications a data set indeed evolves with tiny differences as time elapses. This kind of a period is called as a pseudo-period. This paper proposes a new scheme called FPMH (Finding Periods using Multiple Hash functions) algorithm to find such a set of pseudo-periods over a data stream based on multiple hash functions. According to the type of pseudo period, this paper categorizes FPMH into three, FPMH-E, FPMH-PC, FPMH-PP. To maximize the performance of the algorithm in the data stream environment and to keep most recent periodic patterns in memory, we applied decay mechanism to FPMH algorithms. FPMH algorithm minimizes the usage of memory as well as processing time with acceptable accuracy.

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.3
• /
• pp.185-190
• /
• 2018

In the recent field of education, they open career-related curriculums either as formal curricular programs or extracurricular programs as highlighting value of career education. However, this lecture-based career education has failed to attract students' interest, and results are not satisfactory either. Since then, in order to design entertaining career education, the field has developed diverse tools and as a vocational aptitude testing tool for career development, methods that would use vocational cards were introduced. Today, schools from elementary school to middle and high schools frequently make use of the cards to conduct the vocational aptitude test and yet, as this web-based learning and smartphones are distributed, changes in the testing tool are being intensely demanded. This study aims to create and implement an application to help the vocational cards-using vocational aptitude test targeting students in elementary, middle and high schools to be actually conducted in a mobile platform.

• Journal of the Korean Society for Library and Information Science
• /
• v.44 no.1
• /
• pp.101-115
• /
• 2010

The main difference between web searching and traditional searching is that the web provides and supports multimedia searching. This study aims to investigate the multimedia searching behavior of users of NAVER, a major Korean search portal. In conducting this study, the query logs and click logs of a unified search service were analyzed. The results of this study show that among the multimedia queries submitted by users, audio searches are the dominant media type, followed similarly by video and image searches. On the other hand, among the multimedia documents clicked on, video is the most popular collection type followed by image and audio collections. Entertainment is the most popular topic in both multimedia queries and clicks. The results of this study can be implemented for the portal's development of multimedia content and searching algorithms.

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.19 no.6
• /
• pp.1471-1474
• /
• 2005

Sasang constitution medicine is to do different treatment accordining to sasang constitution. Therefore, the constitution diagnosis in the Sasang constitution medicine is very important thing. The Process of Sasang constitution diagnosis Is difficult thing, because of consuming much time, making every effort. It is apt to be subjective tendency. So it need to make objective method. The QSCC II (Questionnaire of Sasang Constitution Classification II ) have several problems- can't do diagnosis of Taeyangin, the accuracy rate of Sasang constitution diagnosis is not high (probably 60%), and so on. So, we need the new methods for the Sasang constitution Diagnosis. We will modify the problems of QSCC II. The First is the problems of the study execution process, not-multicenter study, a low data, the absent of Taeyangin cases. So, we have to do the multicenter study. The Second is the problems of a query and the method of statistics analysis. We will modify the problems of self-report Questionnaire. That is the problems of self-report Questionnaire, the lack of objective estimation( body type, personal appearance, etc), the absent of the estimation on typical or non-typical type constitution. We modified the problems of QSCC II. Therefore we made the new self-report Questionnaire for patients. We modified the problems of self-report Questionnaire. Therefore we made the new Constituion diagnosis Questionnaire for doctors. We develop the Questionnaire of two ways for the Sasang constitution Diagnosis. The one is the new self-report Questionnaire for patients. The other is the new Constitution diagnosis Questionnaire for doctors. We have to melt down the Questionnaire of two ways for the Sasang constitution Diagnosis.

• Journal of Information Technology Services
• /
• v.8 no.3
• /
• pp.171-184
• /
• 2009

Since the development of the Distributed Hash Tables (DHTs), the distributed lookup services are one of the hot topics in the networking area. The main reason of this popularity is the simplicity of the lookup structure. However, the simple key based search mechanism makes the so called "keyword" based search difficult if not impossible. Thus, the applicability of the DHTs is limited to certain areas. In this paper. we find that DHTs can be used as the ubiquitous sensor network (USN) metadata lookup service across a large number of sensor networks. The popularity of the Ubiquitous Sensor Network has motivated the development of the USN middleware services for the sensor networks. One of the key functionalities of the USN middleware service is the lookup of the USN metadata, by which users get various information about the sensor network such as the type of the sensor networks and/or nodes, the residual of the batteries, the type of the sensor nodes. Traditional distributed hash table based lookup systems are good for one sensor network. However, as the number of sensor network increases, the need to integrate the lookup services of many autonomous sensor networks so that they can provide the users an integrated view of the entire sensor network. In this paper, we provide a hybrid lookup model, in which the autonomous lookup services are combined together and provide seamless services across the boundary of a single lookup services. We show that the hybrid model can provide far better lookup performance than a single lookup system.