• Title/Summary/Keyword: database systems

Search Result 2,864, Processing Time 0.027 seconds

Relational Data Extraction and Transformation: A Study to Enhance Information Systems Performance

  • Forat Falih, Hasan;Muhamad Shahbani Abu, Bakar
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.4
    • /
    • pp.265-272
    • /
    • 2022
  • The most effective method to improve information system capabilities is to enable instant access to several relational database sources and transform data with a logical structure into multiple target relational databases. There are numerous data transformation tools available; however, they typically contain fixed procedures that cannot be changed by the user, making it impossible to fulfill the near-real-time data transformation requirements. Furthermore, some tools cannot build object references or alter attribute constraints. There are various situations in which tool changes in data type cause conflicts and difficulties with data quality while transforming between the two systems. The R-programming language was extensively used throughout this study, and several different relational database structures were utilized to complete the proposed study. Experiments showed that the developed study can improve the performance of information systems by interacting with and exchanging data with various relational databases. The study addresses data quality issues, particularly the completeness and integrity dimensions of the data transformation processes.

Delayed Write Scheme to Enhance Write Performance of Flash Memory Based Embedded Database Systems (플래시 메모리 기반 임베디드 데이터베이스 시스템의 쓰기 성능 향상을 위한 지연쓰기 기법)

  • Song, Ha-Joo;Kwon, Oh-Heum
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.2
    • /
    • pp.165-177
    • /
    • 2009
  • Embedded database systems (EDBMS) based on NAND flash memories are widely adopted for logging data on sensor nodes. Since write and erase operations of a flash memory are time consuming compared to read operations and wear memory cells, it is important to reduce these operations to enhance the EDBMS performance and to extend the memory life. In this paper, we propose a delayed write scheme to archive this goal. Proposed scheme stores updated parts of database pages into delayed write records to reduce the database page writes. By doing that, it decreases write and erase operations on a flash memory. Therefore, the proposed scheme enhances the logging performance of a write-intensive EDBMS on a sensor node and extends the flash memory life.

  • PDF

A Study on the Development of Causal Knowledge Base Based on Data Mining and Fuzzy Cognitive Map (데이터 마이닝과 퍼지인식도 기반의 인과관계 지식베이스 구축에 관한 연구)

  • Kim, Jin-Sung
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.05a
    • /
    • pp.247-250
    • /
    • 2003
  • Due to the increasing use of very large databases, mining useful information and implicit knowledge from databases is evolving. However, most conventional data mining algorithms identify the relationship among features using binary values (TRUE/FALSE or 0/1) and find simple If-THEN rules at a single concept level. Therefore, implicit knowledge and causal relationships among features are commonly seen in real-world database and applications. In this paper, we thus introduce the mechanism of mining fuzzy association rules and constructing causal knowledge base form database. Acausal knowledge base construction algorithm based on Fuzzy Cognitive Map(FCM) and Srikant and Agrawal's association rule extraction method were proposed for extracting implicit causal knowledge from database. Fuzzy association rules are well suited for the thinking of human subjects and will help to increase the flexibility for supporting users in making decisions or designing the fuzzy systems. It integrates fuzzy set concept and causal knowledge-based data mining technologies to achieve this purpose. The proposed mechanism consists of three phases: First, adaptation of the fuzzy membership function to the database. Second, extraction of the fuzzy association rules using fuzzy input values. Third, building the causal knowledge base. A credit example is presented to illustrate a detailed process for finding the fuzzy association rules from a specified database, demonstration the effectiveness of the proposed algorithm.

  • PDF

A Study of Product Information Quality Verification in Database Construction of Naval Ship Product Models (실적선 데이터베이스 구축을 위한 함정 제품모델의 데이터 품질검증에 관한 연구)

  • Oh, Dae-Kyun;Shin, Jong-Gye;Choi, Yang-Ryul
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.46 no.1
    • /
    • pp.57-68
    • /
    • 2009
  • In automotive industries, reusability of product information is increasing through database construction of previous product data. The product data is stored by data quality management in product information systems. For naval ships, have the functional similarity by the ships of the same classification and class, that are built by series. Information of hull structures as well as embarked equipments are similar. So it would be effective to use database systems that are considered product information quality of previous ships in design and production processes. In this paper we discuss product information quality in database construction of naval ship product models. For this, we propose a basic concept and reference model for data quality verification. Based on this concept, A verification guideline is defined and it is applied for the case study of the digital naval ship which was built to the naval ship product model.

Automatic Display of an Additional Explanation on a Keyword Written by a Lecturer for e-Learning Using a Pen Capture Tool on Whiteboard and Two Cameras

  • Nishikimi, Kazuyuki;Yada, Yuuki;Tsuruoka, Shinji;Yoshikawa, Tomohiro;Shinogi, Tsuyoshi
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.102-105
    • /
    • 2003
  • "e-Leaning" system is classified by lecture time into two types, that is, "synchronous type" spent the same lecture time between the lecturer and students, and "asynchronous type" spent the different lecture time. The size of image database is huge, and there are some problem on the management of the lecture image database in "asynchronous type" e-Learning system. The one of them is that the time tag for the database management must be added manually at present, and the cost of the addition of the time tag causes a serious problem. To resolve the problem, we will use the character recognition for the characters written by the lecturer on whiteboard, and will add the recognized character as a keyword to the tag of the image database. If the database would have the keyword, we could retrieve the database by the keyword efficiently, and the student could select the interested lecture scene only in the full lecture database.

  • PDF

Valuation of Public Data Using Stated Preference Method: The Case of Agriculture Soil Database (진술선호방법을 이용한 공공 데이터의 가치 평가: 농업토양정보 데이터베이스 사례)

  • Lee, Sang-Ho;Ha, Sung-Ho;Jeong, Ki-Ho
    • The Journal of Information Systems
    • /
    • v.27 no.4
    • /
    • pp.149-165
    • /
    • 2018
  • Purpose As Korean economy has been sluggish in recent years, firms' interest in publicly financed projects has increased due to the relatively increasing proportion in the economy. Since 1999, publicly financed projects in Korea need to undergo preliminary feasibility study to evaluate economic efficiency and policy quality if they are larger than a certain scale. The benefits of public projects are one of the most important factors in the preliminary feasibility study but are difficult to estimate due to their nature. Design/methodology/approach This study estimates the benefits of the agricultural soil information database, a public database in Korea. The method used in the study is the stated preference method which is formally used in Korea's preliminary feasibility study. Data are collected through surveys and a logit model is constructed to be estimated by the maximum likelihood estimation method. Findings As the first study evaluating a public database, this study can be used as a baseline in all public database projects developed in the future. In addition, this study can contribute to improving the understanding of both private companies and public organizations who are interested in the cost-benefit analysis and estimation procedure for the publicly financed projects.

Improvement of RocksDB Performance via Large-Scale Parameter Analysis and Optimization

  • Jin, Huijun;Choi, Won Gi;Choi, Jonghwan;Sung, Hanseung;Park, Sanghyun
    • Journal of Information Processing Systems
    • /
    • v.18 no.3
    • /
    • pp.374-388
    • /
    • 2022
  • Database systems usually have many parameters that must be configured by database administrators and users. RocksDB achieves fast data writing performance using a log-structured merged tree. This database has many parameters associated with write and space amplifications. Write amplification degrades the database performance, and space amplification leads to an increased storage space owing to the storage of unwanted data. Previously, it was proven that significant performance improvements can be achieved by tuning the database parameters. However, tuning the multiple parameters of a database is a laborious task owing to the large number of potential configuration combinations. To address this problem, we selected the important parameters that affect the performance of RocksDB using random forest. We then analyzed the effects of the selected parameters on write and space amplifications using analysis of variance. We used a genetic algorithm to obtain optimized values of the major parameters. The experimental results indicate an insignificant reduction (-5.64%) in the execution time when using these optimized values; however, write amplification, space amplification, and data processing rates improved considerably by 20.65%, 54.50%, and 89.68%, respectively, as compared to the performance when using the default settings.

BADA/Web : Integration of The Web and An OODBMS (바다/웹 : 웹과 객체지향 데이터베이스 관리시스템의 통합)

  • Kim, Wan-Seok;Lee, Jang-Sun;Song, Young-Kee;Park, Jin-Sub;Kim, Myung-Joon;O, Kil-Nok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.11
    • /
    • pp.3534-3543
    • /
    • 2000
  • We believe in terins of information service systems that one of the best ways to develop a large scale database service system is to integrate the service capability of the Web and the dta management facility of database management systems in a complementary fashion. In such integation a database gateway in the core component, the web-database gateway accesses database management systems to serve the requests represented by using the Web technology. We designd BADA/Web be independent from the Web and DBMS and much as possible, which minrrizes the performance overhead caused by connecting database management systems and makes BADA/Web portable. BADA/Web incorporates TCL into a ibrary of it and handles concurrent requests efficiently. In this paper we describe our desingn and implementation experience in integrating the Web and BADA-III We evaluate the performance of BADA/Web by measuring and companing the latency and average response time for a simple query and also explore the effects of BADA/Web with some synthetie queries .

  • PDF

Design of Environmental Information Systems Architecture Based on the Internet : The Building of a Database for Environmental Factors and GIS (인터넷 환경에 기반한 환경정보시스템 아키텍쳐 설계 : 환경요인을 Database 구축과 이를 이용한 GIS 구축)

  • Suh, Eui-Ho;Lee, Dae-Ho;Yu, Sung-Ho
    • Asia pacific journal of information systems
    • /
    • v.8 no.2
    • /
    • pp.1-18
    • /
    • 1998
  • As the management and preservation of the environment become an important social issue, information required to support environmental task is required. So, there is an increasing demand for environmental information and appropriate systems to manage it. The vast volume of environmental data is distributed in different knowledge domains and systems. Environmental data objects have the complex structure containing environmental quality data and attribute data. Environmental information systems must be able to address these properties. This research has aimed at constructing well-defined schema design of environmental data, and making system architecture that environmental data kept by authorities should be made available to the public user. There are 3 major components in environmental information systems architecture ; User interface, Catalog libraries, Communication Provider. Web browsers provide consistent and intuitive user interfaces on Internet. The communication provider is a collection of diverse CGI functions. The main roles of the CGIs are to build interfaces between the Web, databases. Catalog libraries is libraries of various matadata including administration matadata. Administration matadata support the environmental administration and the managerial aspects of environmental data rather than explain a database itself or its properties.

  • PDF

Delay Operation Techniques for Efficient MR-Tree on Nand Flash Memory (낸드 플래시 메모리 상에서 효율적인 MR-트리 동작을 위한 지연 연산 기법)

  • Lee, Hyun-Seung;Song, Ha-Yoon;Kim, Kyung-Chang
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.758-762
    • /
    • 2008
  • Embedded systems usually utilize Flash Memories with very nice characteristics of non-volatility, low access time, low power and so on. For the multimedia database systems, R-tree is an indexing tree with nice characteristics for multimedia access. MR-tree, which is an upgraded version of R-tree, has shown better performance in searching, inserting and deleting operations than R-tree. Flash memory has sectors and blocks as a unit of read, write and delete operations. Especially, the delete is done on a unit of 512 byte blocks with very large operation time and it is also known that read and write operations on a unit of block matches caching nature of MT-tree. Our research optimizes MR-tree operations in a unit of Flash memory blocks. Such an adjusting leads in better indexing performance in database accesses. With MR-tree on a 512B block units we achieved fast search time of database indexing with low height of MR-tree as well as faster update time of database indexing with the best fit of flash memory blocks. Thus MR-tree with optimized operations shows good characteristics to be a database index schemes on any systems with flash memory.