• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.461-472
• /
• 2001

Recently, much research on XML query processing considering the structural characteristics of XML documents is conducted, focusing primarily on the development and/or extension of XML query languages and on query optimization for effective retrieval of XML documents. In the XML repository, the XML views derived from the underlying XML documents could be stored materialized for effective retrieval of XML documents, and could be capitalized on for XML query processing In this paper, assuming that the XML views defined in XQL are materialized in the repository, we investigate XQL query processing that capitalizes on them. We describe the storage structure of the XML repository which supports the materialized views, and propose an algorithm that determines whether the given XQL query can be processed with the relevant materialized view adn accordingly transforms the original query into one against it.

• Journal of Korean Library and Information Science Society
• /
• v.30 no.3
• /
• pp.427-456
• /
• 1999

This paper deals with the problems of information retrieval through full-test database which arise from both the deficiency of searching strategies or methods by information searcher and the difficulties of query representation, generation, extension, etc. In oder to solve these problems, we should use automatic retrieval instead of manual retrieval in the past. One of the ways to make the gap narrow between the terms by the writers and query by the searchers is that the query should be searched with the terms which the writers use. Thus, the preconditions which should be taken one accorded way to solve the problems are that all areas of information retrieval such as should taken one accorded way to solve the problems are that all areas of information retrieval such as contents analysis, information structure, query formation, query evaluation, etc. should be solved as a coherence way. We need to deal all the ares of automatic information retrieval for the efficiency of retrieval thought this paper is trying to solve the design of thesaurus browser. Thus, this paper shows the theoretical analyses about the form of information retrieval, automatic indexing, clustering technique, establishing and expressing thesaurus, and information retrieval technique. As the result of analyzing them, this paper shows us theoretical model, that is to say, the thesaurus browser by clustering algorithm. The result in the paper will be a theoretical basis on new retrieval algorithm.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.39-50
• /
• 2004

GML proposed to offer interoperability of geography information is specifying various dynamic object schema for application in the wireless environment. These GML dynamic object schema supports the expression of moving objects that the position and shape change consecutively over time, so practical use of GML is increased in location-based service that provides various application services based on location information of moving objects. In particular, the conventional query languages about GML have been studied with priority given to the integration of geographic information, the support of spatial operations, and etc. However, it lacks the support for moving objects queries. Therefore, in this paper, we propose the moving objects query language that supports moving objects queries for GML documents by extension of XQuery that is standard in query language. Also, data model, algebra operation and various moving objects operators for the proposed query language are designed, and we apply the proposed query language to tornado government organization system to show that the proposed query language can be used effectively in various location-based service.

• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.19-31
• /
• 2003

We propose an indexing technique and an index selection algorithm for optimal OLAP query processing in object database systems, Although there are many research results on the relational database systems for OLAP Query processing, few researches have been done on the object database systems. Since OLAP queries represent complex business logic on a huge data ware-house, object database systems supporting the OLAP queries should have higher performance. Proposed bitmap index structure is an extension of conventional bitmap indexes for adapting object databases and provides higher performance with lower space overhead. We also propose a linear time solution of the index selection problem that will be used in the OLAP query optimization process.

• ETRI Journal
• /
• v.27 no.4
• /
• pp.367-376
• /
• 2005

SQL/MDR is a metadata registry query language used to consistently exchange and share the data between distributed metadata registries. It is an extension of the international SQL and is familiar to most database builders and administrators. It provides many advantages such as simplicity of query language, ease of use, an independent description for distributed querying, low cost for adding new systems, simplicity of exchanging mechanism, and so on. The goal of this paper is to evaluate and show its merits quantitatively. To achieve this goal, we define simulation models to compare with an existing approach and then describe the evaluation results. In the quantitative evaluation results, the good points of SQL/MDR can be identified and known.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.313-326
• /
• 2001

The XML that was proposed as a next-generation standard for describing Web documents is widely used in various Web-based applications. In addition, XML documents on the Web link each other by hyperlinks. The current works on XML focus on the XML storage system that can efficiently store, manage, and retrieve XML documents. However, the research on the query language that supports the XML links and on the XML retrieval systems to process the XML links, is little conducted until now. In this paper, we propose an extension of an XML query language for expressing the XML link query and its processing scheme. A link query is to retrieve contents from an XML document (a query document) and from the XML documents (referenced documents) that are referred to by the links in the query document. As far as retrieving from the referenced documents is concerned, the current practice is to manually generate queries to get the partial results, and to repeat such a procedure. The purpose of link query processing in this paper is to eliminate the manual work altogether in getting the complete query result. The performance analysis shows that our link query processing strategy outperforms the conventional approach including the manual tasks. The more links to the referenced documents and the more referenced documents there are in the site storing the query document, the more query processing time decreases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.21-28
• /
• 2008

In this paper, we proposed an algorithm that reduces call setup time between the IP PBXs installed in the main office and several branch offices. In the IP PBXs installed in branch offices, we prepare some internal memory spaces, and they keep the frequently used extension numbers and the corresponding IP PBX's addresses. In order to call an extension number registered to the other remote IP PBX from an extension number registered to the local IP PBX, the local PBX searches for the destined extension from its internal memory first. If the extension is found, then the local PBX uses its corresponding IP PBX address stored along with the extension, instead of making a query to the main office's IP PBX. By this technique, we could shorten the average call setup time and verified it by an experiment.

• Journal of Advanced Navigation Technology
• /
• v.20 no.6
• /
• pp.617-624
• /
• 2016

The hangul word embedding should be performed certainly process for noun extraction. Otherwise, it should be trained words that are not necessary, and it can not be derived efficient embedding results. In this paper, we propose model that can retrieve more efficiently by query language expansion using hangul word embedded, apriori, and text mining. The word embedding and apriori is a step expanding query language by extracting association words according to meaning and context for query language. The hangul text mining is a step of extracting similar answer and responding to the user using noun extraction, TF-IDF, and cosine similarity. The proposed model can improve accuracy of answer by learning the answer of specific domain and expanding high correlation query language. As future research, it needs to extract more correlation query language by analysis of user queries stored in database.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.146-154
• /
• 2007

AutoCor is a method for the automatic acquisition and classification of corpora of documents in closely-related languages. It is an extension and enhancement of CorpusBuilder, a system that automatically builds specific minority language corpora from a closed corpus, since some Tagalog documents retrieved by CorpusBuilder are actually documents in other closely-related Philippine languages. AutoCor used the query generation method odds ratio, and introduced the concept of common word pruning to differentiate between documents of closely-related Philippine languages and Tagalog. The performance of the system using with and without pruning are compared, and common word pruning was found to improve the precision of the system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.160-162
• /
• 2000

데이터베이스에 대하여 아무런 지식이 없는 일반인도 데이터베이스를 쉽게 검색할 수 있도록 언어변수를 사용한 질의 및 질의 확장에 의한 효율적인 데이터베이스 검색 시스템을 설계한다. 언어 변수의 퍼지와 및 질의 확장을 위해 퍼지 소속함수, 개념 계층, 유사 관계 등을 적용하며, 한의원 데이터베이스를 사례로 하여 프로토타입을 구현하고 실험 및 평가를 한다.