• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.125-127
• /
• 2006

A number of museums and related parties have tangible heritage data and those data are collected by different types and formats. In these days, there are no service which connect each others so if a user wants to search a data, user have to log on certain homepage and search data. In general relational database systems have used for tangible heritage but sometime there is no ontology information for such relational database system. Therefore, for efficient searching of tangible heritage, we need a method which is extracting ontology information from relational database system. And we need a method which makes alignment between local ontologies extracted from relational database system and global ontology which has global information of tangible heritage. In this paper, we propose a system which can search tangible heritage efficiently using a method of extracting ontology from RDBMS and a method of aligning between local ontology and global ontology.

• The Journal of Natural Sciences
• /
• v.5 no.2
• /
• pp.25-32
• /
• 1992

Statistical database(SDB) are large database primarily collected for purpose of statistical analysis. Commerical database management systems have not been widely used for SDB because of the efficiency problem of storage and access of those systems for SDB. In this paper, we propose SDB management method to use a front-end system to a Relatianal Datebase Management System (RDBMS). We do the design of SM-F system (Stasticical database Management as Front-end system) as a front-end system to a RDBMS. In the system, we use GROS model specially proposed for SDB, and store and manage summary database and meta database to support statistical analysis and to provide users with statistical summary information.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.5
• /
• pp.179-186
• /
• 2014

Current networks such as social network, web page link, traffic network are big data which have the large numbers of nodes and edges. Many applications such as social network services and navigation systems use these networks. Since big networks are not fit into the memory, existing in-memory based analysis techniques cannot provide high performance. Frontier-Expansion-Merge (FEM) framework for graph search operations using three corresponding operators in the relational database (RDB) context. FEM exploits an index table that stores pre-computed partial paths for efficient shortest path discovery. However, the index table of FEM has low hit ratio because the indices are determined by distances of indices rather than the possibility of containing a shortest path. In this paper, we propose an method that construct index table using high degree nodes having high hit ratio for efficient shortest path discovery. We experimentally verify that our index technique can support shortest path discovery efficiently in real-world datasets.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.420-428
• /
• 2003

XML is a data-oriented language to represent all types of documents including web documents. By means of the advent of XML-based document generation tools and grow of proprietary XML documents using those tools and translation from legacy data to XML documents at an accelerating pace, we have been gotten a large amount of differently-structured XML documents. Therefore, it is more and more important to retrieve the right documents from the document set. But, previous works on XML have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. And, researches that supported the structural difference did not efficiently process path queries on the document set. To resolve the problem, we suggested a new inverted index mechanism using RDBMS and proved it outperformed the previous works. And especially, as it showed the higher efficiency in indirect containment relationship, we argues that the index structure is fit for the differently-structured XML document set.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.151-162
• /
• 2006

RDF Semantics, one of W3C Recommendations, provides the RDFS entailment rules, which are used for the RDFS inference. Sesame, which is well known RDF repository, supports the RDBMS-based RDFS inference using the forward-chaining strategy. Since inferencing in the forward-chaining strategy is performed in the data loading time, the data loading time in Sesame is slow down be inferencing. In this paper, we propose the order scheme for applying the RDFS entailment rules to improve inference performance. The proposed application order makes the inference process terminate without repetition of the process for most cases and guarantees the completeness of inference result. Also the application order helps to reduce redundant results during the inference by predicting the results which were made already by previously applied rules. In this paper, we show that our approaches can improve the inference performance with comparisons to the original Sesame using several real-life RDF datasets.

• Journal of Korea Multimedia Society
• /
• v.11 no.4
• /
• pp.415-422
• /
• 2008

With the increasing use of XML, considerable research is being conducted on the XML document management systems for more efficient storage and searching of XML documents. Depending on the base systems, these researches can be classified into object-oriented DBMS (OODBMS) and relational DBMS (RDBMS). OODBMS-based systems are better suited to reflect the structure of XML-documents than RDBMS based ones. However, using an XML parser to map the contents of documents to relational tables is a better way to construct a stable and effective XML document management system. The proposed X-Binder system uses an RDBMS-based inverted index; this guarantees high searching speed but wastes considerable storage space. To avoid this, the proposed system incorporates a path combining module agent that combines paths with sibling relations, and stores them in a single row. Performance evaluation revealed that the proposed system reduces storage wastage and search time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.645-651
• /
• 2019

At a time when large amounts of data are being poured out, there are many changes in software architecture or data storage patterns because of the nature of the data being written, rather more read-intensive than writing. Accordingly, in this paper, the query model of Command Query Responsibility Segmentation (CQRS) pattern separating the responsibilities of commands and queries is used to implement an efficient high-capacity data lookup system in users' requirements. This paper uses the 2018 temperature, humidity and precipitation data of the Korea Meteorological Administration Open API to store about 2.3 billion data suitable for RDBMS (PostgreSQL) and NoSQL (MongoDB). It also compares and analyzes the performance of systems with CQRS pattern applied from the perspective of the web server (Web Server) implemented and systems without CQRS pattern, the storage structure performance of each database, and the performance corresponding to the data processing characteristics.

• Digital Contents
• /
• no.6 s.49
• /
• pp.2-6
• /
• 1997

최근들어 전산실에서 OLTP시스템이 필수로 자리잡고 있는데, 이것과 동일선상에서 데이터 웨어하우스가 접목될 것이라고 보고 이 시장을 공략하는 업체들이 늘어나고 있다. 한국오라클과 한국인포믹스 등 RDBMS 선두업체는 물론, 한국디지탈과 마이크로소프트 등 하드웨어와 소프트웨어 선두업체들도 서둘러 데이터 웨어하우스 시장에 진입, 올해 시장을 노리고 있다. 뿐만 아니라 연내 SI업체는 모두 데이터 웨어하우스 시장에 들어올 것이라고 관계자들은 예측하고 있다.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1539-1550
• /
• 2007

As XML is increasingly used for representing and exchanging data, relational database systems have been trying extend their features to handle XML documents XML documents can be stored in a column with XML data type like primitive types. The shredding method, which is one of the traditional methods for storing and managing XML documents in RDBMS, is still useful and viable although it has some drawbacks due to the structural discrepancy between XML and relational databases. This method may be suitable for data-centric XML documents with simple schema. This paper presents the extended version of the Association inlining method that is based on inlined shredding and compares the performance of querying processing to that of XML type method of conventional relational database systems. The experiments showed that in most cases our method resulted in better performance than the other method based on XML data type. This is due to the fact that our shredding method keeps and uses the order and path information of XML documents. The path table has the information of the corresponding table and column for each distinct path and the structure information of the XML document is extracted and stored in data tables.

• Spatial Information Research
• /
• v.21 no.2
• /
• pp.73-83
• /
• 2013

3D cadaster problems are getting attention and studied increasingly. However, correct concepts have not been established for three dimensional land uses and different rights problems around them. This is primarily due to the lack of proper methods for implementation and operation of 3D cadaster. 3D cadaster requiring far more huge data than 2D should be built in DBMS and need appropriate methods and processes for this. This study propose a method to model 3D cadaster using DBMS. First, it analyse and visualize possible problems around divided superficies in 3D spaces. Based on this, it illustrates UML models and shows an O-R mapping process to implement them using a RDBMS.