• Journal of the Korean Society for information Management
• /
• v.30 no.3
• /
• pp.23-48
• /
• 2013

This study compared and analyzed 15 CBMR (Content-based Music Retrieval) systems accessible on the web in terms of DB size and type, query type, access point, input and output type, and search functions, with reviewing features of music information and techniques used for transforming or transcribing of music sources, extracting and segmenting melodies, extracting and indexing features of music, and matching algorithms for CBMR systems. Application of text information retrieval techniques such as inverted indexing, N-gram indexing, Boolean search, truncation, keyword and phrase search, normalization, filtering, browsing, exact matching, similarity measure using edit distance, sorting, etc. to enhancing the CBMR; effort for increasing DB size and usability; and problems in extracting melodies, deleting stop notes in queries, and using solfege as pitch information were found as the results of analysis.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.132-142
• /
• 2008

In biological domain, there exist a variety of protein analysis databases which have their own meaning toward the same target of protein. If we integrate these scattered heterogeneous data efficiently, we can obtain useful information which otherwise cannot be found from each original source. Reflecting the characteristics of biological data, each data source has its own syntax and semantics. If we describe these data through RDF(S) models, one of the Semantic Web standards, we can achieve not only syntactic but also semantic integration. In this paper, we propose a new concept of integration layer based on the RDF unified schema. As a conceptual model, we construct a unified schema focusing on the protein information; as a representational model, we propose a technique for the wrappers to aggregate necessary information from the relevant sources and dynamically generate RDF instances. Two example queries show that our integration layer succeeds in processing the integrated requests from users and displaying the appropriate results.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.247-258
• /
• 2005

Protein structure is highly related to its function and comparing protein structure is very important to identify structural motif, family and their function. In this paper, we construct an integrated database system which has all the protein structure data and their literature. The structure queries from the web interface are compared with the target structures in database, and the results are shown to the user for future analysis. To constructs this system, we analyze the Flat-File of Protein Data Bank. Then we select the necessary structure data and store as a new formatted data. The literature data related to these structures are stored in a relational database to query the my kinds of data easily In our structure comparison system, the structure of matched pattern and RMSD valure are calculated, then they are showed to the user with their relational documentation data. This system provides the more quick comparison and nice analyzing environment.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.17-26
• /
• 2005

With the rapidly Slowing information, the research on the effcient information retrieval is increasing. Most of the retrieval systems for domestic cultural assets on the web have adopted a keyword-based search method. Those systems have required users to know the exact information about cultural assets such as name, keyword, etc. However, it is not easy to search the cultural assets with little information or only a remembrance of the shape. In this paper, we propose the retrieval system for cultural assets using both ontology-based and sketch-based search method to solve the Problems of existing systems. Our retrieval system allows users to use both text and sketch for a Query regardless of the type of information about cultural assets and to search in results using the ontology.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.43-52
• /
• 2011

Recently, interest in location-based service (LBS) which utilizes a DBMS in mobile system environment has been increasing, and it is expected to overcome the existing file-based system's limitation in advanced in-vehicle system by utilizing DBMS's advantages such as efficient storage, transaction management, modelling and spatial queries etc. In particular, the road network data corresponds to the most essential domain in a route planning system, which needs efficient management and maintenance. Accordingly, this study aims to develop an efficient graph-based geodata model for topological network data and to support dynamic path computation algorithm based on heuristic approach in mobile LBS system. To achieve this goal, we design a data model for supporting the hierarchy of network, and implement a path planning system to evaluate its performance in mobile LBS system. Last but not least, we find out that the designed path computation algorithm with hierarchical graph model reduced the number of nodes used for finding and improved the efficiency of memory.

• The Journal of the Korea Contents Association
• /
• v.14 no.10
• /
• pp.438-453
• /
• 2014

This paper proposes a system to translate an RDB into an OWL ontology which enables the users to navigate the ontology in GUI. In order to accomplish the goals mentioned previously, the system overcame two difficulties. First, our system defines a new mapping algorithm to map between DB elements and ontology ones. Comparing with existing solutions, our algorithm is able to generate ontologies from more DB structures. Second, our system provides the same data generated by a reasoner to the users. Note that this operation does not load ABox ontology on a reasoner. In addition, Tableau-based reasoners have the tractability problem on a large ABox (e.g., large ABoxes translated from DBs practically cannot be served). To solve this, our system internally runs SQL queries to retrieve the same data as the one from a reasoner every time ABox elements are queried.

• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.553-568
• /
• 2005

In order to integrate distributed biological information sources physically or virtually, it is necessary to overcome the heterogeneity of information sources and support a superior generality and adaptation in order to satisfy user's various demands. In this paper, we present a flexible and general XML query engine of a wrapper system in designing the middleware system to integrate data as well as application programs. Since this query engine applies user-defined XML view, it is possible to composite flexible integrated query. The query processing in a wrapper requires view composition, query translation into local sources, and generation of XML documents from local query results. We present a query processing model based on the view tree, where the n views and the XML queries are represented by the view tree. Moreover, to confirm the generality of our query processing model, we present a methodology of query processing for relational databases, web sources, and application programs whose return types of query results are relational tuples or XML documents.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.157-164
• /
• 2006

Since XML is emerging as the de facto standard for exchanging and representation of data on the web, the amount of XML data has rapidly increased. Thus, the need for effective store and retrieval of U data has arisen. Since the existing techniques such as XRel which is an XML storage and management technique using RDBMS simply record the existing all label paths, diverse classes of label path expressions could not be efficiently supported. In this paper, we present a technique which supports storage and retrieval for XML data using RDBMS efficiently compared with the existing approaches. Since the proposed technique keeps the XML path index on the relational database and replace label paths with path identifiers, diverse XML queries can be evaluated compared with existing approaches. Also, the proposed technique does not require the modification of the relational database engine and consumes the disk space less. Our experimental result demonstrates the better query performance compared with existing techniques.

• Journal of Digital Contents Society
• /
• v.10 no.1
• /
• pp.1-10
• /
• 2009

One important issue to generalize the ubiquitous paradigm is the development of user-centralized and intelligent ubiquitous computing systems. Sharing knowledge and correct communication between users and devices are needed to be aware of continuous changed context information and infer services for which users are suited. The goal of this paper is to describe and manage effectively the meaning of services or data which each device offers for interaction between users and devices based on semantic relationships and reasoning. In this paper, we represent semantic data using OWL and design a ubiquitous based intelligent system. We propose some index structures and strategies to process queries classified by each subsystem and adopt labeling schemes to identify classes and resources in the semantic data. We can find devices which satisfies various user's requests exactly and quickly using the proposed strategies.

• Journal of Digital Contents Society
• /
• v.10 no.1
• /
• pp.129-145
• /
• 2009

As the secure distribution and sharing of information over the World Wide Web becomes increasingly important, the needs for flexible and efficient support of access control systems naturally arise. Since the eXtensible Markup Language (XML) is emerging as the de-facto standard format of the Internet era for storing and exchanging information, there have been recently, many proposals to extend the XML model to incorporate security aspects. To the lesser or greater extent, however, such proposals neglect the fact that the data for XML documents will most likely reside in relational databases, and consequently do not utilize various security models proposed for and implemented in relational databases. In this paper, we take a rather different approach. We explore how to support security models for XML documents by leveraging on techniques developed for relational databases considering object perspective. More specifically, in our approach, (1) Users make XML queries against the given XML view/schema, (2) Access controls for XML data are specified in the relational database, (3) Data are stored in relational databases, (4) Security check and query evaluation are also done in relational databases, and (5) Controlling access control is executed considering XML tree levels