• Title/Summary/Keyword: Database Quality

Search Result 1,373, Processing Time 0.026 seconds

Database Modeling for Environmental Product Life Cycle Management (환경영향을 고려한 제품 전 주기 관리 데이터 모델링)

  • 황오현;강무진
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2001.04a
    • /
    • pp.358-362
    • /
    • 2001
  • Environmental Product Life Cycle Management is an activity for defining and describing the product, process of activity environmentally. The activity involves the full life cycle stages of the product; evaluating environmental releases at each stage, determining the aggregate and specific impacts of the releases, developing opportunities to effect environmental improvements. This paper presents a methodological approach for database modeling to build Product Life Cycle Management system and show a set of database modeling. Additionally, a key issue for database is the quality of the provided information.

  • PDF

Construction of Practical Teaching System of Database Principles based on Core Literacy

  • JIN, Hua
    • Journal of Information Technology Applications and Management
    • /
    • v.27 no.2
    • /
    • pp.23-36
    • /
    • 2020
  • The promulgation of the overall framework of Chinese students' development of core literacy has made the implementation of core literacy into specific teaching activities an urgent problem to be solved in the field of education. Based on the analysis of the problems existing in the undergraduate education under the mode of emphasizing theory and neglecting practice, this paper constructs the practical teaching system of Database Principle Course Based on the core quality, expounds the implementation strategy of practical teaching, and probes into how to train the students in the practical teaching of database principle Cultivate scientific spirit, learning ability, practical innovation, responsibility and other core literacy. After 5 rounds of practice, students have achieved better development in independent development and collaborative work, and their awareness of practical innovation has been significantly improved.

ULTRAVIOLET AND VISIBLE SPECTROSCOPIC DATABASE FOR ATOMS AND MOLECULES IN CELESTIAL OBJETS

  • Kim, Sang-J.
    • Publications of The Korean Astronomical Society
    • /
    • v.9 no.1
    • /
    • pp.111-166
    • /
    • 1994
  • I have developed a UV and visible spectroscopic database (UVSD) for atoms and molecules, which are found in interstellar medium, stars, galaxies, and in the atmospheres of the earth, planets, satellites, and comets. This UV and visible database, which is machine-readable, consists of three different sub-databases depending upon the characteristics of the sub-databases: (A) atomic and molecular line listings from laboratory observations or theoretical studies; (B) absorption spectra measured in laboratories; and (C) solar UV, visible, and infrared spectral atlases. The UVSD is in a very initial stage of development compared with other well organized and established infrared and microwave databases. In order to make a good quality and complete database, substantial efforts should be made for the acquisition of scattered important data from laboratories or institutions, and then the acquired heterogeneous data should be peer-reviewed and standardized.

  • PDF

Developing a Design Support System for Database Distribution : Relational Schema as an Input (데이터베이스 분산 설계 지원 시스템 개발: 관계형 스키마를 입력으로)

  • Lee, Hui-Seok;Ji, Jeong-Kang;Kim, Tae-Hun;Yeo, Ji-Yeong
    • Asia pacific journal of information systems
    • /
    • v.6 no.1
    • /
    • pp.165-194
    • /
    • 1996
  • Data distribution is one of the most important steps in distributed database design. This paper proposes a methodology for distributing database by using a relational schema as an input. A design support system called DBDD (Database Distribution Design) is implemented within the framework of this methodology. The methodology consists of three phases such as (i) schema analysis, (ii) fragmentation, and (iii) allocation. In the schema analysis phase, all the table names are acquired from a global relational schema. In the fragmentation phase, fragments are generated according to transaction retrieval patterns. Furthermore, DBDD enhances the design quality by allocating fragments in a progressive manner. A real-life case is illustrated to demonstrate the practical usefulness of the DBDD.

  • PDF

Improved spectral line measurements of the SDSS galaxy spectra

  • Oh, Kyu-Seok;Sarzi, Marc;Yi, Suk-Young
    • Bulletin of the Korean Space Science Society
    • /
    • 2009.10a
    • /
    • pp.35.1-35.1
    • /
    • 2009
  • We have established a database of galaxy spectral line strengths for the SDSS database using an improved line measuring method. Our work includes the entire SDSS DR7 galaxies within redshift of 0.2. The absorption line strengths measured by the SDSS pipeline are seriously contaminated by emission filling. Our code, GANDALF (gas and absorption line fitting code) performs more accurate measurements by effectively separating emission lines from absorption lines. A significant improvement has also been made on the velocity dispersion measurement, more notably in late-type galaxies. We have also identified a number of broad line region galaxies which were misclassified as normal galaxies by the SDSS pipeline. We developed an effective method measuring their line strengths. The database will be provided with new parameters that are indicative of the line strength measurement quality. In addition, we made galaxy templates for the Hubble sequence. The database will be useful for many fields of galaxy studies including star formation and AGN activities.

  • PDF

Distributed Database Design using Evolutionary Algorithms

  • Tosun, Umut
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.430-435
    • /
    • 2014
  • The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

Plans for establishing a database for Managing Railway System Safety (철도시스템 안전관리를 위한 데이터베이스 구축 방안 연구)

  • Hong Seon-Ho;Kim Sang-Ahm
    • Proceedings of the KSR Conference
    • /
    • 2005.11a
    • /
    • pp.605-611
    • /
    • 2005
  • System safety management to secure complicated system safety such as railway and nuclear includes various factors. Those are prevention of accidents, faults management, human factor, men-machine relation, organization factor, safety culture, quality/quantity safety performance goal, and safety regulations. To manage them, it is required that database which is based on most analysis is established. Therefore system safety could be controlled. This research defines data required to safety management, and that is aimed at deriving plans in order to establish them as database. To accomplish that, safety information management of other systems such as aviation and marine is reviewed. Also, the present conditions of available data in the filed of domestic railway are analysed, and then it provides plans for. establishing database to build up advanced railway system safety information management systems.

  • PDF

Trends in Data Management Technology Using Artificial Intelligence (인공지능 기술을 활용한 데이터 관리 기술 동향)

  • C.S. Kim;C.S. Park;T.W. Lee;J.Y. Kim
    • Electronics and Telecommunications Trends
    • /
    • v.38 no.6
    • /
    • pp.22-30
    • /
    • 2023
  • Recently, artificial intelligence has been in the spotlight across various fields. Artificial intelligence uses massive amounts of data to train machine learning models and performs various tasks using the trained models. For model training, large, high-quality data sets are essential, and database systems have provided such data. Driven by advances in artificial intelligence, attempts are being made to improve various components of database systems using artificial intelligence. Replacing traditional complex algorithm-based database components with their artificial-intelligence-based counterparts can lead to substantial savings of resources and computation time, thereby improving the system performance and efficiency. We analyze trends in the application of artificial intelligence to database systems.

Development and Applications of Ecological Data Portal Service (EcoBank) for Sharing Ecological Information of Korea (생태정보의 공유를 위한 생태정보 포털서비스 (EcoBank) 구축 및 활용 방안)

  • Sung, Sunyong;Kwon, Yong Su;Kim, Ki Dong
    • Korean Journal of Ecology and Environment
    • /
    • v.51 no.3
    • /
    • pp.212-220
    • /
    • 2018
  • Ecological and ecosystem database is becoming very necessary to understand origins and relationship between human and nature and also to minimize disturbance caused by human activities. An ecological information portal can play important roles as a computing system to collect knowledge, distributed research findings and separated data from researchers. In this study, we designed and developed ecological information portal service (EcoBank 1.0) for collecting and providing ecological information for diverse classes of stakeholders. To reach the goal, we had reviewed related and comparable ecological database portals to design conceptual structure of EcoBank system including database management framework. Then, we developed some functions of ecosystem analysis for each stake-holders (researchers, general public and policy makers). As a result of this study, we successfully designed of EcoBank system covering the functions of Digital Object Identifier(DOI) publishing and data quality management process. Also, we (1) applied ecological indices for calculating biodiversity by administrative boundary for policy makers, (2) provided statistical information of econature map for general public and distribution characteristics of species for researchers. To make a successful establishment of EcoBank, we have to collect and build up related database and offer various and reliable ecological data consistently. We expect that the successful construction of EcoBank will help not only to accomplish sustainable development goals but also to raise the welfare of ecosystem in Korea.

An Extended Frequent Pattern Tree for Hiding Sensitive Frequent Itemsets (민감한 빈발 항목집합 숨기기 위한 확장 빈발 패턴 트리)

  • Lee, Dan-Young;An, Hyoung-Geun;Koh, Jae-Jin
    • The KIPS Transactions:PartD
    • /
    • v.18D no.3
    • /
    • pp.169-178
    • /
    • 2011
  • Recently, data sharing between enterprises or organizations is required matter for task cooperation. In this process, when the enterprise opens its database to the affiliates, it can be occurred to problem leaked sensitive information. To resolve this problem it is needed to hide sensitive information from the database. Previous research hiding sensitive information applied different heuristic algorithms to maintain quality of the database. But there have been few studies analyzing the effects on the items modified during the hiding process and trying to minimize the hided items. This paper suggests eFP-Tree(Extended Frequent Pattern Tree) based FP-Tree(Frequent Pattern Tree) to hide sensitive frequent itemsets. Node formation of eFP-Tree uses border to minimize impacts of non sensitive frequent itemsets in hiding process, by organizing all transaction, sensitive and border information differently to before. As a result to apply eFP-Tree to the example transaction database, the lost items were less than 10%, proving it is more effective than the existing algorithm and maintain the quality of database to the optimal.