• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.5
• /
• pp.257-265
• /
• 2004

The complex documentation involved in power system analysis software require a well-defined and friendly database system. We have developed an object-oriented database management system for power system analysis, and have described load flow analysis and transient stability analysis using object-oriented database(OODB). Database management systems are widely used and achieve high reliability of data management in the engineering fields. However relational database system have shortcomings in application to power system analysis. ill relational database, the data model is too simple for modeling complex data and database languages are very different from programming languages. Object-oriented techniques are sufficiently powerful to support data-modeling requirements of GUI applications. The GUI is implemented using C++ on a MS windows platform. The OODB supports data modeling requirements of GUI applications and the performance is well acceptable for Gill applications.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.6 no.3
• /
• pp.598-625
• /
• 2014

To support the procedure for determining an optimal liquefaction cycle for FLNG FEED, an ontological modeling method which can automatically generate various alternative liquefaction cycles were carried out in this paper. General rules in combining equipment are extracted from existing onshore liquefaction cycles like C3MR and DMR cycle. A generic relational model which represents whole relations of the plant elements has all these rules, and it is expressed by using the system entity structure (SES), an ontological framework that hierarchically represents the elements of a system and their relationships. By using a process called pruning which reduces the SES to a candidate, various alternative relational models of the liquefaction cycles can be automatically generated. These alternatives were provided by XML-based formats, and they can be used for choosing an optimal liquefaction cycle on the basis of the assessments such as process simulation and reliability analysis.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.07a
• /
• pp.325-328
• /
• 2012

본 연구는 사용자가 특정 전문지식에 대하여 검색하는데 있어 관계형 데이터베이스와 온톨로지를 결합해 보다 적합한 검색 결과를 반환하도록 하는 관계형 데이터베이스와 온톨로지 병행모델에 관한 것이다. 데이터나 정보 양의 급격한 증가는 검색 결과의 사용자 확신을 도리어 떨어트리는 big data 문제에 부딪히게 되었으며 모바일 기기의 사용 증가는 검색과 결과의 판단에 있어 인간의 관여를 줄이는 단순성을 높이는 것이 강조되고 있다. 따라서 본 연구는 고수준의 의사결정이 요구되는 분야에 있어서의 검색 성능을 높이기 위해 관계형 데이터베이스로 구성된 데이터에 온톨로지를 결합시켜 사용자에게 적합한 데이터를 반환할 수 있는 모델에 대해 지원해보고자 한다. 본 연구의 검증을 위해 전문 지식이 요구되는 의약품 분야의 데이터베이스를 기준으로 서비스를 제공하는 사이트에서의 검색을 통해 문제점을 제시하고 연구의 필요성을 제시한다.

• Journal of Preventive Medicine and Public Health
• /
• v.56 no.1
• /
• pp.88-94
• /
• 2023

Objectives: This study examined how deprivation differed by region and the effect those differences had on suicidal ideation among the local population. Methods: Data collected over 10 years (2012-2021) in the Korea Welfare Panel Study were organized into 3 categories: metropolitan, city, and rural. A panel analysis was conducted on the impact of deprivation indices, socio-demographic characteristics, and life satisfaction on suicidal ideation in each category. Results: Income, divorce status, family relationship satisfaction, and medical deprivation had a significant impact on suicidal ideation in metropolitan areas, whereas these variables did not have significant effects in rural areas. In other words, income, family, and medical support were more impactful in city areas. Conclusions: Although the deprivation index was higher in rural areas than in city areas due to an aging population and reduced income levels, the mental health of rural residents was found to be generally better than that of city residents. The possibility that this is related to the strength of relationships within the respective communities should be considered in light of recent discussions on relational welfare.

• The Journal of the Korea Contents Association
• /
• v.6 no.4
• /
• pp.19-28
• /
• 2006

XML instances for purpose of information exchange are normally stored in the legacy relational database. Therefore, integrations with relational database are required for effective XML applications. To support these requirements, virtual decomposition storage or decomposition storage methods which save separates structures of instances to relational database have researched. However, these storage methods contain different information of schema structure and layers which has caused difficulties to process query during search operation as well as increased overheads due to duplicate savings for separate storages. Therefore, in this research, additional field of 'Eltype' has introduced to previous database schema structure to instance and schema structure, provide consistent level information and propose storage structure to map each field to schema field of relational database. As results, XML instance and structures can be stored together to minimize overheads and required storage-space. Also, synchronized storage layer structure provides easier processing of search query.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.509-518
• /
• 2004

Recently there has been some efforts to add XML full-text retrievals and XML updates into new standardization of XML queries. XML full-text retrievals plays an important role in XML query languages. of like tables in relational model an XML document has complex and unstructured natures. We believe that when we try to get some information from unstructured XML documents a full-text retrieval query is much more convenient approach than a regular structured query XML update is another core function that an XML query have to have. In this paper we propose an inverted index to support XML updates and XML full-text queries in relational environment. Performance comparisons exhibit that our approach maintains a comparable size of inverted indexes and it supports many full-text retrieval functions very well. It also shows very stable retrieval performance especially for large size of XML documents. Foremost our approach handles XML updates efficiently by removing cascading effects.

• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.211-220
• /
• 2003

As Geographic Information Systems represent three dimensional topological information, The Systems provide accurate and delicate services for users. In order to execute three dimensional topological operations, a dimensional transformation and heterogeneous spatial models should be used. However, the existing systems that use the dimensional transformation and the heterogeneous models, is not only difficult to operate the spatial operators, but also happened to support non-interoperability. Therefore, in order to solve the problems, we proposed three dimensional spatial object models that supported two dimensional object models and implemented them to show validity of the proposed models. When designing the three dimensional topological operators, we used 3DE-9IM which extended DE-9IM to support three dimensional concepts, and implemented operators on the component environment with object oriented concepts. The proposed three dimensional spatial object models and topological operators can support interoperability between systems, and execute spatial queries efficiently on three dimensional spatial objects.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.22-24
• /
• 2022

Recently, Graph Database (GDB) is being used in wide range of industrial fields. GDB is a database system which adopts graph structure for storing the information. GDB handles the information in the form of a graph which consists of vertices and edges. In contrast to the relational database system which requires pre-defined table schema, GDB doesn't need a pre-defined structure for storing data, allowing a very flexible way of thinking about and using the data. With GDB, we can handle a large volume of heavily interconnected data. A network service provider provides its services based on the heavily interconnected communication network facilities. In many cases, their information is hosted in relational database, where it is not easy to process a query that requires recursive graph traversal operation. In this study, we suggest a way to store an example set of interconnected network facilities in GDB, then show how to graph-query them efficiently.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.9
• /
• pp.637-648
• /
• 2009

As the cost of disks decreases, PCs are soon expected to be equipped with a disk of 1TB or more. Assuming that a single person generates 1GB of data per month, 1TB is enough to store data for the entire lifetime of a person. This has lead to the growth of researches on lifelog management, which manages what people see and listen to in everyday life. Although many different lifelog management systems have been proposed, including those based on the relational data model, based on ontology, and based on file systems, they have all advantages and disadvantages: Those based on the relational data model provide good query processing performance but they do not support complex queries properly; Those based on ontology handle more complex queries but their performances are not satisfactory: Those based on file systems support only keyword queries. Moreover, these systems are lack of support for lifelog group management and do not provide a convenient user interface for modifying and adding tags (metadata) to lifelogs for effective lifelog search. To address these problems, we propose a lifelog management system based on the relational data model. The proposed system models lifelogs by using the relational data model and transforms queries on lifelogs into SQL statements, which results in good query processing performance. It also supports a simplified relationship query that finds a lifelog based on other lifelogs directly related to it, to overcome the disadvantage of not supporting complex queries properly. In addition, the proposed system supports for the management of lifelog groups by providing ways to create, edit, search, play, and share them. Finally, it is equipped with a tagging tool that helps the user to modify and add tags conveniently through the ion of various tags. This paper describes the design and implementation of the proposed system and its various applications.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.526-537
• /
• 2006

The most representative approach for efficient storing of XML data is to store XML data in relational databases. The merit of this approach is that it can easily accept the realistic status that most data are still stored in relational databases. This approach needs to convert XML data into relational data or relational data into XML data. The most important issue in the translation is to reflect structural and semantic relations of RDB to XML schema model exactly. Many studies have been done to resolve the issue, but those methods have several problems: Not cover structural semantics or just support explicit referential integrity relations. In this paper, we propose an algorithm for extracting implicit referential integrities automatically. We also design and implement the suggested algorithm, and execute comparative evaluations using translated XML documents. The proposed algorithm provides several good points such as improving semantic information extraction and conversion, securing sufficient referential integrity of the target databases, and so on. By using the suggested algorithm, we can guarantee not only explicit referential integrities but also implicit referential integrities of the initial relational schema model completely. That is, we can create more exact XML schema model through the suggested algorithm.