• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.57-64
• /
• 2009

XML has become a do facto standard for structured document and data on the Web. An XML data deluge over the network will be more, since XML based standards such as Web Service and Semantic Web gets popular. There are efforts to store and query XML documents in a relational database system and recent efforts focus on how to provide such operations using XPath and XQuery. In this paper, we present study about those research efforts and we propose a new scheme to stoγe and query XML documents in a relational database using XPath query. The scheme uses a 'shred' method to store and translates XPath queries to SQL. We also present our empirical experiments using a RDBMS.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.146-164
• /
• 2010

Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or a file system. For shredded XML data stored in relational tables, however, it may not be straightforward to apply existing algorithms for twig query processing, since most of the algorithms require XML data to be accessed in a form of streams of elements grouped by their tags and sorted in a particular order. In order to support XML query processing within the common framework of relational database systems, we first propose several bitmap indexes and their strategies for supporting holistic twig joining on XML data stored in relational tables. Since bitmap indexes are well supported in most of the commercial and open-source database systems, the proposed bitmapped indexes and twig query processing strategies can be incorporated into relational query processing framework with more ease. The proposed query processing strategies are efficient in terms of both time and space, because the compressed bitmap indexes stay compressed during data access. In addition, we propose a hybrid index which computes twig query solutions with only bit-vectors, without accessing labeled XML elements stored in the relational tables.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.113-116
• /
• 2001

XML (extensible Markup Language) is a flexible way to create common information formats and share both the format and the data on the World Wide Web, intranets, and elsewhere. A document type definition (DTD) is a specific definition of the rules of the Standard Generalized Markup Language. A relational database management system (RDBMS) is a program that lets you create, update, and administer a relational database. An RDBMS takes Structured Query Language (SQL) statements entered by a user or contained in an application program and creates, updates, or provides access to the database. This paper has been studied a method of mappings from XML DTD to RDB schemas based on object model.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.87-94
• /
• 1996

In order to design an extended relational database management system supporting multilevel security, the standard relational data model is extended and new relational integrity constrains are proposed for the model. The extended relational model and proposed multilevel integrity constraniants maintain database in consistent state and produce a basis that can eliminat eambiguity of entity and relation ship representations bypoly instantiation. The proposed up dates emantics canincreases the efficiency of up date operations by supporting multilevel entry and up dates. The semantics also provides a basis for the implementation of decomposition of extended relations.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 1998.10a
• /
• pp.204-209
• /
• 1998

The creation of favorable water space, in our living circumferential space, is a very important factor to offer rural scenery to neighbor residents. In other to arrange stream landscape, we developed Stream Landscape Simulation System(SLSS). SLSS is combined with image and database rotationally. SLSP system creates composed simulation image overlaying both background and landscape image. This system is to compare and estimate original landscape image with simulated one. SLSP system needs continuing development and buildup of Unified Relational Image Database(mm) to design of various landscape.

• Journal of Korean Society of Forest Science
• /
• v.88 no.1
• /
• pp.63-72
• /
• 1999

In this study, a relational database program to manage the data involved in forest planning was developed in such a way to simulate the whole process of 'Younglim' planning in Korean National Forest System. Using the pull-down menu system of various functions required for developing 'Younglim' plan, the database program can handle the data of forest inventory, 10-year working plans, annual working plans and the history of forest operations automatically and simultaneously. The model was designed to run under the environment of Korean version of Windows 95. Visual Basic 5.0 was used as the basic tool for programming and Microsoft ACCESS as the basic engine of the database system. In this paper, the process of designing the structure of database program following the process of 'Younglim' plan and the structure of the model are discussed. In addition, the functions of menu system are presented using the screen-mode output windows of the model.

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

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.789-800
• /
• 2002

XML is a standard format of web data and is currently used as a prevailing language for exchanging data. Most of the commercial data are stored in a relational database. It is quite important to convert these conventionally stored data into those for exchange and use them in data exchange, or to get the query results effectively by utilizing XQL on XML data which are store in a relational database. Thus, it is absolutely required to have a proper query processing mechanism for XML data and to maintain many XML data properly. Up to now, many cases of researches on the storage and retrieval of XML data have been carried out and under study. But, effective retrieval and storage system for path queries like XQL has yet to be contrived. Thus, in this paper, a schema to store XML data is designed, in which DFS-Numbegering method is used to store data effectively. And an effective path query processing method is also designed and implemented, in which a traditional relational database engine is used. That is, XQL is converted into SQL with a XQL processor if a user makes query XQL in a system. A database system executes SQL, and a XML generator uses a generated record and makes a XML document.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.1091-1096
• /
• 2002

This paper presents the development of a protein interaction database. The developed system is characterized as follows. First, the proposed system not only maintains interaction data collected by an experiment, but also the genomic information of the protein data. Secondly, the system can extract details on interacting proteins through the developed wrappers. Thirdly, the system is based on wrapper-based system in order to extract the biologically meaningful data from various web sources and integrate them into a relational database. The system inherits a layered-modular architecture by introducing a wrapper-mediator approach in order to solve the syntactic and semantic heterogeneity among multiple data sources. Currently the system has wrapped the relevant data for about 40% of about 11,500 proteins on average from various accessible sources. A wrapper-mediator approach makes a protein interaction data comprehensive and useful with support of data interoperability and integration. The developing database will be useful for mining further knowledge and analysis of human life in proteomics studies.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.519-526
• /
• 1994

In the large and multifunctional engineering system, the heterogeneous computer system situation is inevitable. Accordingly a lot of integration efforts are being made to comply with the industrial requirement of productivity. In this paper, a practical concept of integration is introduced through the development of a prototype system for ship outfitting design which is a typical example of large/multi-functional application system. On the development of the prototype system, three points are considered as a practical concept-which are integration of database, integration of application programs, and system-user interface. The relation model based commercial database management system(RDBMS) is used to build the project integrated database, and the graphical user interface tool(OSF/Motif) on X-window system is used for the integration of application programs and the user interface.