• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.148-150
• /
• 2000

웹이 빠른 속도로 증가짐에 따라 사용자들은 점차 원하는 리소스를 얻기가 힘들어지고 있다. 비록 기존의 검색엔진이 도움을 주고 있지만, 하나의 서버가 방대하고 다양한 종류의 웹 리소스들을 모두 구분해 서비스하는 것은 점차 그 한계를 드러내고 있다. 본 논문에서는 각 검색서버들이 분류화된 이름공간내에서 검색서비스를 하고 이들을 하나의 질의 인터페이스로 통합할 수 있는 방안을 제안하고, 그 시스템을 설계하고자 한다. 제안된 시스템은 XML을 사용하는 CNRP(Common Name Resolution Protocol)을 기반으로 하여 여러 검색 서버의 결과를 쉽게 통합하고, 검색된 데이터를 일반 응용프로그램에서도 사용할 수 있으며, 동적으로 생성되는 질의 인터페이스를 통해 어떠한 검색 시스템으로도 확장이 가능하다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.154-156
• /
• 2003

웹 상의 데이터 표현 및 교환의 표준으로 각광받는 XML은 논리적 구조와 내용 정보를 이용하여 보다 정확한 검색이 가능하다. 그러나 더욱 빠른 속도로 증가하는 많은 양의 데이터에 대해 보다 정확하고 풍부한 검색을 하기 위해서 메타데이터를 활용하는 방법이 고려되었고, RDF와 같은 메타데이터 기술 언어들에 대한 연구가 많이 이루어지고 있다. RDF는 XML의 문법 구조를 이용하여 작성되므로 XML 문서를 RDF 형태로 작성한다던가, 약간의 수정을 통해 기존 XML 문서를 RDF 형태로 변환하는 것이 가능하다. XML의 RDF 변환은 여러 이점 때문에 앞으로 활성화될 가능성이 크기 때문에 RDF의 특성을 고려한 저장 및 검색에 대한 연구가 필요하다. 따라서 본 논문에서는 XML을 기본적인 RDF 형태로 변환하는 기본적인 규칙을 소개하고 변환된 RDF 문서를 위한 저장 구조를 제안한다. 제안한 저장 구조는 기존 웹 애플리케이션과의 쉬운 연동을 위하여 관계형 데이터베이스를 기반으로 구성되며, 리소스/속성/값의 RDF 기본 구조를 고려한 세 종류의 테이블로 구성된다. 또한 본 논문에서는 RDF 문서에 대한 키워드 질의 처리를 고려하여, 질의 처리 결과의 단위를 리소스로 정의한다. 그리고 주어진 키워드들에 대한 질의 처리 결과로 반환된 리소스들 간의 중요도를 평가하기 위하여 키워드간의 근접도, 키워드 내포 정도, 다양한 속성 관계를 맺고 있는 다른 리소스들을 고려한 랭킹 평가 기법을 제안한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.433-435
• /
• 2022

In this paper, we introduce a computing resource standard metadata schema design plan for registering, retrieving, and managing computing resources used for research data analysis and utilization in the Korea Research Data Commons(KRDC). KRDC is a joint utilization system of research data and computing resources to maximize the sharing and utilization of research data. Computing resources refer to all resources in the computing environment, such as analysis infrastructure and analysis software, necessary to analyze and utilize research data used in the entire research process. The standard metadata schema for KRDC computing resource management is designed by considering common attributes for computing resource management and other attributes according to each computing resource feature. The standard metadata schema for computing resource management consists of a computing resource metadata schema and a computing resource provider metadata schema. In addition, the metadata schema of computing resources and providers was designed as a service schema and a system schema group according to their characteristics. The standard metadata schema designed in this paper is used for computing resource registration, retrieval, management, and workflow services for computing resource providers and computing resource users through the KRDC web service, and is designed in a scalable form for various computing resource links.

• Journal of Satellite, Information and Communications
• /
• v.7 no.3
• /
• pp.86-93
• /
• 2012

In this paper, we propose keyword search and ranking methods for OWL documents that describe metadata and ontology on the Semantic Web. The proposed keyword search method defines a unit of keyword search result as an information resource and expands a scope of query keyword to names of class and property or literal data. And we reflected derived information by inference in the keyword search by considering the elements of OWL documents such as hierarchical relationship of classes or properties and equal relationship of classes. In addition, our method can search a large number of information resources that are relevant to query keywords because of information resources indirectly associated with query keywords through semantic relationship. Our ranking method can improve user's search satisfaction because of involving a variety of factors in the ranking by considering the characteristics of OWL. The proposed methods can be used to retrieve digital contents, such as broadcast programs.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.3
• /
• pp.56-61
• /
• 2012

User authentication is a necessity to set up secure system which only an authorized user can use various resource on the Internet. Encryption is to provide data privacy. Also, searchable encryption is to provide both data privacy and efficient management of data by searching with a keyword. The public key based searchable encryption requires in advance the authentication of user's public key as well as the secure management of a publlic/private key of a user, respectively. In cloud, it is purpose to use cloud various resources by using various devices, meanwhile, it is not sufficient resource that some devices manage public/private keys and certificates and it is not easy to implement these clients. To solve this problem, we propose a password-based saerchable encryption using smart cards which are temper-resistant devices.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.95-103
• /
• 2011

The actual utilization of Semantic Web technology which aims to provide more intelligent and automated service for information retrieval over the Web becomes gradually reality. RDF is widely used as the one of standard formats to present and manage the voluminous data on the Web. Efficient query processing on RDF data, therefore, is one of the ongoing research topics. Retrieving resources having a specific association from a given resource is the typical query processing type and several researches for this have done. However the most of previous researches have not fully considered discovering the complex relationship among resources such as returning the association between resources as the query processing result. This paper introduces the indexing and query processing for ${\rho}$-intersect operation which is one of the semantic association retrieval types. It includes an indexing scheme using suffix array and optimal processing approaches for handling ${\rho}$-intersect operation. The experimental evaluations shows that the average execution times for the proposed approach is 3~7 times faster than the previous approach.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1169-1178
• /
• 2008

Most of information in Web2.0 is constructed by users and can be classified by tags which are also constructed and added by users. However, as we known, referring by the related works such as automatic tagging techniques and tag cloud's construction techniques, the research to be classified information and resources by tags effectively is to be given users which is still up to the mark. In this paper, we propose and implement a clustering system that does mapping each other according to relationships of the resource's tags collected from Web and then makes the mapping result into clusters to retrieve images. Tn addition, we analyze our system's efficiency by comparing our proposed system's image retrieval result with the image retrieval results searched by Flickr website.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.691-699
• /
• 2011

Recently, diverse approaches retrieval services based on social network are suggested. Although existing recommendation systems can retrieve experts of specific fields, profiles and evaluations about experts that users want to be recommended are in a system. The proposed expert recommendation system can automatize collection of evaluation to evaluate experts and experts' profiles in separate systems by using the Knowledge Base and XMDR. We also attempt to construct system which can recommend a number of experts by dynamically constructing Social Network by using diverse resources distributed 로컬ly and composed of heterogeneous data sources. To resolve these problems efficiently, there is a need to provide constructed resources between heterogeneous systems with transparency and independence and provide users with a singular interface. Therefore, the proposed system in this paper uses Knowledge Base and XMDR for extracting distributed experts' profiles and designs expert recommendation system connecting Knowledge Base with Social Network.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.93-102
• /
• 2007

Metadata and ontology can be used to retrieve related information through the inference mure accurately and simply on the Semantic Web. RDF and RDF Schema are general languages for representing metadata and ontology. An enormous number of keywords on the Semantic Web are very important to make practical applications of the Semantic Web because most users prefer to search with keywords. In this paper, we consider a resource as a unit of query results. And we classily queries with keyword conditions into three patterns and propose indexing techniques for keyword-search considering both metadata and ontology. Our index maintains resources that contain keywords indirectly using conceptual relationships between resources as well as resources that contain keywords directly. So, if user wants to search resources that contain a certain keyword, all resources are retrieved using our keyword index. We propose a structure of table for storing RDF Schema information that is labeled using some simple methods.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.35-44
• /
• 2011

Ontologies are playing an important role in semantic web which is emerging as a next stage of the web revolution because various kinds of metadata are described in ontologies. Correspondingly, many query languages like SPARQL, RDQL etc. have been proposed for querying these ontologies. But users have to know the structures and resource names of ontologies completely to get search results even if they have expertise on complex formal logic and syntax of the query languages. Especially, casual users do not know the resource names and may use different words from resource names when they write their query language. This vocabulary gap problem have to be solved to raise the success rate. In this paper, an approach for translating user's search words to corresponding resource names has been proposed. This approach uses semantic similarity between user created search words and ontology resource names.