• Title/Summary/Keyword: Complex Database

Search Result 608, Processing Time 0.029 seconds

Constraint Data Modeling for Spatiotemporal Data Application (시공간 데이터 응용을 위한 제약 데이터 모델링)

  • Jung, Hun Jo;Woo, Sung Koo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.4
    • /
    • pp.45-56
    • /
    • 2010
  • This paper suggests constraint data modeling based on constraint data presentation techniques to perform complex spatial database operation naturally. We were able to identify the limitation of extendibility of dimension and non-equal framework via relevant research for former schema of spatial database and query processing. Therefore we described generalized tuple of spatial data and the definition of suggested constraint data modeling. Also we selected MLPQ/PReSTO tool among constraint database prototype and compare standard functionality of ARC/VIEW. Then we design scenario for spatial operation using MLPQ/PReSTO and we suggested application effect after query processing. Based on above explanation, we were able to identify that we can process spatial data naturally and effectively using simple constraint routine on same framework via constraint data modeling.

A Methodology for Management of Version Supported VHDL Models Based on Relational Database (관계형 데이터베이스에 기반한 버전이 지원되는 VHDL 모델의 관리 기법)

  • 박휴찬
    • Journal of the Korea Society for Simulation
    • /
    • v.11 no.2
    • /
    • pp.55-66
    • /
    • 2002
  • VHDL has been. widely used in modeling and simulation of hardware designs. However, complex relationship between components of the designs makes the VHDL modeling problem very difficult. Furthermore, after the initial creation of VHDL models, they evolve into many versions over their lifetime. To cope with such difficulties, this paper proposes a new methodology for the management of VHDL models supporting versions. Its conceptual bases are system entity structure and relational database. Within the methodology, a family of hierarchical structures of a design is organized in the form of VHDL model structure. It is, in turn, represented in the form of relational tables. Once the model structure is built in such a way, a specific simulation model which meets design objective is pruned from the model structure. The details of VHDL codes are systematically synthesized by combining it with the primitive models in a model base. These algorithms are also defined in terms of relational algebraic operations.

  • PDF

A Fuzzy Spatiotemporal Data Model and Dynamic Query Operations

  • Nhan, Vu Thi Hong;Kim, Sang-Ho;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.564-566
    • /
    • 2003
  • There are no immutable phenomena in reality. A lot of applications are dealing with data characterized by spatial and temporal and/or uncertain features. Currently, there has no any data model accommodating enough those three elements of spatial objects to directly use in application systems. For such reasons, we introduce a fuzzy spatio -temporal data model (FSTDM) and a method of integrating temporal and fuzzy spatial operators in a unified manner to create fuzzy spatio -temporal (FST) operators. With these operators, complex query expression will become concise. Our research is feasible to apply to the management systems and query processor of natural resource data, weather information, graphic information, and so on.

  • PDF

A Study on Drawing Management System and Database Model for Design and Constructing of Steel Plates (강판 설계 및 제작을 위한 도면관리 시스템 및 데이터베이스 모델 연구)

  • Shin, Yoon-Ho;Lee, June-Hwan;Shin, Ye-Ho
    • Journal of the Korea Computer Industry Society
    • /
    • v.10 no.1
    • /
    • pp.1-12
    • /
    • 2009
  • In this thesis, founded on those considerings, plan the formula of media data for the information of drawing for the production of steel plate by establishing the concept of relational data model, plan the surroundings for query for the interface of user, and introduce the process materialized actually in detail as use the management system of drawing.

  • PDF

Database of National Species List of Korea: the taxonomical systematics platform for managing scientific names of Korean native species

  • Park, Jongsun;An, Jung-Hyun;Kim, Yongsung;Kim, Donghyun;Yang, Byeong-Gug;Kim, Taeho
    • Journal of Species Research
    • /
    • v.9 no.3
    • /
    • pp.233-246
    • /
    • 2020
  • A scientific name is one of changeable terms in biology whenever additional research results of specific taxa is accumulated. The Database of the National Species List of Korea (DBNKo) was developed to manage taxonomic information of Korean species, designed to describe the changeable and complex taxonomical structure and information. A Korean Taxonomical Serial Number (KTSN) was assigned to each taxon, different from the normally used systems that the scientific name was considered as primary key to manage higher rank of taxa systematically. Common names were also treated with the KTSN, reflecting that common name is considered as one type of taxon. Additional taxonomic information (e.g., synonyms, original names, and references) was also added to the database. A web interface with an intuitive dashboard presenting taxonomic hierarchical structure is provided to experts and/or managers of the DBNKo. Currently, several biological databases are available in the National Institute of Biological Resources (NIBR) such as a specimen database, a digital library, a genetic information system, and the shared species data based on the DBNKo. The DBNKo started sharing species information with other institutions such as the Nakdonggang National Institute of Biological Resources. It is an ideal centralized species database to manage standardized information of Korean species.

OHDSI OMOP-CDM Database Security Weakness and Countermeasures (OHDSI OMOP-CDM 데이터베이스 보안 취약점 및 대응방안)

  • Lee, Kyung-Hwan;Jang, Seong-Yong
    • Journal of Information Technology Services
    • /
    • v.21 no.4
    • /
    • pp.63-74
    • /
    • 2022
  • Globally researchers at medical institutions are actively sharing COHORT data of patients to develop vaccines and treatments to overcome the COVID-19 crisis. OMOP-CDM, a common data model that efficiently shares medical data research independently operated by individual medical institutions has patient personal information (e.g. PII, PHI). Although PII and PHI are managed and shared indistinguishably through de-identification or anonymization in medical institutions they could not be guaranteed at 100% by complete de-identification and anonymization. For this reason the security of the OMOP-CDM database is important but there is no detailed and specific OMOP-CDM security inspection tool so risk mitigation measures are being taken with a general security inspection tool. This study intends to study and present a model for implementing a tool to check the security vulnerability of OMOP-CDM by analyzing the security guidelines for the US database and security controls of the personal information protection of the NIST. Additionally it intends to verify the implementation feasibility by real field demonstration in an actual 3 hospitals environment. As a result of checking the security status of the test server and the CDM database of the three hospitals in operation, most of the database audit and encryption functions were found to be insufficient. Based on these inspection results it was applied to the optimization study of the complex and time-consuming CDM CSF developed in the "Development of Security Framework Required for CDM-based Distributed Research" task of the Korea Health Industry Promotion Agency. According to several recent newspaper articles, Ramsomware attacks on financially large hospitals are intensifying. Organizations that are currently operating or will operate CDM databases need to install database audits(proofing) and encryption (data protection) that are not provided by the OMOP-CDM database template to prevent attackers from compromising.

Korean Pharmacogenomic Database: Pharmacogenomic Haplotype Analysis of the Korean Population and Ethnic Comparisons

  • Kang, Tae-Sun;Woo, Sun-Wook;Park, Hyun-Joo;Roh, Jae-Sook
    • Biomolecules & Therapeutics
    • /
    • v.16 no.2
    • /
    • pp.77-81
    • /
    • 2008
  • The major aim of the Korean Pharmacogenomic Database (KPD) is to offer to users a "bridging" function, making the search for useful information easier. This database has also been established to collect unique Korean genotype data from other databases and to directly link these data to other major databases that offer more informative data. In this way, searches for information about new drug developments and easier and faster evaluation of the more complex and larger databases are possible. The KPD is located at the National Institute of Toxicological Research homepage (http://www.nitr.go.kr/nitr/contents/m134700/view.do), and offers Korean single-nucleotide polymorphism (SNP) information for 154 genes and haplotype information. It also compares the Korean SNP and haplotype frequencies with those of the other ethnic groups registered in the International HapMap. Through the Pharmacogenomic Information and Education facility, we also provide evaluators and the public with information about the concept of pharmacogenomic information, research trends, and the drug regulations of other countries. Because the drug responses of Koreans are not necessarily the same as those of Chinese or Japanese people, it is expected that the systematic operation of the KPD will allow the definition of racial differences and various genomic biomarkers (haplotypes or SNPs) for use in bridging studies and in the approval of new drugs.

Java Object Modeling Using EER Model and the Implementation of Object Parser (EER 모델을 이용한 Java Object 모델링과 Object 파서의 구현)

  • 김경식;김창화
    • The Journal of Information Technology and Database
    • /
    • v.6 no.1
    • /
    • pp.1-13
    • /
    • 1999
  • The modeling components in the object-oriented paradigm are based on the object, not the structured function or procedure. That is, in the past, when one wanted to solve problems, he would describe the solution procedure. However, the object-oriented paradigm includes the concepts that solve problems through interaction between objects. The object-oriented model is constructed by describing the relationship between object to represent the real world. As in object-oriented model the relationships between objects increase, the control of objects caused by their insertions, deletions, and modifications comes to be very complex and difficult. Because the loss of the referential integrity happens and the object reusability is reduced. For these reasons, the necessity of the control of objects and the visualization of the relationships between them is required. In order that we design a database necessary to implement Object Browser that has functionalities to visualize Java objects and to perform the query processing in Java object modeling, in this paper we show the processes for EER modeling on Java object and its transformation into relational database schema. In addition we implement Java Object Parser that parses Java object and inserts the parsed results into the implemented database.

  • PDF

CONSTRUCTING GENE REGULATORY NETWORK USING FREQUENT GENE EXPRESSION PATTERN MINING AND CHAIN RULES

  • Park, Hong-Kyu;Lee, Heon-Gyu;Cho, Kyung-Hwan;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • v.2
    • /
    • pp.623-626
    • /
    • 2006
  • Group of genes controls the functioning of a cell by complex interactions. These interacting gene groups are called Gene Regulatory Networks (GRNs). Two previous data mining approaches, clustering and classification have been used to analyze gene expression data. While these mining tools are useful for determining membership of genes by homology, they don't identify the regulatory relationships among genes found in the same class of molecular actions. Furthermore, we need to understand the mechanism of how genes relate and how they regulate one another. In order to detect regulatory relationships among genes from time-series Microarray data, we propose a novel approach using frequent pattern mining and chain rule. In this approach, we propose a method for transforming gene expression data to make suitable for frequent pattern mining, and detect gene expression patterns applying FP-growth algorithm. And then, we construct gene regulatory network from frequent gene patterns using chain rule. Finally, we validated our proposed method by showing that our experimental results are consistent with published results.

  • PDF

Bulk Updating Moving Points for the TPR-tree (TPR-Tree를 위한 이동 점의 묶음 갱신)

  • Hoang Do Thanh Tung;Lee Eung-Jae;Lee Yang-Koo;Ryu Keun-Ho
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2004.12a
    • /
    • pp.113-116
    • /
    • 2004
  • Assisted by high technologies of information and communication in storing and collecting moving object information, many applications have been developing technical methods to exploit databases of moving objects effectively and variously. Among them, today, Current and Anticipated Future Position Indexing methods manage current positions of moving objects in order to anticipate future positions of them or more complex future queries. They, however, strongly demand update performance as fast enough to guarantee certainty of queries as possible. In this paper, we propose a new indexing mettled derived from the TPR-tree that should has update performance considerably improved, we named it BUR-tree. In our method, index structure can be inserted, deleted, and updated with a number (or bulk) of objects simultaneously rather than one object at a time as in conventional methods. This method is intended to be applied to a traffic network in which vast number of objects, such as cars, pedestrians, moves continuously.

  • PDF