• Title/Summary/Keyword: Complex Database

Search Result 609, Processing Time 0.027 seconds

Comparative chloroplast genomics and phylogenetic analysis of the Viburnum dilatatum complex (Adoxaceae) in Korea

  • PARK, Jongsun;XI, Hong;OH, Sang-Hun
    • Korean Journal of Plant Taxonomy
    • /
    • v.50 no.1
    • /
    • pp.8-16
    • /
    • 2020
  • Complete chloroplast genome sequences provide detailed information about any structural changes of the genome, instances of phylogenetic reconstruction, and molecular markers for fine-scale analyses. Recent developments of next-generation sequencing (NGS) tools have led to the rapid accumulation of genomic data, especially data pertaining to chloroplasts. Short reads deposited in public databases such as the Sequence Read Archive of the NCBI are open resources, and the corresponding chloroplast genomes are yet to be completed. The V. dilatatum complex in Korea consists of four morphologically similar species: V. dilatatum, V. erosum, V. japonicum, and V. wrightii. Previous molecular phylogenetic analyses based on several DNA regions did not resolve the relationship at the species level. In order to examine the level of variation of the chloroplast genome in the V. dilatatum complex, raw reads of V. dilatatum deposited in the NCBI database were used to reconstruct the whole chloroplast genome, with these results compared to the genomes of V. erosum, V. japonicum, and three other species in Viburnum. These comparative genomics results found no significant structural changes in Viburnum. The degree of interspecific variation among the species in the V. dilatatum complex is very low, suggesting that the species of the complex may have been differentiated recently. The species of the V. dilatatum complex share large unique deletions, providing evidence of close relationships among the species. A phylogenetic analysis of the entire genome of the Viburnum showed that V. dilatatum is a sister to one of two accessions of V. erosum, making V. erosum paraphyletic. Given that the overall degree of variation among the species in the V. dilatatum complex is low, the chloroplast genome may not provide a phylogenetic signal pertaining to relationships among the species.

Hypertext Model Extension and Dynamic Server Allocation for Database Gateway in Web Database Systems (웹 데이타베이스에서 하이퍼텍스트 모델 확장 및 데이타베이스 게이트웨이의 동적 서버 할당)

  • Shin, Pan-Seop;Kim, Sung-Wan;Lim, Hae-Chull
    • Journal of KIISE:Databases
    • /
    • v.27 no.2
    • /
    • pp.227-237
    • /
    • 2000
  • A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

  • PDF

A Study on Synchronization Effect of A Multi-dimensional Event Database for Big Data Information Sharing (빅 데이터 분석정보 공유를 위한 다차원 이벤트 데이터베이스의 동기화 효과 연구)

  • Lee, Choon Y.
    • Journal of Digital Convergence
    • /
    • v.15 no.10
    • /
    • pp.243-251
    • /
    • 2017
  • As external data have become important corporate information resources, there are growing needs to combine them with internal data. This paper proposes an ontology-based scheme to combine external data with multi-dimensional databases, which shall be called multi-dimensional event ontology. In the ontology, external data are represented as events. Event characteristics such as actors, places, times, targets are linked to dimensions of a multi-dimensional database. By mapping event characteristics to database dimensions, external event data are shared via multi-dimensional hierarchies. This paper proposes rules to synchronize information sharing in multi-dimensional event ontology such as upward event information sharing, downward event information sharing and complex event information sharing. These rules are implemented using Protege. This study has a value in suggesting Big Data information sharing processes using an event database framework.

A Load Balancing Method Using Ring Network Structure in the Grid Database (그리드 데이터베이스에서 링 기반 연결 구조를 이용한 부하 분산 기법)

  • Jang Yong-Il;Shin Soong-Sun;Park Soon-Young;Bae Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.9
    • /
    • pp.1107-1117
    • /
    • 2006
  • In this paper, a load balancing method using ring network structure in the Grid database is proposed. In the Grid database, generally, data is replicated for performance and availability. And, user's request is transferred to node and processed in that node which has target data. But, in such environment, a decline of performance can be occurred because unbalanced workload. A traditional research is proposed to solve unbalanced load problem. However, the Grid database has a number of systems and user's request always changes dynamically. Therefore, a traditional research can not be applied. The proposed method connects each node which has a same replicated data through ing network structure. If workload is overflowed in some node, user's request is transferred to a linked node which has a target data. And, this node stops another request processing until workload is decreased. Then, it changes the link structure through sending a message to a previous node, to stop request forwarding from a previous node. This paper shows a proposed method increases performance than existing research through performance evaluation and is more suitable for a complex and dynamic environment.

  • PDF

An XML Database System for 3-Dimensional Graphic Images (3차원 그래픽 이미지를 위한 XML 데이타베이스 시스템)

  • Hwang, Jong-Ha;Hwang, Su-Chan
    • Journal of KIISE:Databases
    • /
    • v.29 no.2
    • /
    • pp.110-118
    • /
    • 2002
  • This paper presents a 3-D graphic database system based on XML that supports content-based retrievals of 3-D images, Most of graphics application systems are currently centered around the processing of 2-D images and research works on 3-D graphics are mainly concerned about the visualization aspects of 3-D image. They do not support the semantic modeling of 3-D objects and their spatial relations. In our data model, 3-D images are represented as compositions of 3-D graphic objects with associated spatial relations. Complex 3-D objects are mode]ed using a set of primitive 3-D objects rather than the lines and polygons that are found in traditional graphic systems. This model supports content-based retrievals of scenes containing a particular object or those satisfying certain spatial relations among the objects contained in them. 3-D images are stored in the database as XML documents using 3DGML DTD that are developed for modeling 3-D graphic data. Finally, this paper describes some examples of query executed in our Web-based prototype database system.

Implementation of Prototype for a Protein Motif Prediction and Update (단백질 모티프 예측 및 갱신 프로토 타입 구현)

  • Noh, Gi-Young;Kim, Wuon-Shik;Lee, Bum-Ju;Lee, Sang-Tae;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.845-854
    • /
    • 2004
  • Motif databases are used in the function and structure prediction of proteins. The frequency of use about these databases increases continuously because of protein sequence data growth. Recently, many researches about motif resource integration are proceeding. However, existing motif databases were developed independently, thus these databases have a heterogeneous search result problem. Database intnegration for this problem resolution has a periodic update problem, a complex query process problem, a duplicate database entry handling problem and BML support problem. Therefore, in this paper, we suppose a database resource integration method for these problem resolution, describe periodically integrated database update method and XML transformation. finally, we estimate the implementation of our prototype and a case database.

Development of an Object-Relational IFC Server

  • Hoon-sig Kang;Ghang Lee
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.1346-1351
    • /
    • 2009
  • In this paper we propose a framework for an Object Relational IFC Server (OR-IFC Server). Enormous amounts of information are generated in each project. Today, many BIM systems are developed by various CAD software vendors. Industry Foundation Classes (IFC) developed by International Alliance for Interoperability (IAI) is an open standard data model for exchanging data between the various BIM tools. The IFC provides a foundation for exchanging and sharing of information directly between software applications and define a shared building project model. The IFC model server is a database management system that can keep track of transactions, modifications, and deletions. It plays a role as an information hub for storing and sharing information between various parties involved in construction projects. Users can communicate with each other via the internet and utilize functions implemented in the model server such as partial data import/export, file merge, version control, etc. IFC model servers using relational database systems have been developed. However, they suffered from slow performance and long transaction time due to a complex mapping process between the IFC structure and a relational-database structure because the IFC model schema is defined in the EXPRESS language which is object-favored language. In order to simplify the mapping process, we developed a set of rules to map the IFC model to an object-relational database (ORDB). Once the database has been configured, only those pieces of information that are required for a specific information-exchange scenario are extracted using the pre-defined information delivery manual (IDM). Therefore, file sizes will be reduced when exchanging data, meaning that files can now be effectively exchanged and shared. In this study, the framework of the IFC server using ORDB and IDM and the method to develop it will be examined.

  • PDF

Development of the Database System for Managing Decommissioning Information from Research Reactor (연구로 해체정보 관리를 위한 데이터베이스 시스템 개발)

  • 정관성;이동규;박희성;이근우;오원진
    • Proceedings of the Korean Radioactive Waste Society Conference
    • /
    • 2004.06a
    • /
    • pp.58-71
    • /
    • 2004
  • Korea Research Reactor (KRR) 1&2 has shut down and through preparatory activities, its decommissioning activities are underway. As its decommissioning activities have been done over several years, its relevant data have been spreaded with various type and media all over the discrete place and inadvertently managed, As a result, managing and assessing data of KRR 1&2 has been difficult and complex and its data cannot be evaluated. By developing the decommissioning database system of KRR 1&2 the data of decommissioning activities can be correctly evaluated, being systematically managed and objectively assessed. Finally, the decommissioning project of KRR 1&2 have come to more effectively accomplished. As the data of decommissioning activities can be at last systematically analyzed and objectively assessed, the decommissioning project of KRR 1&2 would be more effectively accomplished.

  • PDF

Requirement Analysis for Bio-Information Integration Systems

  • Lee, Sean;Lee, Phil-Hyoun;Dokyun Na;Lee, Doheon;Lee, Kwanghyung;Bae, Myung-Nam
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.11-15
    • /
    • 2003
  • Amount of biological data information has been increasing exponentially. In order to cope with this bio-information explosion, it is necessary to construct a biological data information integration system. The integration system could provide useful services for bio-application developers by answering general complex queries that require accessing information from heterogeneous bio data sources, and easily accommodate a new database into the integrated systems. In this paper, we analyze architectures and mechanisms of existing integration systems with their advantages and disadvantages. Based on this analysis and user requirement studies, we propose an integration system framework that embraces advantages of the existing systems. More specifically, we propose an integration system architecture composed of a mediator and wrappers, which can offer a service interface layer for various other applications as well as independent biologists, thus playing the role of database management system for biology applications. In other words, the system can help abstract the heterogeneous information structures and formats from the application layer. In the system, the wrappers send database-specific queries and report the result to the mediator using XML. The proposed system could facilitate in silico knowledge discovery by allowing combination of numerous discrete biological information databases.

  • PDF

The method of using database technology to process rules of Rule-Based System

  • Zheng, Baowei;Yeo, Jeong-Mo
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.1
    • /
    • pp.89-94
    • /
    • 2010
  • The most important of rule-base system is the knowledge base that determines the power of rule-base system. The important form of this knowledge is how to descript kinds of rules. The Rule-Base System (RBS) has been using in many field that need reflect quickly change of business rules in management system. As far, when develop the Rule-Based System, we must make a rule engine with a general language. There are three disadvantage of in this developed method. First, while there are many data that must be processed in the system, the speed of processing data will become very slow so that we cannot accept it. Second, we cannot change the current system to make it adaptive to changes of business rules as quickly as possible. Third, large data make the rule engine become very complex. Therefore, in this paper, we propose the two important methods of raising efficiency of Rule-Base System. The first method refers to using the Relational database technology to process the rules of the Rule-Base System, the second method refers to a algorithm of according to Quine McCluskey formula compress the rows of rule table. Because the expressive languages of rule are still remaining many problems, we will introduce a new expressive language, which is Rule-Base Data Model short as RBDM in this paper.