• The Journal of Information Technology and Database
• /
• v.5 no.1
• /
• pp.13-37
• /
• 1998

인터넷 등의 컴퓨터 통신 네트워크의 발달로 인하여 분산된 정보자원의 공유를 통한 자원에 대한 재사용성의 필요성이 대두되었다. IRD(Information Resource Dictionary)는 조직 내에서 관련된 모든 정보에 대한 데이터가 논리적으로 중앙화된 정보저장소(repository)이다. IRD 내의 데이터는 다른 데이터를 기술하므로 이른바 메타 데이터라고 하기도 한다. IRD의 사전(dictionary) 요소는 정보자원의 종류, 정보자원의 의미, 정보자원의 논리적 구조, 정보자원의 위치, 그리고 정보자원의 접근방법 등을 기술한다. FIPS ANSI의 IRDS는 이항 관계를 이용하여 무결성 제약조건을 표현하므로 제약조건 규칙의 표현과 일반적인 추론 규칙의 표현이 제한되어 있으며, 다양한 형태의 무결성 제약조건의 표현과 IRD와 관련된 여러 정보의 도출 또는 추론 및 관리에 관한 사항은 IRD 응용 고유의 문제로 간주하여 언급하고 있지 않다. 한편, FIPS IRDS는 사용자가 SQL 및 IRD에 대한 전문적 지식이 없이는 사용자 질의 작성이 어려운 점등에 대한 문제점을 안고 있다. 본 논문은 FIPS IRDS의 기본모델에서 정보자원 표현, 정보자원들간의 관계, 정보자원의 관리 정보 구분을 명확히 하기 위해 정보자원 모델을 정보자원 표현요소와 정보자원 관리요소의 두 부류로 나누어 구분하고, 각 부류에 대한 자격 질의(competency question)를 통하여 유추된 요소들을 FIPS ANSI IRDS 기본 모델의 스키마 기술 레벨과 스키마 레벨에 첨가함으로써 그 기본 모델을 확장한다. 그리고, FIPS ANSI IRDS가 제공하는 IRD 기술과 관리 기능을 그대로 포함하면서 앞에서 문제점으로 지적된 제약조건 표현과 추론규칙 표현을 위하여 확장된 기본 모델을 중심으로 각 레벨의 구성 요소들의 형식적 의미(formal semantics)와 레벨 내 혹은 레벨 구성요소들간의 관계성(relationship), 그리고 제약조건의 표현과 질의 추론 규칙들을 식별하여 FOPL(First Order Predicate Logic)로 표현한다. 또한, 본 논문은 FOPL로 표현된 predicate들과 규칙들을 구현하기 위하여 Prolog로 변환하기 위한 이론적 방법론을 제시하고 정보자원 관리를 위한 기본 함수들과 스키마 진화(schema evolution)를 위한 방법론을 제안한다.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.423-432
• /
• 2009

Advances in information and communication technologies are changing our society greatly. In knowledge-based society, information can be obtained easily via communication tools such as web and e-mail. However, obtaining right and up-to-date information is difficult in spite of overflowing information. The concept of adaptive web site has been initiated recently. The purpose of the site is to provide information only users want out of tons of data gathered. In this paper, an algorithm is developed for adaptive web site construction. The proposed algorithm is based on association rules that are major principle in adaptive web site construction. The algorithm is constructed by analysing log data in web server and extracting meaning documents through finding behavior patterns of users. The proposed algorithm has the following characteristics. First, it is superior to existing algorithms using association rules in time complexity. Its superiority is proved theoretically. Second, the proposed algorithm is effective in space complexity. This is due to that it does not need any intermediate products except a linked list that is essential for finding frequent item sets.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1665-1680
• /
• 1997

The Entity-Relationship (E-R) model is widely used not only to increase understanding between user and designer, but also to model the relationship of real world data appropriately when designing database system in many application areas. It should be then transformed into an Object-Oriented database model which gives good merits to represent and manipulate data efficiently. Therefore, a method of transforming an E-R model into an Object-Oriented database model should be studied, but without losing any semantics of concept for the E-R model. This paper not only deals with transformation rules taking as input the elements of E-R model and delivering the elements of an Object-Oriented database model, but also improves the concept of generalization and aggregation inheritance. The paper also presents a method of transformation of relationship depending on these rules. The proposed method that obtains Object-Oriented database schema from an E-R model with preserving the properties of the E-R model is shown with examples. The method presented is able to be used to the logical database design.

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.111-119
• /
• 2005

Electronic catalog contains ich semantics associated with products, and serves as a challenging practical domain for ontology application. Ontology is concerned with the nature and relations of being. It can play a crucial role in e-commerce as a formalization of e-Catalogs. Description Logics provide a theoretical core for most of the current ontology languages. In this paper, we present an ontological model of e-Catalogs in DL. We take an Extended Entity Relationship approach for conceptual modeling method, and present the fundamental set of modeling constructs and corresponding description language representation for each construct. Additional semantic knowledge can be represented directly in DL. Our modeling language stands within SHIQ(d) which is known reasonably practical with regard to its expressiveness and complexity. We illustrate sample scenarios to show how our approach may be utilized in modeling e-Catalogs, and also implement the scenarios through a DL inference tool to see the practical feasibility.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.4
• /
• pp.381-392
• /
• 2005

Computing has been making a lot of progress in the quantity of data, today. It's going to be more difficult to get appropriate information as the number of data increases dramatically. Therefore it's more important to get meaningful information than to focus on the speed of processing. Semantic web enables an intelligent processing by adding semantic information to data, and it is useful to make ontology system. In this Paper, we implemented ontology Processing system which support function for ontology and efficient processing for practical service. We proposed system design for independent from storage, storing technique for RDB, caching technique by schema information and useful user interface.

• Journal of KIISE:Databases
• /
• v.37 no.4
• /
• pp.197-202
• /
• 2010

Recent studies on change detection for RDF data are focused on not only the structural difference but also the semantic-aware difference by computing the closure of RDF models. However, since these techniques which take into account the semantics of RDF model require both RDF models to be memory resident, or they use a forward-chaining strategy which computes the entire closure in advance, it is not efficient to apply them directly to detect changes in large RDF data. In this paper, we propose a scalable change detection technique for RDF data, which uses a backward-chaining inference based on relational database. Proposed method uses a new approach for RDF reasoning that computes only the relevant part of the closure for change detection in a relational database. We show that our method clearly outperforms the previous works through experiment using the real RDF from the bioinformatics domain.

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

One issue with keyword search in general is its ambiguity which can ultimately impact the effectiveness of the search in terms of the quality of the search results. This ambiguity is primarily due to the ambiguity of the contextual meaning of each term in the query. In addition to the query ambiguity itself, the relationships between the keywords in the search results are crucial for the proper interpretation of the search results by the user and should be clearly presented in the search results. We address the keyword search ambiguity issue by adapting some of the existing approaches for keyword mapping from the query terms to the schema terms/instances. The approaches we have adapted for term mapping capture both the syntactic similarity between the query keywords and the schema terms as well as the semantic similarity of the two and give better mappings and ultimately 50% raised accurate results. Finally, to address the last issue of lacking clear relationships among the terms appearing in the search results, our system has leveraged semantic web technologies in order to enrich the knowledgebase and to discover the relationships between the keywords.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.35-45
• /
• 2007

This paper proposes a classification model for systematical management of resources in educational repositories. A classification scheme should be provided to systematically store and manage, precisely retrieve, and maximize the usability of the resources. However, there is little research result on the classification scheme and classification model for educational repository resources. It causes several issues such as inefficient management of educational resources, incorrect retrieval, and low usability. However, there are different characteristics between the educational resource information and information of the previous fields. Therefore, a novel research on the classification scheme and classification model for the resources in educational repositories is required. To achieve the goal for efficient and easy use of the educational resources, we should manage consistently the resources according to the classification scheme accepting several views. This paper proposes a classification model to systematically manage and increase the usability of the educational resources. In other words, the proposed classification model can manages dynamically the classification scheme for the resources in educational repositories according to various views. To achieve the objectives, we first define a proper classification scheme for the implementation resources based on the classification scheme in relevant scientific technology fields. Especially, we define a novel classification model to dynamically manage the defined classification scheme. The proposed classification scheme and classification model enable more precise and systematic management of implementation resources and also increase the ease of usability.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.7
• /
• pp.4105-4110
• /
• 2014

The role of bass in band or ensemble music literally sets up the foundation of harmony, which must be regarded first. On the other hand, this is also considered so basic or stable that it can be slightly boring to the listeners. Consideration is needed to make the varied trials more exciting. In this sense, Rutger Gunnarsson showed these fine examples not in performing music but in pop music through the Great ABBA. He could make a fabulous sound with only a basic performance, not with a florid technique or rhetorical skills. All bassists must bear in mind that the overall performance depends on the bass. In short, to make better music, remember to practice continually and find better methods.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.1-10
• /
• 1997

In this paper, for useful administration of the data which have ambiguities meaningfully and hard to treat, a new relation database model using an integrated fuzzy sets and rough sets relational database one. After proposing Fuzzy-rough relational database model on the base of integrated Fuzzy and Rough sets, Application of the examples of arithmetic is analyzed through the Access DBMS and the visual basic by composing and representing database based on fuzzy and rough sets which are characterized as fuzzy sets and rough sets on Pentium computer(166Mhz). This paper was induced to reduce the data incompleteness.