• Journal of the Korean Society for Library and Information Science
• /
• v.39 no.2
• /
• pp.185-209
• /
• 2005

The description of resources at collection-level is being recognised as an important component of information services that seek to provide integrated access to distributed resources. This research investigated the concept, necessities, and standards of collection level description which manages heterogeneous and distributed resources effectively. Also this research reviewed collection level description projects in other countries to show a new direction of subject access in digital libraries.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.605-608
• /
• 2008

일반적인 정보검색 시스템은 중앙 집중식의 서버/클라이언트 방식을 사용한다. 이 방식은 서버 집중방식으로 시스템의 부하가 가중될 경우 추가적인 자원 확보에 어려움을 가진다. P2P(Peer-to-Peer) 기술은 이러한 중앙 서버의 문제점을 해결하기 위해 제안된 것이다. JXTA 플랫폼은 P2P 서비스를 제공하기 위한 오픈 소스 프로젝트로서 본 논문은 정보검색 시스템의 부하가 늘어날 경우 유연한 자원 확보를 위해 JXTA 플랫폼 기반의 JXIR(Jxta Information Retrieval) 시스템을 설계하고 구현하였다.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.406-417
• /
• 2001

With the advances in multimedia databases on the World Wide Web, it becomes more important to provide users with the search capability of distributed multimedia data. While there have been many studies about the database selection and the collection fusion for text databases. The multimedia databases on the Web have autonomous and heterogeneous properties and they use mainly the content based retrieval. The collection fusion problem of multimedia databases is concerned with the merging of results retrieved by content based retrieval from heterogeneous multimedia databases on the Web. This problem is crucial for the search in distributed multimedia databases, however, it has not been studied yet. This paper provides novel algorithms for processing the collection fusion of heterogeneous multimedia databases on the Web. We propose two heuristic algorithms for estimating the number of objects to be retrieved from local databases and an algorithm using the linear regression. Extensive experiments show the effectiveness and efficiency of these algorithms. These algorithms can provide the basis for the distributed content based retrieval algorithms for multimedia databases on the Web.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.129-139
• /
• 2003

The PC cluster architecture is considered as a cost-effective alternative to the existing supercomputers for realizing a high-performance information retrieval (IR) system. To implement an efficient IR system on a PC cluster, it is essential to achieve maximum parallelism by having the data appropriately distributed to the local hard disks of the PCs in such a way that the disk I/O and the subsequent computation are distributed as evenly as possible to all the PCs. If the terms in the inverted index file can be classified to closely related clusters, the parallelism can be maximized by distributing them to the PCs in an interleaved manner. One of the goals of this research is the development of methods for automatically clustering the terms based on the likelihood of the terms' co-occurrence in the same query. Also, in this paper, we propose a method for duplicate distribution of inverted index records among the PCs to achieve fault-tolerance as well as dynamic load balancing. Experiments with a large corpus revealed the efficiency and effectiveness of our method.

• Journal of KIISE:Software and Applications
• /
• v.28 no.10
• /
• pp.773-784
• /
• 2001

Since documents on the Web are naturally partitioned into may document database, the efficient information retrieval process requires identifying the document database that are most likely to provide relevant documents to the query and then querying the identified document database. We propose a neural net agent approach to such an efficient information retrieval. First, we present a neural net agent that learns about underlying document database using the relevance feedbacks obtained from many retrieval experiences. For a given query, the neural net agent, which is sufficiently trained on the basis of the BPN learning mechanism, discovers the document database associated with the relevant documents and retrieves those documents effectively. In the experiment, we introduce a neural net agent based information retrieval system and evaluate its performance by comparing experimental results to those of the conventional well-known approaches.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.948-952
• /
• 2009

Recently, a new distributed grid scheme, called DS-GRID(distributed S-GRID), has been proposed to manage the location information of moving objects in a spatial network[1]. However, because DS-GRID uses uniform grid cells, it cannot handle skewed data which frequently occur in the real application. To solve this problem, we propose a dynamic distributed grid scheme which splits a grid cell dynamically based on the density of moving objects. In addition, we propose a k-nearest neighbor processing algorithm for the proposed scheme. Finally, it is shown from the performance analysis that our scheme achieves better retrieval and update performance than the DS-GRID when the moving objects are skewed.

• Journal of Information Science Theory and Practice
• /
• v.1 no.4
• /
• pp.48-66
• /
• 2013

The aim of this study is to examine the user's online searching behavior in IR interfaces of e-journal database systems. The study is purely based on survey methods and tries to analyse the online searching behavior of respondents of social science disciplines who were doing research in three target central universities of Delhi (i.e. DU, JMI, and JNU). For measuring the responses of the respondents in IR interfaces of e-journal database systems, a total of 396 questionnaires were distributed among the students and out of all, 305 responses were used for the study. The findings of the study reveal that most of the students were not using all the facilities offered in IR interfaces of e-journal database systems for their retrieval process and also encourages menu based searches rather than command based searching.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.69-77
• /
• 2004

As the internet is widely distributed. the intelligent search agent is commonly used to meet the needs of user. But these Intelligent multi-agents are so independent each other that they can not give reliability of information and also have difficulty in coping with the dynamic distributed environments due to the short of cooperation abilities among multiagent. To resolve these problems. this paper proposes the mechanism for efficient cooperation and information processing by creating agency within broker agent and clustering multi agent's agency using neural network. For reliability of information. we also propose the multiagent management mechanism that can improve the information update problems which are in existing search systems and evaluate the performance of this research through simulation.

• The Journal of the Korea Contents Association
• /
• v.6 no.10
• /
• pp.25-33
• /
• 2006

For semantic retrieval in semantic web environment, it is an important factor to manage and manipulate distributed resources. Ontology is essential for efficient search in distributed resources, but it is almost impossible to construct an unified ontology for all distributed resources in the web. In this paper, we assumed that most information in the web environment exist in the form of RDBMS, and propose a matching method between domain ontology and the existing RDBMS tables for semantic retrieval. Most previous studies about matching between RDBMS tables and domain ontology have extracted a local ontology from RDBMS tables at first, and conducted the matching between the local ontology and domain ontology. However in the processing of extracting a local ontology, some problems such as losing domain information can be occurred since its correlation with domain ontology has not been considered at all. In this paper, we propose a methods to prevent the loss of domain information through the similarity measure between instances of RDBMS tables and instances of ontology. And using the relational information between RDBMS tables and the relational information between classes in domain ontology, more efficient instance-based matching becomes possible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.