• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2007.11a
• /
• pp.301-305
• /
• 2007

Mapping of EXPRESS, which is object-favored language to represent IFC model, to Relational Database is not straightforward. Model size can be much bigger and data can be missed through process. However mapping to the object concept added database, such as Object Oriented Database or Object Relational Database, may be simpler and have lots of advantages. This study investigates previous IFC mapping studies, concept of Relational Database and Object Oriented Database, and mapping methodology to Object Relational Database using object.

• Journal of Internet Computing and Services
• /
• v.12 no.6
• /
• pp.149-159
• /
• 2011

The current applications can be characterized as consisting of complex objects related by complex relationship. Therefore the relational database has been extended to object-relational database because of the complex objects. Accordingly, we need database design methodology for object-relational database. In this pager, we develop an integrated design methodology based on a extended UML class diagram for object-relational database. We make the extend UML class diagram by adding new stereotypes for object-relational database. Also we propose a guideline for transforming the extended UML class diagram to object-relational database schema. We use SQL:1999 as a object-relational data model and Oracle11g as a target object-relational database. We can build more easily and efficiently object-relational database for Oracle11g by using our methodology. Finally we applied our methodology on a computer classroom reservation system for evaluation the methodology.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.1997-2007
• /
• 2000

This paper presents a new benchmark for object-relational database systems, which are regarded as the next-generation database system. This benchmark has been developed to evaluate system performance peculiar to object-relational database systems. The design philosophy, test databases, an test queries of the benchmark are presented. This benchmark features scaleability, use of a synthesized database only, and a query-oriented evaluation. We have implemented his benchmark with two commerical object-relational database systems and the experimental results are also reported.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1604-1609
• /
• 2004

We have to convert XML DTD into relational database schema for storing XML Document at relational database. Hybrid inlining algorithm are used for converting XML DTD to relational database schema. But this method have some problem. That is the relational database schema have N:N relationship are created according this method are not satisfied with third normal from. Therefore, We proposed Extended Hybrid inlining algorithm for solving this problem in this paper.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.139-158
• /
• 1995

A temporal database systems provides timing information and maintains history of data compared to the conventional database system. In this paper, we present a temporal relational database which use an interval-stamping method for instant-based events and for interval-based states. A set of temporal algebraic operators are developed on an instance of time and interval of time so that we can manipulate events and states at a same time. The set of operation is the basis for creating a relational algebra that is closed for temporal relations. And temporal SQL is also suggested as a temporal query relational language for our algebraic operations on temporal relations.

• The Journal of Society for e-Business Studies
• /
• v.8 no.1
• /
• pp.85-102
• /
• 2003

Nowadays an information exchange on XML such as B2B electronic commerce is spreading. Therefore the systematic and stable management mechanism for storing the exchanged information is needed. For this goal there are many research activities for connection between XML application and relational database. But because XML data have hierarchical structures and relational database can store only flat-structured data, we need to make the conversion rule which changes the hierarchical architecture to 2-dimensional information. Accordingly the modeling methodology for storing each structured information in relational database is needed. In this paper, we introduce a XML modeling methodology to design W3C XML schema using UML and we propose a unified design methodology for relational database schema to store XML data efficiently in relational databases. In the second place, in order to verify objectivity of a unified design methodology. By the way of Ronald Bourret, First we introduce the method of the transformation from XML schema to object model and second we translate object model into relational database schema. Therefore we show the mutual consistency between those consequence, and so can verify a unified design methodology.

• The Journal of Society for e-Business Studies
• /
• v.7 no.1
• /
• pp.153-166
• /
• 2002

Nowadays an information exchange on Bn such as B2B electronic commerce is spreading. Therefore the systematic and stable management mechanism for storing the exchanged information is needed. For this goal there are many research activities for connection between XML application and relational database. But because XML data have hierarchical structures and relational database can store only flat-structured data, we need to store XML data in object-relational database that support hierarchical structure. Accordingly the modeling methodology for storing XML data in object-relational database is needed. In order to build good quality application systems, modeling is an important first step. In 1997, the OMG adopted the UML as its standard modeling language. Since industry has warmly embraced UML its popularity should become more important in the future. So a design methodology based on UML is need to develop efficiently XML applications. In this paper, we propose a unified design methodology for In applications based on object-relational database using In. To this goal, first we introduce a XML modeling methodology to design W3C XML schema using UML and second we propose data modeling methodology for object-relational database schema to store efficiently XML data in object-relational databases.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.14-24
• /
• 2004

Views are essential in providing logical data independence for database systems. Object views in object-oriented/object-relational databases have requirements quite different from those of relational databases due to support for object-oriented concepts. Although many commercial object-oriented/object-relational database systems support object views, implementation techniques have not been discussed sufficiently in the literature. In this paper, we devise a technique for implementing views in object-oriented/object-relational databases and apply it to the ODYSSEUS object-relational database system. We first analyze the requirements of object views. Next, to implement object views, we extend the existing query modification algorithm that has been proposed for implementing views in relational databases. Next, we compare the features of the proposed object view with those of object views in commercial object-relational database systems. It is shown that the proposed object view supports all object-oriented concepts such as object identifiers, inheritance, methods, and composite objects, while existing object views support part of them. Last, we propose detailed techniques for implementing the extended query modification algorithm in the ODYSSEUS object-relational database system.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2007.02a
• /
• pp.163-167
• /
• 2007

We propose an XML document storage system, called XDMS (XML Document Management System), by using an object-relational DBMS. XDMS generates object database schema from XML Schema and stores the XML documents in an object-relational database. SAX parser is used for understanding the structure of the XML documents, and XDMS transforms the documents into objects in the database. Experiment shows that object-relational databases provide more efficient storage and query model compared with relational databases.

• Journal of Computing Science and Engineering
• /
• v.5 no.3
• /
• pp.183-196
• /
• 2011

There has recently been a surge of interest in relational database mining that aims to discover useful patterns across multiple interlinked database relations. It is crucial for a learning algorithm to explore the multiple inter-connected relations so that important attributes are not excluded when mining such relational repositories. However, from a data privacy perspective, it becomes difficult to identify all possible relationships between attributes from the different relations, considering a complex database schema. That is, seemingly harmless attributes may be linked to confidential information, leading to data leaks when building a model. Thus, we are at risk of disclosing unwanted knowledge when publishing the results of a data mining exercise. For instance, consider a financial database classification task to determine whether a loan is considered high risk. Suppose that we are aware that the database contains another confidential attribute, such as income level, that should not be divulged. One may thus choose to eliminate, or distort, the income level from the database to prevent potential privacy leakage. However, even after distortion, a learning model against the modified database may accurately determine the income level values. It follows that the database is still unsafe and may be compromised. This paper demonstrates this potential for privacy leakage in multi-relational classification and illustrates how such potential leaks may be detected. We propose a method to generate a ranked list of subschemas that maintains the predictive performance on the class attribute, while limiting the disclosure risk, and predictive accuracy, of confidential attributes. We illustrate and demonstrate the effectiveness of our method against a financial database and an insurance database.