• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.53-63
• /
• 2011

Many techniques have been proposed to store and query XML data efficiently. One way achieving this goal is using relational database by transforming XML data into relational format. It is important to transform schema to preserve the content, the structure and the constraints of the semantics information of the XML document. Especially, key constraints are an important part of database theory. Therefore, the proposal technique has considered the semantics of XML as expressed by primary keys and foreign keys. And, the proposal technique can preserve not only XML data constraints but also the content and the structure and the semantics of XML data thru transformation process. Transforming information is the content and the structure of the document(the parent-child relationship), the functional dependencies, semantics of the document as captured by XML key and keyref constraints. Because of XML schema transformation ensures that preserving semantic constraints, the advantages of these transformation techniques do not need to use the stored procedure or trigger which these data ensures data integrity in the relational database. In this paper, there is not chosen the ID/IDREF key which supported in DTD, the inheritance relationship, the implicit referential integrity.

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

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.9-12
• /
• 2004

Developing an efficient knowledge base construction mechanism as an input method for expert systems (ES) development is of extreme importance due to the fact that an input process takes a lot of time and cost in constructing an ES. Most ES require experts to explicit their tacit knowledge into a form of explicit knowledge base with a full sentence. In addition, the explicit knowledge bases were composed of strict grammar and keywords. To overcome these limitations, this paper proposes a knowledge conceptualization and construction mechanism for automated knowledge acquisition, allowing an efficient decision. To this purpose, we extended traditional knowledge map (KM) construction process to dynamic knowledge map (DKM) and combined this algorithm with relational database (RDB). In the experiment section, we used medical data to show the efficiency of our proposed mechanism. Each rule in the DKM was characterized by the name of disease, clinical attributes and their treatments. Experimental results with various disease show that the proposed system is superior in terms of understanding and convenience of use.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.89-94
• /
• 2010

The most important of rule-base system is the knowledge base that determines the power of rule-base system. The important form of this knowledge is how to descript kinds of rules. The Rule-Base System (RBS) has been using in many field that need reflect quickly change of business rules in management system. As far, when develop the Rule-Based System, we must make a rule engine with a general language. There are three disadvantage of in this developed method. First, while there are many data that must be processed in the system, the speed of processing data will become very slow so that we cannot accept it. Second, we cannot change the current system to make it adaptive to changes of business rules as quickly as possible. Third, large data make the rule engine become very complex. Therefore, in this paper, we propose the two important methods of raising efficiency of Rule-Base System. The first method refers to using the Relational database technology to process the rules of the Rule-Base System, the second method refers to a algorithm of according to Quine McCluskey formula compress the rows of rule table. Because the expressive languages of rule are still remaining many problems, we will introduce a new expressive language, which is Rule-Base Data Model short as RBDM in this paper.

• Journal of Internet Computing and Services
• /
• v.20 no.5
• /
• pp.49-55
• /
• 2019

Organizations design and operate business process models to achieve their goals efficiently and systematically. With the advancement of IT technology, the number of items that computer systems can participate in and the process becomes huge and complicated. This phenomenon created a more complex and subdivide flow of business process.The process instances that contain workcase and events are larger and have more data. This is an essential resource for process mining and is used directly in model discovery, analysis, and improvement of processes. This event log is getting bigger and broader, which leads to problems such as capacity management and I / O load in management of existing row level program or management through a relational database. In this paper, as the event log becomes big data, we have found the problem of management limit based on the existing original file or relational database. Design and apply schemes to archive and analyze large event logs through Hadoop, an open source distributed file system, and HBase, a NoSQL database system.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.495-506
• /
• 2001

XML makes it possible for data to be exchanged regradless of the data model in which it is represented or the platform on which it is stored, serving as a standard for data exchange format on the internet. Especially, it is natural to send XML data without DTD on the internet when XML is data-centric. Therefore it is needed to extract relational schema to store XML data efficiently, to optimize queries, and to publish data which have been stored in the relational database in the XML format. In this paper, we proposed a method to generate relational database in the XML documents without DTD and store XML data using upper/lower bound schema extraction technique for semistructured data. In extracting a lower bound schema, we especially show an efficient technique for creating relational schema by using simulation with is more advanced than the datalog method.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.432-443
• /
• 2004

As the XML data has been widely used in the Internet, it is necessary to store and retrieve the XML data by using DBMSs. However, relational DBMSs suffer from the model difference between graph structure of the XML data and table forms in relational databases. We propose an ORDBMS-based DTD-dependent XML data management system Xing. Xing stores XML data in a DTD-dependent form in an object database. Since the object database schema has a graph structure and supports multi-valued attributes, mapping from an XML data model and queries into an object data model and OQLs is a simple problem. For rapid storing of large quantities of the XML data, we use SAX parser with customized Xing-tree which requires a small memory space compared with the DOM-tree. Xing also returns the query result in an XML document form. We have implemented the Xing system on top of UniSQL object-relational DBMS for the validity checking and performance comparison. For XML genome data from GenBank, and experimental evaluation shows that Xing can provide significant performance improvement (maximum 10 times) compared with the relational approach.

• Journal of Convergence for Information Technology
• /
• v.10 no.7
• /
• pp.41-48
• /
• 2020

Recently, the spreading business of AMI (Advanced Metering Infrastructure) remote metering systems in various regions of the country has been activated, and it provides various metering functions such as two-way communication and security plan functions for power demand management. Current AMI system is difficult to analyze based on the existing RDB(Relational Database) due to the increase in the size of new internal IoT devices and networks. This study proposes a new GDB(Graph Database) based failure analysis method that utilizes existing RDB data. It analyzes the correlation of new failure patterns through accumulated data such as internal thresholds and status values. As a result of GDB-based simulation, it was confirmed that RDB can predict to a new obstacle pattern that was difficult to analyze.

• Journal of Korean Society of Forest Science
• /
• v.88 no.1
• /
• pp.63-72
• /
• 1999

In this study, a relational database program to manage the data involved in forest planning was developed in such a way to simulate the whole process of 'Younglim' planning in Korean National Forest System. Using the pull-down menu system of various functions required for developing 'Younglim' plan, the database program can handle the data of forest inventory, 10-year working plans, annual working plans and the history of forest operations automatically and simultaneously. The model was designed to run under the environment of Korean version of Windows 95. Visual Basic 5.0 was used as the basic tool for programming and Microsoft ACCESS as the basic engine of the database system. In this paper, the process of designing the structure of database program following the process of 'Younglim' plan and the structure of the model are discussed. In addition, the functions of menu system are presented using the screen-mode output windows of the model.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.3
• /
• pp.143-156
• /
• 1998

This paper reports the GEM (Gateway to Educational Materials) project whose goal is to develop an operational framework to provide the K-12 teachers in the world with 'one-stop/any-stop' access to thousands of lesson plans, curriculum units and other Internet-based educational resources. To the IS-element Dublin Core base package, the GEM project added an 8-element, domain-specific GEM package. The GEM project employed the conceptual data modeling approach to designing the GEM database, used the Sybase relational database management system (RDBMS) to construct the backend database for storing the metadata of educational resources, and also employed the active server page (ASP) technology to provide Web interfaces to that database. The consortium members catalog lesson plans and other Internet-based educational resources using a cataloging module program that produces HTML meta tags. A harvest program collects these meta tags across the Internet and outputs an ASCII file that conforms to the standard agreed by the consortium members. A parser program processes this file to enter meta tags automatically into appropriate relational tables in the Sybase database. The conceptual/logical schemas of Dublin Core and GEM profile are presented. The advantages of conceptual modeling approach to manage metadata are discussed. A prototype system that provides access to the GEM metadata is available at http://lis.skku.ac.kr/gem/.