• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.44-53
• /
• 2008

According to the widespread use of ontology-based applications, it is critical to efficiently store and process semantic information. Even though several related systems have been developed, they have some limitations in perspectives of the volume of target semantic data, the performance of semantic query processing, and the semantic data maintenance. In this paper we propose the OWL-aware relational model for the ontology management system and SQL-based semantic query processing mechanism. Also, to verify the query processing performance, we show that the proposed query professing mechanism is more efficient than sesame.

• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.191-202
• /
• 2005

The Semantic Web Services is a next-generation Web technology that supports Web services, based on the semantic Web technologies. Until now, the researches on semantic Web services may be foiled on the semantic Web document management and the inference engine to efficiently process the semantic Queries. However, in order to realize the principle semantic Web environment it is necessary to provide a semantic query interface though which users and/or agents can efficiently request semantic information. In this regard, we propose the Semantic Query Adapter(SQA) to provide a high query transparency with users, especially when querying about a complex semantic information. We first design the procedural user query interface based on a graphic view, by analyzing DAML-S Profile documents. And then, we builds a module which a user input query transforms its corresponding RDQL. We also propose the multiple semantic query generating procedure as a new method to solve the disjunctive query problem of the RDQL primitive.

• Journal of Advanced Navigation Technology
• /
• v.12 no.4
• /
• pp.372-377
• /
• 2008

This paper proposes a new query-based document summarization method using the semantic feature matrix and the semantic variable matrix. The proposed method doesn't need the training phase using training data comprising queries and query specific documents. And it exactly summarizes documents for the given query by using semantic features and semantic variables that is better at identifying sub-topics of document. Because the NMF have a great power to naturally extract semantic features representing the inherent structure of a document. The experimental results show that the proposed method achieves better performance than other methods.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.107-116
• /
• 2012

The applying of semantic technologies that aim to let computers understand and automatically process the meaning of the interlinked data on the Web is spreading. In Semantic Web, understanding and accessing the associations between data that is, the meaning between data as well as accessing to the data itself is important. W3C recommended RDF (Resource Description Framework) as a standard format to represent both Semantic Web data and their associations and also proposed several RDF query languages in order to support query processing for RDF data. However further researches on the query language definition considering the semantic associations and query processing techniques are still required. In this paper, using the suffix array-based indexing scheme previously introduced for RDF query processing, we propose a query processing approach to handle ${\rho}$-path query which is the representative type of semantic associations. To evaluate the query processing performance of the proposed approach, we implemented two different types of query processing approaches and measured the average query processing times. The experiments show that the proposed approach achieved 1.8 to 2.5 and 3.8 to 11 times better performance respectively than others two.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.59-72
• /
• 2013

In this paper, we propose a keyword query processing technique based on semantic relationships for OWL data. The proposed keyword query processing technique can improve user's search satisfaction by performing two types of associative search. The first associative search uses information inferred by the relationships between classes or properties during keyword query processing. And it supports to search all information resources that are either directly or indirectly related with query keywords by semantic relationships between information resources. The second associative search returns not only information resources related with query keywords but also values of properties of them. We design a storage schema and index structures to support the proposed technique. And we propose evaluation functions to rank retrieved information resources according to three criteria. Finally, we evaluate the validity and accuracy of the proposed technique through experiments. The proposed technique can be utilized in a variety of fields, such as paper retrieval and multimedia retrieval.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.2
• /
• pp.97-104
• /
• 2017

In semantic information retrieval, we first need to build domain ontology and second, we need to convert the users' search keywords into a standard query such as SPARQL. In this paper, we propose a method that can automatically convert the users' search keywords into the SPARQL queries. Furthermore, our method can ensure effective performance in a specific domain such as law. Our method constructs the keyword history ontology by associating each keyword with a series of information when there are multiple keywords. The constructed ontology will convert keyword history ontology into SPARQL query. The automatic transformation method of SPARQL query proposed in the paper is converted into the query statement that is deemed the most appropriate by the user's intended keywords. Our study is based on the existing legal ontology constructions that supplement and reconstruct schema and use it as experiment. In addition, design and implementation of a semantic search tool based on legal domain and conduct experiments. Based on the method proposed in this paper, the semantic information retrieval based on the keyword is made possible in a legal domain. And, such a method can be applied to the other domains.

• Journal of Digital Convergence
• /
• v.11 no.3
• /
• pp.285-292
• /
• 2013

The method of recent information retrieval passes into an semantic search to provide more accurate results than keyword-based search. But in common user case, they are still accustomed to using existing keyword-based search. Hence they are hard to create a typed structured query language. In this paper, we propose to ontology knowledge-base scheme for query interpretation of these user. The proposed scheme was designed based on the OWL-DL for description logic reasoning, it can provide a richer representation of the relationship between the object by using SWRL(Semantic Web Rule Language). Finally, we are describe the experimental results of the similarity measurement for verification of a user query semantic interpretation.

• International Journal of Contents
• /
• v.1 no.2
• /
• pp.39-43
• /
• 2005

In this paper, we describe a generation mechanism of semantic-based queries for high accuracy information retrieval and question answering. It is difficult to offer the correct retrieval result because general information retrieval systems do not analyze the semantic of user's natural language question. We analyze user's question semantically and extract semantic features, and we .generate semantic-based queries using them. These queries are generated using the se-mantic-based question analysis grammar and the query generation rule. They are represented as semantic features and grammatical morphemes that consider semantic and syntactic structure of user's questions. We evaluated our mechanism using 100 questions whose answer type is a person in the TREC-9 corpus and Web. There was a 0.28 improvement in the precision at 10 documents when semantic-based queries were used for information retrieval.

• Journal of Digital Convergence
• /
• v.10 no.10
• /
• pp.307-312
• /
• 2012

For semantic search methods to provide more accurate results than keyword-based search in a logical representation that uses a knowledge base are being studied. Than most of the user to use formal query language and schema used to interpret the meaning of a user keyword. In this paper, we propose to expand the user query for semantic search. In the proposed system, user query expansion component and a component to adjust the results to interpret user queries to take advantage of the knowledge base associated with a search term. Finally, a user query semantic interpretation, the proposed scheme to verify the experimental results of the prototype system is described.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.1
• /
• pp.125-136
• /
• 2007

The study on query relaxation which provides approximate answers has received attention. In recent years, some arguments have been made that semantic relationships are useful to present the relationships among data values and calculating the semantic distance between two data values can be used as a quantitative measure to express relative distance. The aim of this article is a hierarchical metricized knowledge abstraction (HiMKA) with an emphasis on combining data abstraction hierarchy and distance measure among data values. We propose the operations and the query relaxation algorithm appropriate to the HiMKA. With various experiments and comparison with other method, we show that the HiMKA is very useful for the quantified approximate query answering and our result is to offer a new methodological framework for query relaxation.