• The KIPS Transactions:PartD
• /
• 제8D권2호
• /
• pp.117-124
• /
• 2001

A data mining system includes various data mining functions such as aggregation, association and classification, among others. To express these data mining function, a powerful data mining query language is needed. In addition, a graphic user interface(GUI) based on the data mining query language is needed for users. In addition, processing a data mining query targeted for a data warehouse, which is the appropriate data repository for decision making, is needed. In this paper, we first build a GUI to enable users to easily define data mining queries. We then propose a data mining query processing framework that can be used to process a data mining query targeted for a data warehouse. We also implement a schema generate a data warehouse schema that is needed to build a data warehouse. Lastly, we show the implementation details of a query processor that can process queries that discover association rules.

• Journal of the Korean Institute of Intelligent Systems
• /
• 제24권3호
• /
• pp.239-244
• /
• 2014

As the usefulness of mobile device is kept growing the privacy of the cloud computing is receiving more attentions. Even though many researches and solutions for privacy matters are suggested we are still worrying about the security problems. In addition most of cloud computing systems uses file-level synchronization which make it difficult to modify a part of a file. If we use data-centric app that stores data on embedded DBMS such as SQLite, a simple synchronization may incur some loss of information. In this paper we propose a solution to build a personal cloud that supports record-level synchronization. And we show a prototype system which uses RESTful web services and the same schema on mobie devices and the cloud storage. Synchronization is achieved by using a kind of optimistic concurrency control.

• Journal of the Korea Society of Computer and Information
• /
• 제16권7호
• /
• pp.35-47
• /
• 2011

This paper proposes a set of rules to automatically generate OWL ontologies from relational databases. The purpose of the rules is to allow semantic access to existing RDB data without any database schema transformation and data migration process. In other words, the rules help a RDBMS play as a web ontology repository as well. However, the use of the mapping rules between RDB and OWL proposed by other studies for the objective causes troubles as follows. First, databases including the tables with a specific structure can't be translated into OWL. Second, the process for extracting an OWL individual unnecessarily lead to database join operations, or several SQL queries. On the other hand, our rules is designed to prevent these problems, can generate OWL classes and properties from database schemas and can generate OWL individuals from the database instances. In addition, an ontology generated by our rules is an OWL 2 DL ontology.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제13권3호
• /
• pp.498-504
• /
• 2009

In the PACS system, the radiology image(X-ray) and its report are saved as separated parts. The exchange of the radiology image between clinics that installed this system are easily achieved by the DICOM standardization. But it is difficult to exchange the radiology report between clinics because a solution of PACS system is different according to manufacturers. The radiology report should be unified the vocabulary and the type of code for effective sharing and exchanging, and also the radiology image and its report should be integrated for the accurate analysis. In this paper, we propose the sharing system of medical information based on HL7-CDA, it defines the templates and converts the structured documents. For this purpose, we design the XML schema of the radiology report and turn the DICOM files into defined schema. The HL7-CDA documents based on XML is easily displayed on web browser and can help the diagnosis by inserting the radiology image.

• Journal of Navigation and Port Research
• /
• 제30권8호
• /
• pp.623-629
• /
• 2006

Recently, bemuse of extensive use of hydrographic information, interoperability of Marine Geographic products is very important for efficient use of geographic information systems. Open GIS Consortium(OGC) developed the Open Geodata Interoperability Specification(OpenGIS) to support the interoperability in the distributed environment, especially Geography Markup Language(GML) Implementation Specification. Geography Markup Language is an XML grammar written in XML Schema for the modelling, transporting, and storing of geographic information GML provides a variety of objects for describing geography including features, coordinate reference systems, geometry, topology, time, units of measure and generalized values. S-57 is currently the IHO standard for the exchange of digital hydrographic data. To date, it ms been used almost exclusively for encoding Electronic Navigational Charts(ENCs). Even though, S-57 is intended to support all types of hydrographic data. In order to meet this requirement, a new standard is being developed. GML will be the core encoding rule of IHO's new standard. But there has been no study that tried to develop the GML for ENC that are recognized as base mop in the Marine GIS. This paper presents the process and results on development of application schema for converting ENC into GML.

• The Transactions of the Korea Information Processing Society
• /
• 제4권4호
• /
• pp.908-922
• /
• 1997

In this paper,we present an dffcient way to describe the commplex meaning embedded in video data for the cintent-based retrival in a video database.Intead of viewing the data stored in a file as continuous bit stream,we associate the desired interval in the stream with a set of atteibute and value pairs which describe its meaning.Since the meaning of video data can be cimplex and can change dyamically. It is necessary to com-bine the fixed schema of attributes used in the traditional database systrm with a description method through a set of attribute and value pairs that can be defined dynamically.As the cintent of viedo data can be expressed differently according to the view point of a user,it is important ot maintain the meaning of the attribute and value pairs cinsistently for different users.This paper proposes the dffctive way to manage the set of attri-bute and value pairs.In addition,it also describes a way to define a new video presentation by separating a video stream phsycally or by sharing the portion of a bit stream,and the new method can minimize the required storage space.

• Journal of KIISE:Computing Practices and Letters
• /
• 제11권4호
• /
• pp.381-392
• /
• 2005

Computing has been making a lot of progress in the quantity of data, today. It's going to be more difficult to get appropriate information as the number of data increases dramatically. Therefore it's more important to get meaningful information than to focus on the speed of processing. Semantic web enables an intelligent processing by adding semantic information to data, and it is useful to make ontology system. In this Paper, we implemented ontology Processing system which support function for ontology and efficient processing for practical service. We proposed system design for independent from storage, storing technique for RDB, caching technique by schema information and useful user interface.

• Journal of KIISE:Databases
• /
• 제33권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 the Korea Institute of Information and Communication Engineering
• /
• 제12권12호
• /
• pp.2207-2218
• /
• 2008

Various kind of business process exists within enterprise. These business processes achieve business purposes while operate and control using eAI solution. However legacy systems-ERP, PDM are able to many cooperations and interoperability. Generally real data is becoming interoperability using query based on store-procedure on legacy system for business process transaction. Also, It may occur some problems among schema conversion, matching, mapping and other heterogeneous between data interoperability in process. We propose business process interoperability framework based on XMDR Hub that can guarantee interoperability between legacy systems using process that is consisted of SQL query based on store-procedure. It is easy to process data interoperability between legacy systems when business process execute.

• The KIPS Transactions:PartD
• /
• 제12D권5호
• /
• pp.663-672
• /
• 2005

This Paper Proposes an approach that removes the redundancy of Path information and uses an inverted index, as an efficient way to store a large volume of XML documents and to retrieve wanted information from there. An XML document is decomposed into nodes based on its tree structure, and stored in relational tables according to the node type, with path information from the root to each node. The existing methods using path information store data for all element paths, which cause retrieval performance to be decreased with increased data volume. Our approach stores only data for leaf element path excluding internal element paths. As the inverted index is made by the leaf element path only, the number of posting lists by key words become smaller than those of the existing methods. For the storage and retrieval of U data, our approach doesn't require the XML schema information of XML documents and any extension of relational database. We demonstrate the better performance of on approach than the existing approaches within the scope of our experiment.