• Proceedings of the Korean Society for Cognitive Science Conference
• /
• 2000.06a
• /
• pp.411-418
• /
• 2000

Hausser (1999)와 이기용 (1999a, 1999c)에서는 데이터베이스 관리 시스템(DBMS)을 이용하여 자연언어의 의미를 다루는 데이터베이스 의미론을 제안하였다. 특히 이기용 (1999c)에서는 수형도(tree), 논리 형태(logical fomulas), 자질 구조(feature structure)와 같은 다양한 언어 표상 형식들을 관계형 데이터베이스 관리 시스템(DBMS)의 표상 형식인 테이블 형식으로 전환 가능함을 보임으로써 데이터베이스 의미론에 관계형 데이터베이스 관리 시스템을 도입할 수 있음을 제시하였다. 한편, Lee (2000)에서 제시한 데이터베이스 의미론 모형에서는 데이터베이스 관리 시스템과 사용자(end-user)를 연결하는 언어 정보 처리 시스템(LIPS; Linguistic Information Processing System)을 제안하였다. 이 언어 정보 처리 시스템은 사용자에 의해 입력된 언어 자료를 처리하여 그 분석 결과를 데이터베이스 관리 시스템에 전달하고, 이를 통해 구축된 데이터베이스에서 추출한 정보를 다시 사용자에게 전달하는 시스템이다. 이 논문은 한국어 '이, 히, 리, 기' 피동형을 전산처리 할 수 있도록, 데이터베이스 의미론에서 핵심 요소인 언어정보 처리 시스템과 데이터베이스 관리 시스템을 구현하는 것이 목적이다.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.9 no.2
• /
• pp.73-79
• /
• 2010

The most popular technique for image retrieval in a heterogeneous collection of color images is the comparison of images based on their color histogram. The color histogram describes the distribution of colors in the color space of a color image. In the most image retrieval systems, the color histogram is used to compute similarities between the query image and all the images in a database. But, small changes in the resolution, scaling, and illumination may cause important modifications of the color histogram, and so two color images may be considered to be very different from each other even though they have completely related semantics. A new method of color feature representation based on the 3-dimensional RGB color map is proposed to improve the defects of the color histogram. The proposed method is based on the three 2-dimensional projection map evaluated by projecting the RGB color space on the RG, GB, and BR surfaces. The experimental results reveal that the proposed is less sensitive to small changes in the scene and that achieve higher retrieval performances than the traditional color histogram.

• Journal of information and communication convergence engineering
• /
• v.2 no.2
• /
• pp.123-127
• /
• 2004

The most popular technique for image retrieval in a heterogeneous collection of color images is the comparison of images based on their color histogram. The color histogram describes the distribution of colors in the color space of a color image. In the most image retrieval systems, the color histogram is used to compute similarities between the query image and all the images in a database. But, small changes in the resolution, scaling, and illumination may cause important modifications of the color histogram, and so two color images may be considered to be very different from each other even though they have completely related semantics. A new method of color feature representation based on the 3-dimensional RGB color map is proposed to improve the defects of the color histogram. The proposed method is based on the three 2-dimensional projection map evaluated by projecting the RGB color space on the RG, GB, and BR surfaces. The experimental results reveal that the proposed is less sensitive to small changes in the scene and that achieve higher retrieval performances than the traditional color histogram.

• Journal of Information Technology Services
• /
• v.7 no.4
• /
• pp.87-99
• /
• 2008

As the technologies for telecommunication have been evolving, more enhanced information services and integrated information systems have been introduced, which can manage a variety of information from the heterogeneous systems. The major obstacle for the integrated information systems is the integrating heterogeneous databases in the systems and the heterogeneity problems can be classified into the structural and data heterogeneities. However, the previous researches have mainly highlighted into the solving structural heterogeneity problems. This paper identifies the data heterogeneity problems for multi-database schema integrations and proposes a new solving method. We analyze the semantics equivalence in data values based on the functional dependency, primary and candidate keys, and present a procedural solution of data heterogeneity in the perspective of the concept of attribute equivalence, integration key and conceptual integration table.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.3
• /
• pp.51-64
• /
• 2001

Schema integration is one of the most difficult issues in the heterogeneous and distributed geographic database systems (GDSs). As the use of spatial information in various application areas becomes increasingly popular, the integration of geographic information has become a crucial task for decision makers. Most existing schema integration techniques described in the database literature, however, do not address the problems of managing heterogeneities among complex objects that contain visual data and/or spatial and temporal information. The difficulties arise not only from the semantic conflicts, but also from the different representations of spatial models. Consequently, it is much more complex to achieve interoperability in the area of geographic databases. This research attempts to provide a solution to such problems. The research reported in this paper describes a schema integration methodology and a prototype toolkit developed to assist in schema integration activities for GDSs.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1219-1232
• /
• 2004

Recently, the web sites, such as e-business sites and shopping mall sites, deal with lots of catalog image information and contents. As a result, it is required to support semantic-based image retrieval efficiently on such image data. This paper presents a semantic-based image retrieval system, which adopts XML and Fuzzy technology. To support semantic-based retrieval on product catalog images containing multiple objects, we use a multi-level metadata structure which represents the product information and semantics of image data. To enable semantic-based retrieval on such image data, we design a XML database for storing the proposed metadata and study how to apply fuzzy data. This paper proposes a system, generate the fuzzy data automatically to use the image metadata, that can support semantic-based image retrieval by utilizing the generating fuzzy data. Therefore, it will contribute in improving the retrieval correctness and the user's satisfaction on semantic-based e-catalog image retrieval.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.1-13
• /
• 2003

In this paper, we present a content-dependent authorization mechanism for object-oriented database systems. So far, several models of authorization for object-oriented databases have been proposed, but most of these models do not support the authorization based on the database content. This paper shows how the traditional content-independent authorization model can be extended to provide the content-dependent authorization using predicates on the values of attributes of a class. The proposed model makes it possible to group objects that satisfy the specified conditions on the values of the objects and to grant a single authorization on those objects. This model supports the negative authorization and provides the concept of the strong and weak authorization to resolve conflicts between positive and negative authorizations. In addition, we address and resolve some of the problems that arise when the predicates are associated with the authorization. In particular, since the authorization operations of the traditional content- independent model become inadequate for our mode, we redefine the semantics of the authorization operations.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1377-1389
• /
• 1998

Firm real time transactions on firm real-time database systems arc discarded when they miss their deadlines. as there is no value to completing them after they miss their deadlines. Several approaches that exploit the semantics of firm deadlines to improve the performance of firm real-time database systems have been proposed in the literature. They are based Oil locking or optimistic concurrency controL The performance comparisons of the two approaches differ with svstems load. In this paper. we develop a novel policy termed stop/resume deferred restart policy, and a concurrency control algorithm based on the policy (temled Altcmativc Version Concurrency Contro). When conflicts : due to Pliority) occur our algmithm maintains the immediately restarted VerSlOn as wpll as the stopped version of a transaction in order to use one of the two to meet the firm deadline. At last we show that our policy generates scrializable schedules and show tbat our algorithm performs better than the traditionally used method for wide ranges of the system load for firm deadline transaction.

• 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.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.365-380
• /
• 2002

Temporal data mining, the incorporation of temporal semantics to existing data mining techniques, refers to a set of techniques for discovering implicit and useful temporal knowledge from large quantities of temporal data. Temporal knowledge, expressible in the form of rules, is knowledge with temporal semantics and relationships, such as cyclic pattern, calendric pattern, trends, etc. There are many examples of temporal data, including patient histories, purchaser histories, and web log that it can discover useful temporal knowledge from. Many studies on data mining have been pursued and some of them have involved issues of temporal data mining for discovering temporal knowledge from temporal data, such as sequential pattern, similar time sequence, cyclic and temporal association rules, etc. However, all of the works treated data in database at best as data series in chronological order and did not consider temporal semantics and temporal relationships containing data. In order to solve this problem, we propose a theoretical framework for temporal data mining. This paper surveys the work to date and explores the issues involved in temporal data mining. We then define a model for temporal data mining and suggest SQL-like mining language with ability to express the task of temporal mining and show architecture of temporal mining system.