• Genomics & Informatics
• /
• v.7 no.4
• /
• pp.212-216
• /
• 2009

WebChemDB is an integrated chemical database retrieval system that provides access to over 8 million publicly available chemical structures, including related information on their biological activities and direct links to other public chemical resources, such as PubChem, ChEBI, and DrugBank. The data are publicly available over the web, using two-dimensional (2D) and three-dimensional (3D) structure retrieval systems with various filters and molecular descriptors. The web services API also provides researchers with functionalities to programmatically manipulate, search, and analyze the data.

• KSCI Review
• /
• v.1 no.2
• /
• pp.73-94
• /
• 1995

In this paper, design of efficient NDB(Network Data Base) for the activation plan of chain information network. The DB structure build up, logical structure, store structure, physical structure, the data express for one's record, and the express using linked in the releation of data. Also express as hierarchical model on the DSD(Data Structure Diagram) from the database with logical structure. Each node has express on record type, the linked in course of connective this type, the infuence have efficent of access or search of data, in the design for connection mutually a device of physical, design for database, and construction a form of store for logical. Also activation of chain information network of efficent, using POS(Point Of Sale) system in OSI(Open Systems Interconnection) environment for network standardization, and build up network a design for system.

• Journal of the Korean Society for information Management
• /
• v.33 no.3
• /
• pp.155-176
• /
• 2016

This study aims to develope a scholarly metadata information system based on conceptual elements of text structure of Korean studies research articles and to identify the applicability of text structure based metadata as compared with the existing similar system. For the study, we constructed a database(Korean Studies Metadata Database, KMD) with text structure based on metadata of Korean Studies journal articles selected from the Korea Citation Index(KCI). Then we verified differences between KCI system and KMD system through search results using same keywords. As a result, KMD system shows the search results which meet the users' intention of searching more efficiently in comparison with the KCI system. In other words, even if keyword combinations and conditional expressions of searching execution are same, KMD system can directly present the content of research purposes, research data, and spatial-temporal contexts of research et cetera as search results through the search procedure.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.711-720
• /
• 2001

An enlarging a scale of logical domain organizing Internet, security policy association among entities become complicated. Establishment and control of security policies for each system is a hard problem to solve because of the environment and composite factors with variable properties. In this paper, to solve this actual problems, we orgainze a hierarchical structure of network and than we design the structure of database to apply security policies for secure communication. This enables efficient management of security data and association of security policy by using designed data structure between different domain in hierarchical structure with make secure communication possible.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.6-17
• /
• 2007

Emerging modem database applications require multi-dimensional index structures to provide high performance for data retrieval. In order for a multi-dimensional index structure to be integrated into a commercial database system, efficient techniques that provide transactional access to data through this index structure are necessary. The techniques must support all degrees of isolation offered by the database system. Especially degree 3 isolation, called "no phantom read," protects search ranges from concurrent insertions and the rollbacks of deletions. In this paper, we propose a new phantom protection method for multi-dimensional index structures that uses a multi-level grid technique. The proposed mechanism is independent of the type of the multi-dimensional index structure, i.e., it can be applied to all types of index structures such as tree-based, file-based, and hash-based index structures. In addition, it has a low development cost and achieves high concurrency with a low lock overhead. It is shown through various experiments that the proposed method outperforms existing phantom protection methods for multi-dimensional index structures.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.93-106
• /
• 2006

A Grid Database is a database management system to process effectively and use the distributed data in a grid computing environment. Spatial data is more important than other general data according to the local characteristics and requires a large storage. The grid database can be used as the optimal system for the management of the spatial data. However, contrary to the conventional distributed database systems, the Grid Database which guarantees the local autonomy has a possibility not to provide an effective system, or it is impossible to use a centralized management environment. In order to allow flexible responses to a dynamically changing environment, it is required to use effectively reorganized method. In this paper, hierarchical reorganization method is presented for dynamic reorganization in a grid database. When the reorganization is conducted, an organizer is created to collect the information of databases. In addition, the organizer which is constructed by the hierarchical structure supports information communication and reorganization, and then it allows the support of regional reorganization operation and effective balance control. The performance assessment of the proposed method shows that the processing capacity is increased after the reorganization.

• Proceedings of the CALSEC Conference
• /
• 2001.08a
• /
• pp.591-596
• /
• 2001

To deliver new products to market in a due time, companies often develop their products with numerous partners distributed around the world. Internet technologies can provide a cheap and efficient basis of collaborative product development among distributed partners. This paper provides a framework and its product database model that can support consistent product data during collaborative product development. This framework consists of four components for representing consistent product structure: the product configuration, assembly structure, multiple representations and engineering changes. A product database model realizing the framework is designed and implemented as a system that supports collaborative works in the areas of product design and technical publication. The system enables participating designers and technical publishers to complete their tasks with shared and consistent product data. It also manages the propagation of engineering changes among different representations for individual participants. The Web technologies introduced in this system enable participants to easily access and operate shared product data in a standardized and distributed computing environment.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.6
• /
• pp.404-414
• /
• 2009

In the computational molecular analysis, 3D structural comparison for protein searching plays a very important role. As protein databases have been grown rapidly in size, exhaustive search methods cannot provide satisfactory performance. Because exhaustive search methods try to handle the structure of protein by using sphere set which is converted from atoms set, the similarity calculation about two sphere sets is very expensive. Instead, the filter-and-refine paradigm offers an efficient alternative to database search without compromising the accuracy of the answers. In recent, a very fast algorithm based on the inter-atomic distance has been suggested by Ballester and Richard. Since they adopted the moments of distribution with inter-atomic distance between atoms which are rotational invariant, they can eliminate the structure alignment and orientation fix process and perform the searching faster than previous methods. In this paper, we propose a new 3D shape descriptor. It has properties of the general shape distribution and useful property in screening the molecular database. We show some experimental results for the validity of our method.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.1-11
• /
• 2000

Up to the present, many GIS logical data models have been proposed to incorporate time dimension into traditional 2-dimensional (2D space) GIS databases. However, these models are difficult to implementation of multi-dimensional GIS and have problems of significant data redundancy and search performance. This paper proposes a new storage strategy and a separate storage structure, that is composed of current database and past database, in order to reduce data redundancy and improve search performance of temporal query. Also we design moving algorithm for migration from current database to past database, and design efficient search algorithm for temporal query.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.301-304
• /
• 2002

Recently, database technologies have been used commonly. But, ordinary technologies aren't suitable to construct a complicated database such as a classical literature database or an archaeological relic's database. Because this kinds of data are semi-structured data that doesn't have regular structures, database schema can't be defined before databases. We have proposed DREAM model for semi-structured databases. In this model, a database consists of five elements and the model has operations similar to operation of set theory. And further we have introduced dynamic schema "shape" showing structure of each element. We have already realized a prototype of DBMS adopting DREAM model (DREAM DBMS) and constructing function of shapes. However, shape is imperfect to describe database structures because it can't explain nested structures of elements. In this paper, we will profuse a "shape graph"that is dynamic schema showing database structures more exactly and extend the DREAM DBMS. Further we will evaluate the performance of constructing function of shapes and shape graphs.