• Journal of the Korean Society for information Management
• /
• v.16 no.3
• /
• pp.7-30
• /
• 1999

The bibliometric analysis was conducted by searching 87 abstract & index databases provided by the DIALOG to identify not only the characteristics of Korean journals covered by international databases, but also the characteristics of the databases covering such Korean journals. 248 Korean journals were identified, for which at least one paper published between 1990 and 1997 was retrievable from the DIALOG databases. These Korean journals were found in 52 databases. 141 journals(56.9%) were indexed in only one database. Most Korean journals covered in several DIALOG databases were science and engineering journals published in English. The difference in the degrees Korean journals are covered in a database is found to be statistically significant by the discipline a database covers, and by the database's journal selection policy.

• 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.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.138-143
• /
• 2002

This paper describes a framework for extending GIS databases to support moving object data type and query language. The rapid progress of wireless communications, positioning systems, and mobile computing devices have led location-aware applications to be essential components for commercial and industrial systems. Location-aware applications require GIS databases system to represent moving objects and to support querying on the motion properties of objects. For example, fleet management applications may require storage of information about moving vehicles. Also, advanced CRM(Customer Relationship Management) applications may require to store and query the trajectories of mobile phone users. In this trend, maintaining consistent information about the location of continuously moving objects and processing motion-specific queries is challenging problem. We formally define a data model and query language for mobile objects that includes complex evolving spatial structure, and propose core algebra to process the moving object query language. Main profit of proposed moving objects query language and algebra is that proposed model can be constructed on the top of GIS databases.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.2
• /
• pp.103-112
• /
• 2000

CAD databases are the core element to the management of product information. A key to the successful use of the databases is a rational method of query to and retrieval from the databases. Although it is parts geometry that users eager to retrieve from the CAD databases, no system yet supports geometry-based query. This paper aims at developing a new method of assessing geometric similarity which can serve as the basis of geometric query for CAD database. The proposed method uses ASVP (Alternating Sums of Volumes with Partitioning) decomposition that is a volumetric representation of a part obtained from its boundary representation. A measure of geometric similarity between two solid models is defined on their ASVP tree representations. The measure can take into account overall shapes of parte, shapes of features and their locations. Several properties that a similarity measure needs to satisfy are discussed. The geometric query developed in this paper can be used in a wide range of applications using CAD databases, which include similarity-based design retrieval, variant process planning, and components selection from part library. An experiment has been carried out to demonstrate the effectiveness of the method, and the results are presented.

• The Journal of Korean Association of Computer Education
• /
• v.4 no.2
• /
• pp.85-95
• /
• 2001

Since documents on the Web are naturally partitioned into many document databases, the efficient information retrieval process requires identifying the document databases that are most likely to provide relevant documents to the query and then querying the identified document databases. We propose a neural net based user feedback learning mechanism for such an efficient information retrieval. Presented learning mechanism learns about underlying document databases using the relevance feedbacks obtained from user's retrieval experiences. For a given query, the learning mechanism, which is sufficiently trained, discovers the document databases associated with the relevant documents and retrieves those documents effectively.

• Interdisciplinary Bio Central
• /
• v.3 no.3
• /
• pp.12.1-12.3
• /
• 2011

Bioinformatics tools and databases are useful for understanding and processing various biological data. Numerous resources are being published each year. It is not a trivial task to find up-to-date relevant tools and databases. Moreover, no server is available to provide comprehensive coverage on bioinformatics resources in all biological fields. Here, we present a directory server called IntoPub that provides information on web resources. First, we downloaded XML-formatted abstracts containing web URLs from the NCBI PubMed database by using 'ESearch-EFetch' function in the NCBI E-utilities. The information is obtained from abstracts in the PubMed by extracting 'www' or 'http' prefixes. Then, we cu-rate the downloaded abstracts both in automatic and manual fashion. As of July 2011, the IntoPub database has 12,118 abstracts containing web URLs from 174 journals. Our anal-ysis shows that the number of abstracts containing web resources has increased signifi-cantly every year. The server has been tested by many biologists from several countries to get opinion on user satisfaction, usefulness, practicability, and ease of use since January 2010. In the IntoPub web server, users can easily find relevant bioinformatics resources, as compared to searching in PubMed. IntoPub will continue to update and incorporate new web resources from PubMed and other literature databases. IntoPub, available at http://into.kobic.re.kr/, is updated every day.

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.29 no.6
• /
• pp.443-450
• /
• 2015

The purpose of this study was is to understand how the network pharmacology databases of traditional medicine in China are established and provide suggestion for successful implementation in Traditional Korean Medicine. We searched for network-pharmacology-related TCM Databases provided on the internet, and analysed their contents. Then, we compared herbs related to Sasang with herbs of the TCM Databases. We chose 8 network-pharmacology-related TCM Databases. They shared information about compounds, herbs, formulae, drugs, targets and diseases, and provided interaction networks between these components. In comparison with herbs related to Sasang, TCMSP Database did not have information about 99 herbs in total, and 25 herbs included in major Sasang formulae. The implications and recommendations for Traditional Korean Medicine researches were discussed. Based on the results of this primary study, more related studies should be carried out in the future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5888-5903
• /
• 2019

The Relational ranking method applies authority-based ranking in relational dataset that can be modeled as graphs considering also their tuples' values. Authority directions from tuples that contain the given keywords and transfer to their corresponding neighboring nodes in accordance with their values and semantic connections. From our previous work, ObjectRank extends to ValueRank that also takes into account the value of tuples in authority transfer flows. In a maked difference from ObjectRank, which only considers authority flows through relationships, it is only valid in the bibliographic databases e.g. DBLP dataset, ValueRank facilitates the estimation of importance for any databases, e.g. trading databases, etc. A relational keyword search paradigm Object Summary (denote as OS) is proposed recently, given a set of keywords, a group of Object Summaries as its query result. An OS is a multilevel-tree data structure, in which node (namely the tuple with keywords) is OS's root node, and the surrounding nodes are the summary of all data on the graph. But, some of these trees have a very large in total number of tuples, size-l OSs are the OS snippets, have also been investigated using ValueRank.We evaluated the real bibliographical dataset and Microsoft business databases to verify of our proposed approach.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.384-395
• /
• 2006

Topographical images such as aerial and satellite images are usually similar with respect to colors and textures but not in shapes. Thus shape features of the images and the methods of extracting them become critical for effective image retrieval from topographical image databases. In this paper, we propose a shape feature extraction method for topographical image retrieval. The method extracts a set of attributes which can model the presence of holes and disconnected regions in images and is tolerant to pre-processing, more specifically segmentation, errors. Various experiments suggest that retrieval using attributes extracted using the proposed method performs better than using existing shape feature extraction methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.247-249
• /
• 2013

Even though Relational Databases have been widely used in many enterprises, the relations among entities are not managed effectively and efficiently. In order to analyze Big Data, it is absolutely needed to express various relations among entities in a graphical form. In this paper, we define Graph Databases and its structure. And then, we check out their characteristics such as transaction, consistency, availability, retrieval function, and expandability. Also, we appropriate or inappropriate subjects for application of Graph Databases.