• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.128-133
• /
• 1998

This paper aims to present some ideas for implementation of Uncertain Relational Databases (URD) which are extensions of classical relational databases. Our system firstly is based on possibility distribution and probability theory to represent and manipulate fuzzy and probabilistic information, secondly adopts flexible mechanisms that allow the management of uncertain data through the resources provided by both available relational database management systems and front-end interfaces, and lastly chooses dynamic SQL to enhance versatility and adjustability of systems.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1385-1395
• /
• 2016

In the era of Big Data, NoSQL databases provide solutions for problems, circumventing the limitations of traditional relational databases by using new architectures and data model. Contrary to relational database products, the range of the features architectures, and limitations of NoSQL databases is very broad. Thus, choosing the right database products requires more considerations and difficulties. The advent of NoSQL does not only promote the abundance of NoSQL products, but also stimulates the relational database realm to expand their features beyond the relational model. In order to understand NoSQL trends more accurately, here we discuss and compare NoSQL databases with relational databases. We also present the newest features associated with NoSQL in one of the most advanced open-source relational databases, PostgreSQL. To discuss future directions for PostgreSQL we analyzed the performance of NoSQL and PostgreSQL by conducting experiments using the NoSQL benchmark tool (YCSB).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.7-13
• /
• 2015

Generally, watermarking can be used copyright for contents such as audios, videos, images, and texts. With the development of Internet, many malicious attackers illegally copy relational databases synchronized applications Therefore, it is needed for the protection of databases copyright, because databases involve various sensitive information such as personal information, information industry, and secret national intelligence. Thus, the protection of relational databases is a major research field in the databases research topics. In this paper, we will review previous researches related the protection of relational databases and propose new method for relational data. Especially, we propose watermarking scheme for databases using reversible method in this paper. As an experimental result, the proposed scheme is very strong to malicious attacks. In addition, we proved our proposed scheme is to apply real application.

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

• Journal of Digital Contents Society
• /
• v.10 no.1
• /
• pp.129-145
• /
• 2009

As the secure distribution and sharing of information over the World Wide Web becomes increasingly important, the needs for flexible and efficient support of access control systems naturally arise. Since the eXtensible Markup Language (XML) is emerging as the de-facto standard format of the Internet era for storing and exchanging information, there have been recently, many proposals to extend the XML model to incorporate security aspects. To the lesser or greater extent, however, such proposals neglect the fact that the data for XML documents will most likely reside in relational databases, and consequently do not utilize various security models proposed for and implemented in relational databases. In this paper, we take a rather different approach. We explore how to support security models for XML documents by leveraging on techniques developed for relational databases considering object perspective. More specifically, in our approach, (1) Users make XML queries against the given XML view/schema, (2) Access controls for XML data are specified in the relational database, (3) Data are stored in relational databases, (4) Security check and query evaluation are also done in relational databases, and (5) Controlling access control is executed considering XML tree levels

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5888-5903
• /
• 2019

The Relational ranking method applies authority-based ranking in relational dataset that can be modeled as graphs considering also their tuples' values. Authority directions from tuples that contain the given keywords and transfer to their corresponding neighboring nodes in accordance with their values and semantic connections. From our previous work, ObjectRank extends to ValueRank that also takes into account the value of tuples in authority transfer flows. In a maked difference from ObjectRank, which only considers authority flows through relationships, it is only valid in the bibliographic databases e.g. DBLP dataset, ValueRank facilitates the estimation of importance for any databases, e.g. trading databases, etc. A relational keyword search paradigm Object Summary (denote as OS) is proposed recently, given a set of keywords, a group of Object Summaries as its query result. An OS is a multilevel-tree data structure, in which node (namely the tuple with keywords) is OS's root node, and the surrounding nodes are the summary of all data on the graph. But, some of these trees have a very large in total number of tuples, size-l OSs are the OS snippets, have also been investigated using ValueRank.We evaluated the real bibliographical dataset and Microsoft business databases to verify of our proposed approach.

• International Journal of Reliability and Applications
• /
• v.3 no.4
• /
• pp.155-164
• /
• 2002

This paper focuses on how modem data mining can be integrated with real-time relational databases and commercial data warehouses to improve reliability in real-time. An important Issue for many manufacturers is the development of relational databases that link key product attributes with real-time process parameters. Helpful data for key product attributes in manufacturing may be derived from destructive reliability testing. Destructive samples are taken at periodic time intervals during manufacturing, which might create a long time-gap between key product attributes and real-time process data. A case study is briefly summarized for the medium density fiberboard (MDF) industry. MDF is a wood composite that is used extensively by the home building and furniture manufacturing industries around the world. The cost of unacceptable MDF was as large as 5% to 10% of total manufacturing costs. Prevention can result In millions of US dollars saved by using better Information systems.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.223-225
• /
• 2013

For a long time, Relational Databases have been widely used in many enterprises. Even though the Relational Databases have merits such as excellent power of data preservation, concurrency controlling as a standard model in databases, there are a demerit in the inconsistency of objects and relations. Against this backdrop, NoSQL is being magnified as a new solution for Big Data since it can be operated without any schema. In this paper, we research on not only merits and demerits of Relational Databases but also the comparison between application databases and integrated databases. And then, we define NoSQL for Big Data and check its characteristics.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.1-11
• /
• 2004

In this paper. we propose a storage system for XML documents using relational databases. Additional processing is required to store XML documents in the relational databases due to the discrepancy between XML structures and relational schema. This study aims to store XML documents with DTD in the relational databases. We propose the association inlining that exploits shred inlining and hybrid inlining and avoids relation fragments and excessive joins. Experiments show some improvements in the performance with the proposed method. The information of the storage structures is extracted from the simplified DTD. Existing map classes are extended in order to map various structures of XML to relational schema. Map classes are defined for various structures such as elements with multiple values, elements with multiple super elements, and elements with recursive structures through analyzing XML documents. Map files that are XML structures and used in generating SQL statements are created by using the extracted information of storage structures and map classes.