• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2911-2921
• /
• 1999

We present new methods for an efficient retrieval of SGML documents. We define IDDL (index database description language) which is able to describe various information such as meta data, an indexing range, and the creation and manipulation of a database. In addition, we design IDQL (index database query language) that can deal with querying meta data as well as logical structure. Especially, the retrieval system based on IDDL and IDQL has been developed and implemented, and has been experimented on large number of documents. Experimental result shows that the proposed method provides the dynamic creation of an index database and a convenient retrieval environment.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.57-64
• /
• 2003

Achieving the beneficiary goal of recent discovery in human genome project still needs a way to retrieve and analyze the exponentially expanding bio-related information. Research on bio-related fields naturally applies knowledge discovered to the current problem and make inferences to extract new information where shared concepts and data containing information need to be defined and used in a coherent way. In such a professional domain, while the need to help users reduce their work and to improve search results has been emerged. methods for systematic retrieval and adequate exchange of relevant information are still in their infancy. The design of our system aims at improving the quality of information retrieval in a professional domain by utilizing both corpus-based and concept-based ontology. Meta-rules of helping users to make an adequate query are formed into an ontology in the domain. The integration of those knowledge permits the system to retrieve relevant information in a more semantic and systematic fashion. This work mainly describes the query models with details of GUI and a secondary query generation of the system.

• Journal of Korea Multimedia Society
• /
• v.10 no.1
• /
• pp.13-25
• /
• 2007

A cache is used for optimization of query forwarding in the Grid database. To decrease network transmission cost, frequently used data is cached from meta database. Existing cache management method has a unbalanced resource problem, because it doesn't manage replicated data in each node. Also, it increases network cost by cache misses. In the case of data modification, if cache is not updated, queries can be transferred to wrong nodes and it can be occurred others nodes which have same cache. Therefore, it is necessary to solve the problems of existing method that are using unbalanced resource of replica and increasing network cost by cache misses. In this paper, cache management method for query forwarding optimization is proposed. The proposed method manages caches through cache manager. To optimize query forwarding, the cache manager makes caching data from lower loaded replicated node. The query processing cost and the network cost will decrease for the reducing of wrong query forwarding. The performance evaluation shows that proposed method performs better than the existing method.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.360-373
• /
• 2003

The Meta Search system proposed in this paper is operated based on relevance distribution Infer mation(RDI). It first evaluates the sources applicable to the search, and then selects the most appropriate source. According to the evaluation of the sources, it discreetly collects the documents from the concerned sources and classifies them into a useful order based on the RDI, which is an evaluation score of the sources. The documents are classified into order and presented to the user as a single search result. For this Purpose, this study presents evaluation factor models to present the RDI between the query, and source, and proposes a method for drawing out the RDI based on the evaluation factors. The system for selecting the most appropriate sources according to the query has been developed based on an algorithm that selects the best source. Finally, after searching the documents suitable for query from extracted sources, we present a Meta Search system, HoleInOne, that ranks and merges them.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.921-929
• /
• 2008

Recently, many researches have been conducted to solve data heterogeneity as a way for data integration. The elements of the system that we suggest are an XMDR wrapper and XMDR Repository. XMDR wrapper solves the heterogeneity of the existing system by creating the interface based on the standard information of XMDR, and performing the inter-conversion between global XMDR query and local query using mapping data on standard information and local schema. XMDR Repository are composed of XMDR which manages the mapping data on standard information and local schema, and of Proxy DB which saves the accomplished results. With XMDR wrapper and XMDR Repository, users can use the same interface, and they need not conduct repeated queries since XMDR wrapper not only solves the heterogeneity of the schema using the meta-semantic ontology of XMDR, but also considers the heterogeneity accompanying the meaning of the value through instance semantic ontology. Therefore, in this paper we suggest the grid wrapper for the solution of data heterogeneity and efficient data integration.

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

In this paper, a MetaSearch algorithm for navigational queries is presented. Previous MetaSearch algorithms focused on informational queries. They Eave a high score to an overlapped document. However, the overemphasis of overlapped documents may degrade the performance of a MetaSearch algerian for a navigational query. However, if a lot of result documents are from a certain domain or a directory, then we can assume the importance of the domain or directory. Various experiments are conducted to show the effectiveness of overlap of a domain and directory names. System results from TREC and commercial search engines are used for experiments. From the results of experiments, the overlap of documents showed the better performance for informational queries. However, the overlap of domain names and directory names showed the $10\%$ higher performance for navigational queries.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.148-157
• /
• 2002

Caching in meta-search engines can improve the response time of users' request. We describe the cache scheme in our meta-search engine in terms of its architecture and operational flow. In particular, we propose a popularity-driven cache algorithm that utilizes popularities of queries to determine cached data to be purged. The popularity is a value that represents the normalized occurrence frequency of user queries. This paper presents how to collect popular queries and how to calculate query popularities. An empirical performance evaluation of the popularity-driven caching with the traditional schemes (i.e., least recently used (LRU) and least frequently used (LFU)) has been carried out on a collection of real data. In almost all cases, the proposed replacement policy outperforms LRU and LFU.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.5
• /
• pp.765-777
• /
• 2022

The SABER algorithm, a PKE/KEM algorithm presented in NIST PQC Standardization Round 3, is an algorithm based on the Module-LWR problem among lattice-based problems and has a Meta-PKE structure. At this time, the secret information used in the encryption process is called a ephemeral key, and in this paper, the ephemeral key reuse attack using the Meta-PKE structure is described. For each parameter satisfying the security strengths required by NIST, we present a detailed analysis of the previous studies attacked using 4, 6, and 6 queries, and improve them, using only 3, 4, and 4 queries. In addition, we introduce how to reduce the computational complexity of recovering ephemeral keys with a single query from the brute-force complexity on the n-dimension lattice, 2^7.91×n, 2^10.51×n, 2^12.22×n to 2^4.91×n, 2^6.5×n, 2^6.22×n, for each parameter, and present the results and limitations.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2728-2739
• /
• 1999

This paper proposes an effective fusion algorithm for retrieval results from heterogeneous information sources in federated digital libraries. The algorithm determines the population of documents retrieved from involved information sources for a given query and evaluates the degree of relevance between the query and the population. The evaluated results are used as relevance distribution information for collection fusion. The main informations used for the fusion are relevance distribution among collections, the population size N, and ranking information of relevant documents in their origin. We also present th performance evaluation of the algorithm by developing the prototype of a meta-searcher.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.267-272
• /
• 2007

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching fur expanding results from an exact matching engine to query the OWL MIT Process Handbook. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We perform retrieval experiments to compare the performance of the devised similarity algorithms.