• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.357-368
• /
• 2007

This paper proposes the SAMD(Synchronization Algorithms based on Message Digest) algorithm based on message digest in order to data synchronization between a database server and a mobile database. The SAMD algorithm makes the images at the database server and the mobile database using message digest tables and compares two images in order to select the rows needed to synchronization. If two images are different, the synchronization is progressed according to synchronization policy. The SAMD algorithm does not use techniques which are dependent the some database vendor and also triggers, stored procedures and timestamps. The SAMD only uses the standard SQL functions for the synchronization. Therefore the SAMD algorithm is used in any combinations of the database server and the mobile database because the SAMD algorithm is not depended on some database venders. Also the SAMD algorithm shows better performance compared with existing synchronization products.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.9
• /
• pp.371-376
• /
• 2015

The Internet of Things (IoT) significantly increases the amount of data. Database compression is important for big data because it can reduce costs for storage systems and save I/O bandwidth. However, it could show low performance for write-intensive workloads such as OLTP due to the updates of compressed pages. In this paper, we present practical guidelines for the performance improvement of database compression. Especially, we propose the SELECTIVE strategy, which compresses only tables whose space savings are close to the expected space savings calculated by the compressed page size. Experimental results using the TPC-C benchmark and MySQL show that the strategy can achieve 1.1 times better performance than the uncompressed counterpart with 17.3% space savings.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.197-214
• /
• 1996

Financial analysis of stock data usually involves extensive computation of large amount of time series data sets. To handle the large size of the data sets and complexity of the analyses, database management systems have been increasingly adaopted for efficient management of stock data. Specially, relational database management system is employed more widely due to its simplistic data management approach. However, the normalized two-dimensional tables and the structured query language of the relational system turn out to be less effective than expected in accommodating time series stock data as well as the various computational operations. This paper explores a new data management approach to stock data management on the basis of an object-oriented database management system (ODBMS), and proposes a data model supporting times series data storage and incorporating a set of financial analysis functions. In terms of functional stock data analysis, it specially focuses on a primitive set of operations such as variance of stock data. In accomplishing this, we first point out the problems of a relational approach to the management of stock data and show the strength of the ODBMS. We secondly propose an object model delineating the structural relationships among objects used in the stock data management and behavioral operations involved in the financial analysis. A prototype system is developed using a commercial ODBMS.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.2
• /
• pp.98-107
• /
• 2003

The purpose of this study is to propose the schema for process repository that overcomes the limitations of existing process repositories in which it is not easy to compare and analyze such the unstructured data as a process model. To achieve this goal, the previous studies on process repository are reviewed, the schema for process repository is designed, and the tables for relational database are created. For the validation of the schema presented in this paper, the process model stored in relational database is examed using SQL. The contributions of this study are as follows. First, the schema for process repository storing process models is designed and validated. Second, the process model created by the new schema and stored in relational database leads to improve the performance of process analysis.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.192-201
• /
• 2007

This paper is a study on constructing a natural language interface to database, concentrating on generating textual answers. TGEN, a system that generates textual answer from query result tables is presented. The TGEN architecture guarantees its portability across domains. A combination of a frame-based approach and natural language generation techniques in the TGEN provides text fluency and text flexibility. The implementation result shows that this approach is feasible while a deep NLG approach is still far to be reached.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.555-558
• /
• 2003

본 연구는 이동 전화나 PDA와 같은 모바일 단말기를 이용하는 무선 인터넷 환경에서 데이터베이스 테이블로부터 Java 객체를 생성하여 이들 중간 형태인 XML 문서로 출력하고, 이러한 XML 문서들을 다시 XML 파서와 XSLT 처리기를 통해 무선 단말기에 적합한 마크업 언어 파일을 생성하여 단말기로 전송한다. 이를 통해 기존의 유선 인터넷상의 HTML 컨덴츠뿐만 아니라 데이터베이스 등 다른 정보들도 실시간으로 접근할 수 있는 장점을 제공한다. 향후에는 편리한 GUI, 매핑 규칙 선택 도구, previewer 제공 등을 위한 연구가 진행되어야 한 것이다.

• The Journal of Information Technology and Database
• /
• v.3 no.2
• /
• pp.3-24
• /
• 1996

In this paper a data replicator scheme with a distributed join architecture is suggested with its cost functions and the performance results. The contribution of this scheme is not only minimizing the number of base relation locks in distributed database tables but also reducing the remote transmission amount remarkably, which will be able to embellish the distributed databse system practical. The differential files that are derived from the active log of the DBMS are mainly forcing the scheme to reduce the number of base relation locks. The amount of transportation between relevant sites could be curtailed by the tuple reduction procedures. Then we prescribe an algorithm of data replicator with its cost function and show the performance results compared with the semi-join scheme in their distributed environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1176-1189
• /
• 1993

This paper presents the Multiple Keyword Retrieval Method under the Object-Oriented Multimedia Database Model. The multiple keyword registration and retrieval algorithms are developed to reduce the partial matching problem in multimedia data retrieval. For this, proper storage structures of the lookup tables are designed. And also, in order to maintain the constant retrieval time, media data files are organized with B+ tree structure.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.93-95
• /
• 1996

A replication server is considered to be one of the most effective tools to cope with the problems that may be caused by the complex data replications in distributed database systems. In the distributed environment, locking a table is inevitable and it is the main reason to coerce the system practically. This paper presents an Asynchronous Replicator Scheme (ARS) that basically utilizes the system log as files named differential files to refresh the distributed data files with complicated queries, and that it prevents (normally, huge) base tables from being locked. We take join operations as the complicated queries, not only because the join operation covers almost all the operations, but also because it is one of the most time-consuming and data intensive operations in query processings.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.2
• /
• pp.39-53
• /
• 2010

In this paper, we suggest an XML Development Support(XDS) System as a good developing tool to solve the problems that related with the database integration, increased to the developing terms and costs when the developing of XML programming base on the web server. XDS System is designed for the purpose of easily coding the XML program, of simply changing the programming structure and of completely maintaining the program environment. According to the predefined policy, XDS System provides necessary informations such as tables, columns, or relational keys from Database for developer. The developer step by step selects or sets what he needs. And XDS System creates an XML Tree with the result of selected information. The XML Tree includes all information of making an XML Schema and some XML Stylesheet. XDS System creates an XML Schema for all clients and creates many XML Stylesheets for each client using the XML Tree.