• Title/Summary/Keyword: Intelligent query

Search Result 180, Processing Time 0.029 seconds

An Intellingnet Query Processing System for Relational Database System (관계형 데이타베이스 시스템을 위한 지능적인 질의처리시스템)

  • 김대수;김창석
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.7 no.4
    • /
    • pp.1-8
    • /
    • 1997
  • In this paper, we propose a new intelligent query processing system for relational database !systems. By analyzing previous research results related with fuzzy queries, a new intelligent query processing sysytem is developed and the role of each module including intelligent query processor is defined and :some algorithms for parser, query translation module, inference engine, semantic DB and result com-poser are suggested. By applying a typical example to the proposed intelligent query processing liysytem, reasonable results for the ambiguous query are drawn, and therefore it shows a promising model returning ordered result for both the ambiguous queries and general queries.

  • PDF

Intelligent Query Processing Using a Meta-Database KaDB

  • Huh, Soon-Young;Hyun, Moon-Kae
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 1999.03a
    • /
    • pp.161-171
    • /
    • 1999
  • Query language has been widely used as a convenient tool to obtain information from a database. However, users demand more intelligent query processing systems that can understand the intent of an imprecise query and provide additional useful information as well as exact answers. This paper introduces a meta-database and presents a query processing mechanism that supports a variety of intelligent queries in a consistent and integrated way. The meta-database extracts data abstraction knowledge form an underlying database on the basis of a multilevel knowledge representation framework KAH. In cooperation with the underlying database, the meta-database supports four types of intelligent queries that provide approximately or conceptually equal answers as well as exact ones.

  • PDF

A Method of Chinese and Thai Cross-Lingual Query Expansion Based on Comparable Corpus

  • Tang, Peili;Zhao, Jing;Yu, Zhengtao;Wang, Zhuo;Xian, Yantuan
    • Journal of Information Processing Systems
    • /
    • v.13 no.4
    • /
    • pp.805-817
    • /
    • 2017
  • Cross-lingual query expansion is usually based on the relationship among monolingual words. Bilingual comparable corpus contains relationships among bilingual words. Therefore, this paper proposes a method based on these relationships to conduct query expansion. First, the word vectors which characterize the bilingual words are trained using Chinese and Thai bilingual comparable corpus. Then, the correlation between Chinese query words and Thai words are computed based on these word vectors, followed with selecting the Thai candidate expansion terms via the correlative value. Then, multi-group Thai query expansion sentences are built by the Thai candidate expansion words based on Chinese query sentence. Finally, we can get the optimal sentence using the Chinese and Thai query expansion method, and perform the Thai query expansion. Experiment results show that the cross-lingual query expansion method we proposed can effectively improve the accuracy of Chinese and Thai cross-language information retrieval.

Intelligent Query Processing Using a Meta-Database KaDB

  • Huh, Soon-Young;Moon, Kae-Hyun
    • Proceedings of the Korea Database Society Conference
    • /
    • 1999.06a
    • /
    • pp.161-171
    • /
    • 1999
  • Query language has been widely used as a convenient tool to obtain information from a database. However, users demand more intelligent query processing systems that can understand the intent of an imprecise query and provide additional useful information as well as exact answers. This paper introduces a meta-database and presents a query processing mechanism that supports a variety of intelligent queries in a consistent and integrated way. The meta-database extracts data abstraction knowledge from an underlying database on the basis of a multilevel knowledge representation framework KAH. In cooperation with the underlying database, the meta-database supports four types of intelligent queries that provide approximately or conceptually equal answers as well as exact ones.

  • PDF

Intelligent Query Processing in Deductive and Object-Oriented Databases (추론적 기법을 사용한 객체지향 데이터베이스의 지능적인 질의 처리)

  • Kim, Yang-Hee
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.1
    • /
    • pp.251-267
    • /
    • 2003
  • In order to satisfy the needs of an intelligent information system, it is necessary to have more intelligent query processing in an object-oriented database. In this paper, we present a method to apply intelligent query processing in object-oriented databases using deductive approach. Using this method, we generate intelligent answers to represent the answer-set abstractly for a given query in object-oriented databases. Our approach consists of few stages: rule representation, rule reformation pre-resolution, and resolution. In rule representation, a set of deductive rules is generated based on an object-oriented database schema. In rule reformation, we eliminate the recursion in rules. In pre-resolution, rule transformation is done to get unique intensional literals. In resolution, we use SLD-resolution to generate intensional answers.

  • PDF

Design and Implementation of Advanced Traffic Monitoring System based on Integration of Data Stream Management System and Spatial DBMS

  • Xia, Ying;Gan, Hongmei;Kim, Gyoung-Bae
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.162-169
    • /
    • 2009
  • The real-time traffic data is generated continuous and unbounded stream data type while intelligent transport system (ITS) needs to provide various and high quality services by combining with spatial information. Traditional database techniques in ITS has shortage for processing dynamic real-time stream data and static spatial data simultaneously. In this paper, we design and implement an advanced traffic monitoring system (ATMS) with the integration of existed data stream management system (DSMS) and spatial DBMS using IntraMap. Besides, the developed ATMS can deal with the stream data of DSMS, the trajectory data of relational DBMS, and the spatial data of SDBMS concurrently. The implemented ATMS supports historical and one time query, continuous query and combined query. Application programmer can develop various intelligent services such as moving trajectory tracking, k-nearest neighbor (KNN) query and dynamic intelligent navigation by using components of the ATMS.

  • PDF

The Method of Continuous Nearest Neighbor Search on Trajectory of Moving Objects

  • Park, Bo-Yoon;Kim, Sang-Ho;Nam, Kwang-Woo;Ryo, Keun-Ho
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.467-470
    • /
    • 2003
  • When user wants to find objects which have the nearest position from him, we use the nearest neighbor (NN) query. The GIS applications, such as navigation system and traffic control system, require processing of NN query for moving objects (MOs). MOs have trajectory with changing their position over time. Therefore, we should be able to find NN object continuously changing over the whole query time when process NN query for MOs, as well as moving nearby on trajectory of query. However, none of previous works consider trajectory information between objects. Therefore, we propose a method of continuous NN query for trajectory of MOs. We call this CTNN (continuous trajectory NN) technique. It ran find constantly valid NN object on the whole query time by considering of trajectory information.

  • PDF

Intelligent Query Answering System using Query Relaxation (질의 완화를 이용한 지능적인 질의 응답 시스템)

  • Hwang, Hye-Jeong;Kim, Kio-Chung;Yoon, Yong-Ik;Yoon, Seok-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.1
    • /
    • pp.88-98
    • /
    • 2000
  • Cooperative query answering provides neighborhood or associate information relevant to the initial query using the knowledge about the query and data. In this paper, we present an intelligent query answering system for suporting cooperative query answering system presented in this paper performs query relaxation process using hybrid knowledge base. The hybrid knowledge base which is used for relaxation of queries, composes of semantic list and rule based knowledge base for structural approach. Futhermore, this paper proposes the query relaxation algorithm for query reformulation using initial query on the basis of hybrid knowledge base.

  • PDF

Query Space Exploration Model Using Genetic Algorithm

  • Lee, Jae-Hoon;Lee, Sung-Joo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.3 no.2
    • /
    • pp.222-226
    • /
    • 2003
  • Information retrieval must be able to search the most suitable document that user need from document set. If foretell document adaptedness by similarity degree about QL(Query Language) of document, documents that search person does not require are searched. In this paper, showed that can search the most suitable document on user's request searching document of the whole space using genetic algorithm and used knowledge-base operator to solve various model's problem.

Department of Computer Science, Chosun University

  • Young-cheon kim;Moon, You-Mi;Lee, Sung-joo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.7
    • /
    • pp.659-665
    • /
    • 2001
  • Relevance feedback is the most popular query reformulation strategy in a relevance feedback cycle, the user is presented with a list of the retrieved documents and, after examining them, marks those which are relevant. In practice, only the top 10(or 20) ranked documents need to be examined. The main idea consists of selecting important terms, or expressions, attached to the documents that have been identified as relevant by the user, and of enhancing the importance of these terms in a new query formulation. The expected effect is that the new query will be moved towards the relevant documents and away from the non-relevant ones. Local analysis techniques are interesting because they take advantage of the local context provided with the query. In this regard, they seem more appropriate than global analysis techniques. In a local strategy, the documents retrieved for a given query q are examined at query time to determine terms for query expansion. This is similar to a relevance feedback cycle but might be done without assistance from the user.

  • PDF