• Journal of IKEEE
• /
• v.12 no.4
• /
• pp.217-224
• /
• 2008

This paper provides a framework for semantic correspondence of heterogeneous databases using self- organizing map. It solves the problem of overlapping between different databases due to their different schemas. Clustering technique using self-organizing maps (SOM) is tested and evaluated to assess its performance when using different kinds of data. Preprocessing of database is performed prior to clustering using edit distance algorithm, principal component analysis (PCA), and normalization function to identify the features necessary for clustering.

• Korean Management Science Review
• /
• v.11 no.2
• /
• pp.65-77
• /
• 1994

One of the major issues in the implementation and maintenance of CIM databases is the sharing and exchange of information among the heterogeneous databases. This paper addresses some architectural aspects for integrating the heterogeneous multi-databases using knowledge-based expert systems. we propose a loosely integrated coupling system between databases and knowledge-based expert systems. Especially we suggest the architectural aspects of such a coupling methodology. we also present the structure and knowledge representation scheme for the proposed knowledge-based expert system. A prototype example is included to illustrate the framework and its mechanism for implementation.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.406-417
• /
• 2001

With the advances in multimedia databases on the World Wide Web, it becomes more important to provide users with the search capability of distributed multimedia data. While there have been many studies about the database selection and the collection fusion for text databases. The multimedia databases on the Web have autonomous and heterogeneous properties and they use mainly the content based retrieval. The collection fusion problem of multimedia databases is concerned with the merging of results retrieved by content based retrieval from heterogeneous multimedia databases on the Web. This problem is crucial for the search in distributed multimedia databases, however, it has not been studied yet. This paper provides novel algorithms for processing the collection fusion of heterogeneous multimedia databases on the Web. We propose two heuristic algorithms for estimating the number of objects to be retrieved from local databases and an algorithm using the linear regression. Extensive experiments show the effectiveness and efficiency of these algorithms. These algorithms can provide the basis for the distributed content based retrieval algorithms for multimedia databases on the Web.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1828-1833
• /
• 2005

The Integration of biological databases is critically important because of the interconnectedness of biological research. But it's not easy to integrate these databases for the different formats and designers in heterogeneous environments. So initial design is indispensable to integrate heterogeneous databases. In this paper, after we performed conceptual modeling on a popular nucleotide database, GenBank and a protein database, Swiss-Prot and integrated them by considering cross-reference. we also propose the integration system architecture called Bio-Gateway System, which can help users query closely linked information between two biological databases within one system differently from existing systems as well as query easily on condition that user knows fine condition for less effort.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.101-103
• /
• 2012

Various applications store informations using difference databases according to respective goals. However, in order to serve data in several databases with one application program, it is needed to integrate data in respective databases. This paper describes development of integrated middle-ware system that selects only necessary informations from heterogeneous databases and save them.

• Proceedings of the CALSEC Conference
• /
• 1999.07b
• /
• pp.563-574
• /
• 1999

In CALS/EC environment, there are geographically dispersed heterogeneous databases and various applications. Integrated database environment provides transparent access mechanism for heterogeneous and distributed databases and interoperability between applications in various platforms. Because elements exist geographically in integrated database environment, directory service is necessary for providing unique access mechanism for elements. In this paper, we design a directory service using CORBA based access interface and object-oriented DIB model for accessing transparently to elements and interoperability with other information system.

• Genomics & Informatics
• /
• v.2 no.3
• /
• pp.142-146
• /
• 2004

Biological data and analysis tools are accumulated in distributed databases and web servers. For this reason, biologists who want to find information from the web should be aware of the various kinds of resources where it is located and how it is retrieved. Integrating the data from heterogeneous biological resources will enable biologists to discover new knowledge across the specific domain boundaries from sequences to expression, structure, and pathway. And inevitably biological databases contain noisy data. Therefore, consensus among databases will confirm the reliability of its contents. We have developed WeSAT that integrates distributed and heterogeneous biological databases and analysis tools, providing through Web Services protocols. In WeSAT, biologists are retrieved specific entries in SWISS-PROT/EMBL, PDB, and KEGG, which have annotated information about sequence, structure, and pathway. And further analysis is carried by integrated services for example homology search and multiple alignments. WeSAT makes it possible to retrieve real time updated data and analysis from the scattered databases in a single platform through Web Services.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.202-208
• /
• 2014

Wireless network information services allow end systems to discover heterogeneous networks and spectrum available for secondary use at or near their current location, helping them to cope with increasing traffic and finite spectrum resources. We propose a unified architecture that allows end systems to find nearby base stations that are using either licensed, shared or unlicensed spectrum across multiple network operators. Our study evaluates the performance and scalability of spatial databases storing base station coverage area geometries. The measurement results indicate that the current spatial databases perform well even when the number of coverage areas is very large. A single logical spatial database would likely be able to satisfy the query load for a large national cellular network. We also observe that coarse geographic divisions can significantly improve query performance.

• Genomics & Informatics
• /
• v.15 no.1
• /
• pp.19-27
• /
• 2017

Understanding complex relationships among heterogeneous biological data is one of the fundamental goals in biology. In most cases, diverse biological data are stored in relational databases, such as MySQL and Oracle, which store data in multiple tables and then infer relationships by multiple-join statements. Recently, a new type of database, called the graph-based database, was developed to natively represent various kinds of complex relationships, and it is widely used among computer science communities and IT industries. Here, we demonstrate the feasibility of using a graph-based database for complex biological relationships by comparing the performance between MySQL and Neo4j, one of the most widely used graph databases. We collected various biological data (protein-protein interaction, drug-target, gene-disease, etc.) from several existing sources, removed duplicate and redundant data, and finally constructed a graph database containing 114,550 nodes and 82,674,321 relationships. When we tested the query execution performance of MySQL versus Neo4j, we found that Neo4j outperformed MySQL in all cases. While Neo4j exhibited a very fast response for various queries, MySQL exhibited latent or unfinished responses for complex queries with multiple-join statements. These results show that using graph-based databases, such as Neo4j, is an efficient way to store complex biological relationships. Moreover, querying a graph database in diverse ways has the potential to reveal novel relationships among heterogeneous biological data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11B
• /
• pp.758-771
• /
• 2005

Information systems in current corporations are managing and storing large data officially happened on individual and various databases. Corporations for migrating the stored data from these individual databases are adopting with technologies of EAI, MDR, DW etc.. However these technologies are not only required to expenses introduction charge and maintenance cost but also have problems of heterogeneous environment required per each vender In this paper, to solve problems of these current existing technologies, we propose to design our data migration system to migrate source data and semantic constraint condition between heterogeneous relation databases based on web service. As corporations use web services, they can reduce introduction expense and maintenance cost because of using current existent web environment. Each system can independently migrate XML based data against any platform, system environment, and Implementation language.