• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.150-152
• /
• 2005

인터넷 상의 컴퓨팅 자원을 오버레이 네트워크를 구성하여 새로운 컴퓨팅 인프라를 구성하려는 연구가 분산 해쉬 테이블 (Distributed Hash Table) 방식의 Peer-to-Peer(P2P) 네트워크로 실현되고 있다. DHT 방식의 P2P 네트워크는 자원의 복제 및 공유하여 컴퓨팅 시스템 전반에 걸친 신뢰성과 결함감내 능력을 향상시키고 Exactly Matching Query에 장점이 있는 반면에 다중키 질의, 계층 질의 및 구간 질의와 같은 복합 질의(Rich Query) 제원에 문제점을 드러낸다. 이 논문에서는 DHT 기반의 P2P 네트워크에서 Rich Query 를 지원하기 위한 방법을 소개한다.

• Journal of Information Technology Applications and Management
• /
• v.11 no.2
• /
• pp.227-237
• /
• 2004

While the WWW offers an incredibly rich base of information, organized as a hypertext, it does not provide a uniform and efficient way to retrieve specific information. When one tries to find information entering several query terms into a search engine, the highly-ranked pages in the result usually contain many irrelevant or useless pages. The problem is that single-term queries do not contain sufficient information to specify exactly which web pages are needed by the user. The purpose of this paper is to describe the employment of association rules in data mining for developing networks and computing associative coefficient among the terms. And this paper shows how the dynamic query expansion and/or reduction can be performed in information retrieval.

• KIISE Transactions on Computing Practices
• /
• v.21 no.7
• /
• pp.452-457
• /
• 2015

In this paper, we propose a spatial query processor, SQUERY, which can derive rich query results through spatial reasoning on the initial knowledge base, as well as, process both qualitative and quantitative queries about the topological and directional relationships between spatial objects. In order to derive richer query results, the query processor expands the knowledge base by applying forward spatial reasoning into the initial knowledge base in a preprocessing step. The proposed query processor uses not only qualitative spatial knowledge describing topological/directional relationship between spatial objects, but also utilizes quantitative spatial knowledge including geometric data of individual spatial objects through geometric computation. The results of an experiment with the OSM(Open Street Map) spatial knowledge base demonstrates the high performance of our spatial query processing system.

• The KIPS Transactions:PartB
• /
• v.11B no.5
• /
• pp.537-544
• /
• 2004

The Web is rich with various sources of information. Due to the massive and heterogeneous web document collections, users want to find various types of target pages. Each type of information for Web search has designated queries. If a user query is not a designated query, then we cannot have good result documents. Different strategies are needed to utilize the goodness of each type of information for a search engine. If we know the property of information, then we can refine candidate pages and rank them delicately. Various experiments are conducted to show the properties of each type of information. Therefore, we show an appropriate combining formula to utilize the properties of each type of information. In addition, for a service finding task, we propose Service Link Information that utilizes the existence of mechanisms for a user interaction.

• Journal of Information Science Theory and Practice
• /
• v.8 no.4
• /
• pp.67-86
• /
• 2020

Information need has been one of the main motivations for a person using a search engine. Queries can represent very different information needs. Ironically, a query can be a poor representation of the information need because the user can find it difficult to express the information need. Query Expansion (QE) is being popularly used to address this limitation. While QE can be considered as a language-independent technique, recent findings have shown that in certain cases, language plays an important role. Arabic is a language with a particularly large vocabulary rich in words with synonymous shades of meaning and has high morphological complexity. This paper, therefore, provides a review on QE for Arabic information retrieval, the intention being to identify the recent state-of-the-art of this burgeoning area. In this review, we primarily discuss statistical QE approaches that include document analysis, search, browse log analyses, and web knowledge analyses, in addition to the semantic QE approaches, which use semantic knowledge structures to extract meaningful word relationships. Finally, our conclusion is that QE regarding the Arabic language is subjected to additional investigation and research due to the intricate nature of this language.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.718-722
• /
• 2008

Ontology plays an important role of the Semantic Web to describe meaning and reasoning of resources. Ontology has more rich expressive power through OWL that is a next standard representation language recommended by W3C. As the Semantic Web is widely known, an amount of information resources on the Web is growing rapidly and the related information resources are placed in distributed systems on the Web. So, for providing seamless services without the awareness of far distance, efficient management of the distributed information resources is required. Especially, sear ching fast for local repositories that include data related to user's queries is important to the performance of systems in the distributed environment. In this paper, first, we propose an index structure to search local repositories related to queries in the distributed Semantic Web. Second, we propose a query rewriting strategy to extend given user's query using various expression of OWL. Through the proposed index and query strategy, we can utilize various expressions of OWL and find local repositories related to all query patterns on the Semantic Web.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.402-406
• /
• 2007

Rich Internet Application(RIA) is one of the Web 2.0 technologies and is expected to be a next generation user interface technique which allows flexible and dynamic manipulation for Web searches. This paper addresses a personalization mechanism for advanced Web search using RIA for abundant user interactions. We devised a dynamic and graphical user interface instead of previous text-based searches and a client side application for storing personal preference information. In this research, we implemented the graphical personalized search manager using Yahoo web search API and widget, and demonstrated its effectiveness by performing some experiments with various query terms and representative predicates.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.1-11
• /
• 2005

The network structures of a hyperlinked environment can be a rich source of information about the contents of the environment and it provides effective means for understanding it. Recently, there have been a number of algorithms proposed analyzing hypertext link structure so as to determine the best authorities for a given topic or query. In this paper, we review the algorithm of mutual reinforcement relationship for finding hubs and authorities from World Wide Web, and suggest SHA, a new approach for link-structure analysis, which uses the relationships among a set of relative authoritative pages, a set of hub pages, and a set of super hub pages.

• Journal of Korean Library and Information Science Society
• /
• v.22
• /
• pp.373-401
• /
• 1995

This study aims to improve subject retrieval by constructing the hypertext-based thesaurus to provide a browsing interface to a thesaurus. The experimental system used IBM 486 DXII as a hardware, C++ language as a programming language and Hangul Window 3.1 version as a user interface. The results of this study are summarized as follows : (1) The experimental hypertext-based thesaurus can be used as an efficient search aid for query formulation for the retrieval of bibliographic information. (2) The initial access to the hypertext-based thesaurus is via a keyword index. This index is consist of all the words used to form thesaurus terms, whether descriptors or nondescriptors. (3) Hypertext-based thesaurus allow bookmark button and history button to alleviating the problem of disorientation. (4) This system allow an end-user to view a rich variety of inter-term relationships and a complete conceptus of associations through the information space in a nonsequential manner.

• ETRI Journal
• /
• v.34 no.2
• /
• pp.292-295
• /
• 2012

Beyond the simple keyword matching methods in contextual advertising, we propose a rich contextual matching (CM) model adopting a classification method for topic targeting and a query expansion method for semantic ad matching. This letter reports on an investigation into the empirical effects of the CM model by comparing the click-through rates (CTRs) of two practical online news advertising systems. Based on the evaluation results from over 100 million impressions, we prove that the average CTR of our proposed model outperforms that of a traditional model.