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

• Journal of Information Technology Applications and Management
• /
• v.16 no.4
• /
• pp.245-261
• /
• 2009

Since XML emerged as a standard for data exchange on the web, it has been widely used for applications like e-Commerce, CRM, and BI. However, it is common that most of business data is stored in relational database systems, and it is expected that business data management would still be centered around the relational database systems. As such, the technique of viewing relational data as XML and processing XML queries against it is required. To meet such a need, in the SQL/XML standard, the functions to publish relational data as XML are provided. In this paper, we propose the techniques of providing an XML view of relational data defined by an SQL/XML statement in DTD(Document Type Definition), and of processing XPath queries against the XML view by translating them into SQL/XML statements, and describe the validation of such techniques through implementation and tests.

• The Journal of Information Technology and Database
• /
• v.1 no.1
• /
• pp.9-30
• /
• 1994

The objective of this paper is to give a brief review of relational design methodology, and show how a relational schema can be converted into an object-relational schema. We first introduce relational terminology and describe the relational design process along with its limitations. Next we show how the relational model can be extended to overcome these limitations : these extensions form the core of an object-relational data model ; we use the UniSQL/X data model as an example. We illustrate the process or converting a relational schema into an object-relational schema, and show the benefits of this conversion with respect to queries. The conversion process is then summarized as a set of guidelines. Finally, we make our conclusions.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.615-616
• /
• 2014

Currently, XML is a standard language used to exchange data. Most of the data in the file system is not stored in the database system. The data stored in an object-oriented database, the data can be represented by a hierarchical structure. However, in the case of a relational database table, each independently of the hierarchical structure data is present can not be expressed. In this paper, a hierarchical representation of data is difficult in traditional relational database without changing the data in the database, without having to build a new database, Define the structure of the existing data in the XML document for the automatic generation of a PL / SQL procedure is designed.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09b
• /
• pp.49-52
• /
• 2003

In this research, we propose a mechanism to develop an inference engine and expert systems based on relational database and SQL (structured query language). Generally, former researchers had tried to develop an expert systems based on text-oriented knowledge base and backward/forward (chaining) inference engine. In these researches, however, the speed of inference was remained as a tackling point in the development of agile expert systems. Especially, the forward inference needs more times than backward inference. In addition, the size of knowledge base, complicate knowledge expression method, expansibility of knowledge base, and hierarchies among rules are the critical limitations to develop an expert systems. To overcome the limitations in speed of inference and expansibility of knowledge base, we proposed a relational database-oriented knowledge base and forward inference engine. Therefore, our proposed mechanism could manipulate the huge size of knowledge base efficiently, and inference with the large scaled knowledge base in a short time. To this purpose, we designed and developed an SQL-based forward inference engine using relational database. In the implementation process, we also developed a prototype expert system and presented a real-world validation data set collected from medical diagnosis field.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.5
• /
• pp.117-126
• /
• 2016

Recently, increasing utilization of Big Data or Social Network Service involves the increases in demand for NoSQL Database that overcomes the limitations of existing relational database. A forensic examination of Relational Database has steadily researched in terms of Digital Forensics. In contrast, the forensic examination of NoSQL Database is rarely studied. In this paper, We introduce Redis (which is) based on Key-Value Store NoSQL Database, and research the collection and analysis of forensic artifacts then propose recovery method of deleted data. Also we developed a recovery tool, it will be verified our recovery algorithm.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.123-130
• /
• 2001

As the growth of database volume, it has required a need and an opportunity of data analysis and extracting knowledge from database. Data mining method is the representative example. The size of most minable data set is huge, and stored in a database. To implement effective mining function, we must extract minable data set to be analyzed from existing relational database, and it must be managed with its generalized information. In this paper, the new mining operator is defined in a similar manner to the existing SQL operators and SQL is extended to extract data subset from relations and to generalize it using domain-oriented method. The background knowledge includes attribute values, which will be mind and generalized information, and it is managed as the same structure with a relation in relational database. These functions are implemented by defining some SQL - like operators and aggregated functions, and we describe the expressive powers of these new operators and functions through examples.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.27-33
• /
• 2010

One of the most critical success factor in introducing and operating an integrated information system is the performance management. In this study, we propose some SQL tuning techniques, applicable to optimize the performance of relational database systems. We showed effectiveness of the techniques by applying to a database system of a medium scale company.

• Journal of Internet Computing and Services
• /
• v.25 no.3
• /
• pp.35-41
• /
• 2024

As online activities have rapidly increased due to recent digital changes and the impact of COVID-19, the importance of large-scale data processing and maintenance is increasing. This study compares the performance of the two main types of databases widely used for data storage and management: Relational Database Management Systems (RDBMS) and Non-Relational Databases (NoSQL). Specifically, we measured and evaluated the execution time of data insertion, query, and deletion functions using MySQL, a representative example of RDBMS, and Redis, a representative example of NoSQL. The experimental results showed that Redis showed performance about 5.84 times faster in data insertion, 6.61 times faster in query, and 12.33 times faster in deletion than MySQL. These results demonstrate that Redis provides superior performance, especially in environments requiring large-scale data processing and maintenance. Therefore, companies and online service providers can choose NoSQL databases such as Redis to ensure more efficient data management solutions. We hope this study will be an essential reference when selecting a database based on data processing performance.