• Journal of Computing Science and Engineering
• /
• v.4 no.4
• /
• pp.276-290
• /
• 2010

The join operator is fundamental in relational database systems. Evaluating join queries on large tables is challenging because records need to be efficiently matched based on a given key. In this work, we analyze join queries in SQL with large tables in which a foreign key may be null, invalid or valid, given a referential integrity constraint. We conduct an extensive join performance evaluation on three DBMSs. Specifically, we study join queries varying table sizes, row size and key probabilistic distribution, inserting null, invalid or valid foreign key values. We also benchmark three well-known query optimizations: view materialization, secondary index and join reordering. Our experiments show certain optimizations perform well across DBMSs, whereas other optimizations depend on the DBMS architecture.

• Asia pacific journal of information systems
• /
• v.5 no.2
• /
• pp.131-142
• /
• 1995

In distributed database systems materialized views are useful to solve many problems caused by data replication. This paper deals with the problem of updating materialized views incluing join operations. We use a differential update which uses logs that record the change of base tables in certain periods. This method avoids locking of the base tables so that it makes the system more efficient. We update materialized views periodically to save the updating cost envolved. A screen test is applied to differential files to eliminate tuples that are irrelevant to any of the views being updated. Using these methods, a detailed procedure is addressed to refresh materialized views. Then we show that our update procedure performs better than a semijoin approach.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.45-50
• /
• 2001

Recently, the advent or WWW widely increased computer-mediated instruction and a majority of Web-based instruction lack interactive capabilities. In this study. we propose a adaptive Web-based courseware model with learner's motivates and design database tables in order to apply using button theory. Therefore, we design database tables which is diagnosed learner's status within each windows with contents for checking motivation to learn itself via Web-based cyber instruction.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.4
• /
• pp.274-278
• /
• 2007

As XML becomes the standard of digital data exchange format we need to manage a lot of XML data effectively. Unlike tables in relational model XML documents are not structural. That makes it difficult to store XML documents as tables in relational model. To solve these problems there have been significant researches in relational database systems. There are two kinds of approaches: 1) One way is to decompose XML documents so that elements of XML match fields of relational tables. 2) The other one stores a whole XML document as a field of relational table. In this paper we adopted the second approach to store XML documents because sometimes it is not easy for us to decompose XML documents and in some cases their element order in documents are very meaningful. We suggest an efficient table schema to store only inverted index as tables to retrieve required data from XML data fields of relational tables and shows SQL translations that correspond to XML full-text retrievals. The functionalities of XML retrieval are based on the W3C XQuery which includes full-text retrievals. In this paper we show the superiority of our method by comparing the performances in terms of a response time and a space to store inverted index. Experiments show our approach uses less space and shows faster response times.

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.4
• /
• pp.693-701
• /
• 2020

In this paper, SQL statements are analyzed to improve database performance in the current course registration system. The performance of the current database was measured through the execution plan of the SQL statements used in the transactions related to the course registration. Through the SQL analysis, the complemented SQL statements confirmed the improved performance. Overall, the performance of the course registration database system was improved through the analysis of the execution plan, and some improvement methods of the course registration SQL were shown as test results. The improved method is to reorganize the tables and index tables related to the course registration through database tuning, and utilize the SQL function to implement an optimized system that has evolved into a course database system with improved performance. The enrollment system re-adjusted by the proposed method showed excellent results in terms of performance compared to the previous enrollment system, and the integrated performance test result reduced the response time by 1.8 to 18 times.

• Korean Journal of Artificial Intelligence
• /
• v.1 no.1
• /
• pp.1-3
• /
• 2013

This study suggested ways to control UML diagram and to make design of database and to retrieve diagram information by giving questions. The study classified elements of the diagram. For instance, class diagram was made of classes, and class was done of class name and attribute operator. The elements were transformed to be database table having basic key and foreign key information. The ways suggested had advantages of users' sharing of model information and reuse of the model. This study investigated cost saving, time saving and UML model construction by database. We had designed integrated and relation database that could save and manage UML diagram, and suggested retrieval. For instance, we classified class diagram into elements to make tables and kept relation of each element by using not only basic key of relation database but also foreign key information. We made database of modeling depending upon methods to give users convenience.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.999-1008
• /
• 2002

XML is emerging as a standard data format to exchange and to present data on the Web. There are increasing needs to efficiently store and to query XML data. In this paper. we propose a new schema transformation algorithm based on a common structure extracting technique from XML documents. The common structure is shared by all XML documents referenced by DTD and the uncommon structure is ununiformly appeared on all XML documents referenced by DTD. Based on the extracted common and uncommon structures, we transform XML DTD into relational database schema. We conduct a performance evaluation based on the number of the generated tables, the size of the record, query processing time and the number of joins on the query. The performance of our algorithm is compared with the existing algorithms, then in most cates, our algorithm is better than the existing ones with respect to the number of the generated tables and appearance of NULL values in the tables.

• Journal of the Korea Institute of Building Construction
• /
• v.11 no.3
• /
• pp.247-255
• /
• 2011

Currently, there is database for per unit requirements of major construction materials in terms of energy consumption and $CO_2$ emission based on the input-output table published by the Bank of Korea in 2000, but no database for per unit requirements based on input-output tables was published in 2005 and 2007. The purpose of this study was to calculate the unit requirement values of major construction materials in terms of energy consumption and $CO_2$ emission generated by using the input-output tables published in 2005 and 2007. To estimate the unit requirement values, a database building method with the input-output tables was adopted by selecting 16 types of construction materials in wide use on construction sites. When the study results were compared with existing unit requirement values based on the input-output table of 2000, there were small discrepancies, from which it can be interpreted that the method used in the study is reasonable. Unit requirement values estimated based on input-output tables of 2005 and 2007 tended to decrease, and the highest value of energy consumption and $CO_2$ emission were found in the materials using cement and rebar.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.347-357
• /
• 2002

Graphs have provided a powerful methodology to solve a lot of real-world problems, and therefore there have been many proposals on the graph representations and algorithms. But, because most of them considered only memory-based graphs, there are still difficulties to apply them to large-scale problems. To cope with the difficulties, this paper proposes a graph representation and graph algorithms based on the well-developed relational database theory. Graphs are represented in the form of relations which can be visualized as relational tables. Each vertex and edge of a graph is represented as a tuple in the tables. Graph algorithms are also defined in terms of relational algebraic operations such as projection, selection, and join. They can be implemented with the database language such as SQL. We also developed a library of basic graph operations for the management of graphs and the development of graph applications. This database approach provides an efficient methodology to deal with very large- scale graphs, and the graph library supports the development of graph applications. Furthermore, it has many advantages such as the concurrent graph sharing among users by virtue of the capability of database.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.3
• /
• pp.43-49
• /
• 2012

Information obtained from DFD(Data Flow Diagram) are very important in system maintenance, because most legacy systems are analyzed using DFD in structured analysis. In our thesis, we design and implement an extractor for design sequence of database tables using DFD. Our extractor gets DFDs as input data, transform them into a directed graph, and extract design sequence of DB tables. We show practicality of our extractor by applying it to a s/w system in operation.