• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.993-1001
• /
• 2003

A RDB Storage Model based on the Edge-Labeled Graph is suggested for store the XML instance in Relational Databases(RDB). The XML instance being stored is represented by Data Graph based on the Edge-Labeled Graph. Data Path Table, Element, Attribute, and Table Index Table values are extracted. Then Database Schema is defined, and the extracted values are stored using the Mapper. In order to support querry, Repository Model offers the translator translating XQL which is used as query language under XPATH, into SQL. In addition, it creates DBtoXML generator restoring the stored XML instance. As a result, storage relationship between the XML instance and proposed model structure can be expressed in terms of Graph-based Path, and it shows the possibility of easy search of random Element and Attribute information.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.9
• /
• pp.13-25
• /
• 2021

In the age of digital innovation based on the Internet, Information and Communication and Artificial Intelligence technologies, huge amounts of datasets are being generated, collected, accumulated, and opened on the web by various public institutions providing useful and public information. In order to analyse, gain useful insights and information from data, Formal Concept Analysis(FCA) has been successfully used for analyzing, classifying, clustering and visualizing data based on the binary relation between objects and attributes in the dataset. In this paper, we present an approach for enhancing the analysis of relational attributes of data within the extended framework of FCA, which is designed to classify, conceptualize and visualize sets of objects described not only by attributes but also by relations between these objects. By using the proposed tool, RCA wizard, several experiments carried out on some public open datasets demonstrate the validity and usability of our approach on generating and visualizing conceptual hierarchies for extracting more useful knowledge from datasets. The proposed approach can be used as an useful tool for effective data analysis, classifying, clustering, visualization and exploration.

• Proceedings of the Korea Database Society Conference
• /
• 1997.10a
• /
• pp.483-503
• /
• 1997

One important question that arises when dealing with temporal databases in context of object-oriented systems is the method that associates time with attributes relationship semantics. Results of previous work about attribute versioning, particularity extending flat(First Normal Form: FNF) or nested(Non-First Normal Form: NFNF) relational models. are not applicable to temporal object-oriented databases. This is because object-oriented models provide more powerful constructs than traditional models for structuring complex objects. Therefore, this paper presents an formal approach for incorporating temporal extension to object-oriented databases. Our goal in this paper is to study temporal object-oriented database representation according to generalization, aggregation and association among objects. We define tile concepts of attribute versioning in temporal object-oriented model, and we concentrate on the representation of temporal relationship among objects. Another contribution of this paper is to specify time constraints on relationship semantics and analyze our model based on representation criteria. By means of formalizing tile temporal object oriented model, this paper can not only provide tile robust operating functions that design algebraic operators, but also entrance the reuse of modules.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1231-1246
• /
• 2006

HTML is a format for rendering Web documents visually and uses tables to present a relational information. Since HTML has limits in terms of information processing and management by a computer, it is important to transform HTML tables into XML documents, which is able to represent logical structure information. As a prerequisite for extracting information from the Web, this paper presents an efficient method for extracting logical structures from HTML tables and transforming them into XML documents. The proposed method consists of two phases: Area segmentation and structure analysis. The area segmentation step removes noisy areas and extracts attribute and value areas through visual and semantic coherency checkup. The hierarchical structure between attribute and value areas are analyzed and transformed into XML representations using a proposed table model. Experimental results with 1,180 HTML tables show that the proposed method performs better than the conventional method, resulting in an average precision of 86.7%.

• Journal of Korean Library and Information Science Society
• /
• v.52 no.1
• /
• pp.109-128
• /
• 2021

This paper is to explore considerations in authority control to accommodate LRM nomen entities through the literature reviews, the analysis of RDA rules, and the opinion survey of domestic catalog experts. As a result, for authority control, considerations were proposed in the aspect of nomen's attribute elements, catalog description, and MARC authority format. First, it is necessary to describe in as much detail as possible the category, the scheme, intended audience, the context of use, the reference source, the language, the script, the script conversion as the attributes of the nomen with the status of identification, note, and indifferentiated name indicators added in RDA. Second, the description method of attribute elements and relational elements of nomen can be unstructured, structured, identifier, and IRI as suggested in RDA, and vocabulary encoding scheme (VES) and string encoding scheme (SES) should be written for structured description, Also, cataloging rules for structuring authorized access points and preferred names/title should be established. Third, an additional expansion plan based on Maxwell's expansion (draft) was proposed in order to prepare the MARC 21 authority format to reflect the LRM nomen. (1) The attribute must be described in 4XX and 5XX so that the attribute can be entered for each nomen, and the attributes of the nomen to be described in 1XX, 5XX and 4XX are presented separately. (2) In order to describe the nomen category, language, script, script conversion, context of use, and date of usage as a nomen attribute, field and subfield in MARC 21 must be added. Accordingly, it was proposed to expand the subfield of 368, 381, and 377, and to add fields to describe the context of use and date of usage. The considerations in authority control for the LRM nomen proposed in this paper will be the basis for establishing an authority control plan that reflects LRM in Korea.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.137-139
• /
• 2000

본 논문에서는 차세대 DBMS로 각광을 받고 있는 객체-관계형 DBMS(Object-Relational DBMS : ORDBMS)기반의 데이터 웨어하우스(data warehouse)에서 질의 처리의 성능을 향상시키는 AH(Attribute Hierarchy) 인덱스와 이를 이용한 질의 처리 기법을 제안한다. 지금까지 관계 DBMS를 이용한 데이터 웨어하우스의 성능 향상에 관한 연구는 거의 이루어지지 않고 있다. 데이터 웨어하우스는 기존의 데이터베이스와는 비교할 수 없을 만큼의 대용량 데이터를 가정하므로 ORDBMS를 이용하여 데이터 웨어하우스를 구축하는 경우에서도 적절한 성능의 보장이 필수적으로 요구된다. 이 논문에서 제안된 AH 인덱스를 사용함으로써 데이터 웨어하우스 분석용 질의에서 자주 사용되는 조인과 그루핑 연산은 비용이 저렴한 인덱스 액세스 연산으로 대치되며, 데이터의 량과 무관하게 질의 처리비용이 거의 고정되는 효과를 얻을 수 있다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.1
• /
• pp.38-43
• /
• 2004

We designed and implemented a medical image query system, including a relational database and DBMS (database management system), which can visualize image data and can achieve spatial, attribute, and mixed queries. Image data used in querying can be visualized in slice, MPR(multi-planner reformat), volume rendering, and overlapping on the query system. To reduce spatial cost and processing time in the system. brain images are spatially clustered, by an adaptive Hilbert curve filling, encoded, and stored to its database without loss for spatial query. Because the query is often applied to small image regions of interest(ROI's), the technique provides higher compression rate and less processing time in the cases.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.65
• /
• pp.41-50
• /
• 2001

Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and intercluster similarity is minimized. The discovered clusters from clustering process are used to explain the characteristics of the data distribution. In this paper we propose a new methodology for clustering related transactions with categorical attributes. Our approach starts with transforming general relational databases into a transactional databases. We make use of inter-dimensional association rules for composing hypergraph edges, and a hypergraph partitioning algorithm for clustering the values of attributes. The clusters of the values of attributes are used to find the clusters of transactions. The suggested procedure can enhance the interpretation of resulting clusters with allocated attribute values.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2014.08a
• /
• pp.135-141
• /
• 2014

본 연구는 법률명 용어의 의미적 성분분석을 통해 '보충적 관계속성'을 도출하고, 이를 구조적 용어사전의 관계속성 설정에 적용하였을 때 용어관계에 나타나는 효과를 확인하는 것을 목적으로 한다. '보충적 관계속성'이란 클래스(범주)별 용어들이 가지는 특징에 기반하여 만든 관계속성을 말하며, 용어사전 구축 시 도출한 관계속성을 반영함으로서 용어 간 관계가 유기적이고 명확하게 표현될 수 있도록 하는 보조적 구축지침의 역할을 하도록 한다. 이를 위해 법원도서관 '법률용어 관련어집의 316개 용어쌍을 분석하여 '보충적 관계속성'을 도출하였으며, 구조적 용어사전 용어에 적용하여 밀도 값과 밀도의 정도를 시각화하여 효과를 확인하였다. 그 결과, '보충적 관계속성' 전, 후의 변화는 적었으나 이는 법률명 용어의 특징으로 인한 결과라는 것을 알 수 있었고, '보충적 관계속성' 반영의 명확한 효과 확인을 위해서는 분석대상용어를 법률명에서 법률관련용어로 확장시켜 연구할 필요성을 확인하였다.

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

In order to provide various business analysis methods, OLAP(On-Line Analytical Processing) systems represent their data with multidimensional structures. These multidimensional data are often delivered to users in the horizontal format of tables whose columns are corresponding to values of dimension attributes. Since the horizontal tables nay have a large number of columns, they cannot be stored directly in relational database systems. Furthermore, the tables are likely to have many null values (i.e., sparse tables). In order to manage the horizontal tables efficiently, we can store them as the vertical format of tables which has dimension attribute names as their columns thus transforms the columns of horizontal tables into rows. In this way, every queries for horizontal tables have to be transformed into those for vertical tables. This paper proposed a technique for transforming horizontal table queries into vertical table ones by utilizing not only traditional relational algebraic operators but also the PIVOT operator which recent DBMS versions are providing. For achieving this goal, we designed a relational algebraic expression equivalent to the PIVOT operator and we formally proved their equivalence. Then, we developed a transformation technique for horizontal table queries using the PIVOT operator. We also performed experiments to analyze the performance of the proposed method. From the experimental results, we revealed that the proposed method has better performance than existing methods.