• Journal of the Korean Society for information Management
• /
• v.19 no.4
• /
• pp.298-319
• /
• 2002

The Semantic Web is a new technology that attempts to achieve effective retrieval, automation, integration, and reuse of web resources by constructing knowledge bases that are composed of machine-readable definitions and associations of resources that express the relationships among them. To have this kind of Semantic Web in place, it is necessary to have the following infrastructures: capability to assign unchangeable and unique identifier (URI) to each resource, adoption of XML namespace concept to prevent collision of element and attribute names defined by various institutions, widespread use of RDF to describe resources so that diverse metadata can be interoperable, use of RDF schema to define the meaning of metadata elements and the relationships among them, adoption of DAML+OIL that is built upon RDF(S) to increase reasoning capability and expressive power, and finally adoption of OWL that is built upon DAML+OIL by removing unnecessary constructors and adding new ones based on experience of using DAML+OIL. The purpose of this study is to describe the central concepts and technologies related to the Semantic Web and to discuss the benefits of metadata interoperability based on XML/RDF schemas and the potential applications of diverse ontologies.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.289-305
• /
• 2011

To efficiently analyze complex and voluminous data, OLAP systems increasingly provide functionalities for visual exploration of the data allowing end-users to navigate the desired view of the data cube. This paper only deals with data cubes whose schemas represented like the exclusive symmetric hierarchy which is not addressed by current OLAP implementations. This paper presents a conceptual classification of abstraction hierarchies, and an approach to navigating data cubes with a hierarchical visualization technique. The hierarchical visualization technique is developed by using the transitive closure of a binary relation. The approach is exemplified using a real-world study from the domain of national license administration.

• The Journal of the Korea Contents Association
• /
• v.20 no.2
• /
• pp.689-699
• /
• 2020

The National Science and Technology Information Center (NDSL) database, which provides academic papers at home and abroad, collects, builds, and manages data collected from various sources. In this study, we analyzed the DB paper schema and DB metadata that are currently constructed and managed to derive an integrated DB schema that can manage the high-value-added papers and manage them efficiently by analyzing distributed DB papers. Also, the final academic information data items were determined through comparison and analysis using the Web of Science and SCOPUS schemas that are currently purchased and possessed. The academic information data items constructed and serviced through this study were summarized into seven papers, authors, abstracts, institutions, themes, journals, and references, and defined as core contents under construction. The integrated DB schema was created through this study, and the results of this study will be used as a basis for constructing the integrated DB collection of high quality academic papers and designing the integrated system.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.217-229
• /
• 2002

Regular path expressions are primary elements for formulating queries over the semistructured data that does not assume the conventional schemas. In addition, the query pruning is an important optimization technique to avoid useless traversals in evaluating regular path expressions. However, the existing query pruning often fails to fully optimize multiple regular path expressions, and the previous methods that post-process the result of the existing query pruning must check exponential combinations of sub-results. In this paper, we present a new query pruning technique that consists of the preprocessing phase and the pruning phase. Our two-phase query pruning is affective in optimizing multiple regular path expressions, and is more scalable than the previous methods in that it never check the exponential combinations of sub-results.

• School Mathematics
• /
• v.11 no.3
• /
• pp.497-511
• /
• 2009

This study compared two problem solving instructional approaches, schema based sequence instruction and schema based parallel instruction on word problem solving performance of elementary school students who were in general students group. The subjects totaled 48 third grade students who were exposed to a test that consisted of 9 word problem items of three types for 4 sessions. First of all, the baseline of word problem performance level was measured without any training. During session 1, 2 and 3 participants were put into strategic training groups. The experiment was designed by two between factor(two intervention group and two within factors(two problem types, three sessions). The results of experiment were as follows. Schema based sequence instruction group performed significantly better than students in another group on word problem solving performance. The effect of strategic schema based Instruction revealed that solving word problems relied upon problem types, sessions and input orders which were of great value.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.127-137
• /
• 2006

We propose two phase filtering scheme to develop an efficient mechanism for XML databases to control query-based access. An access control environment for XML documents and some techniques to deal with fine-grained authorization priorities and conflict resolution issues are proposed. Despite this, relatively little work has been done to enforce access controls particularly for XML databases in the case of query-based access. The basic idea utilized is that a user query interaction with only necessary access control rules is modified to an alternative form through a query optimization technique, which is guaranteed to have no access violations using tree-aware metadata of XML schemas. The scheme can be applied to any XML database management system and has several advantages such as small execution time overhead, fine-grained controls, and safe and correct query modification. The experimental results clearly demonstrate the efficiency of the approach.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.1
• /
• pp.83-91
• /
• 2013

As humans perform many tasks using computers, HCI(Human-Computer Interaction) has received much attention these days. One objective of HCI research is to propose how to design more consistent systems. In order to evaluate the consistency of HCI devices from the user's perspective, several models such as TAG(Task Action Grammar), GOMS(Goals-Operators-Methods-Selection Rule), and GTN(General Transition Network) have been developed. TAG specifies actions to perform tasks in terms of rule schema. It has been verified that the less the number of rule schema is, the better users perform the tasks due to assumably higher consistency. This paper hypothesizes that the consistency of systems depends not only on the number of rule schema but also on the distances between rule schema. That is, the closer the rule schema are, the easier it is to acquire the whole set of rule schema. An experiment supported this hypothesis. Therefore, distances between rule schema should be considered as well as the number of rule schema when designing systems.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.35-47
• /
• 2011

This paper proposes a set of rules to automatically generate OWL ontologies from relational databases. The purpose of the rules is to allow semantic access to existing RDB data without any database schema transformation and data migration process. In other words, the rules help a RDBMS play as a web ontology repository as well. However, the use of the mapping rules between RDB and OWL proposed by other studies for the objective causes troubles as follows. First, databases including the tables with a specific structure can't be translated into OWL. Second, the process for extracting an OWL individual unnecessarily lead to database join operations, or several SQL queries. On the other hand, our rules is designed to prevent these problems, can generate OWL classes and properties from database schemas and can generate OWL individuals from the database instances. In addition, an ontology generated by our rules is an OWL 2 DL ontology.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.28 no.4
• /
• pp.437-460
• /
• 2017

After introducing the Industrial Trainee System in 1993, the population of immigrants coming to Korean have increased rapidly and over 2 million immigrants are living in Korea in 2017. In this situation, libraries are responsible for collecting, organizing, preserving and disseminating various records related to immigrants living in local communities but it is hard to find these kind of libraries in Korea. So, this study is trying to investigate the characteristics of multicultural archives established by libraries in other countries. To do this, 9 multicultural archives in U.S. and Canada were analyzed in terms of participating institutions and supporting institutions, types of records, digitizing and file formats, digital collection management systems and metadata schemas. At last, some suggestions were proposed to improve the function of libraries as a local multicultural archives.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.1072-1076
• /
• 2005

Importance of XML as a target of Data Mining is growing because XML is used generally as a standard markup language for describing structured data. Especially researches have been done about extracting wanted informations by applying association rules to XML documents. But there are few development about solving the problems of method for efficiently obtaining informations from similar kinds of XML documents. To solve the problem this paper tries to suggest the method by which common XML structure is extracted form the same kinds of XML documents having a various XML schemas. The resulted schema structure is supposed to be important one as a preliminary job because it helps us to acquire the useful informations from various kinds of documents by unifying their structures.