• 한국지능시스템학회논문지
• /
• 제7권4호
• /
• pp.1-8
• /
• 1997

본 논문에서는 관계형 데이타베이스 시스템을 위한 새로운 지능적인 질의 처리 시스템을 제안하였다. 애매한 질의와 관련된 기존의 연구결과를 분석하여 그 문제점들을 해결할 수 있는 새로운 질의 처리 시스템이 개발되었는데, 지능적 질의 처리기를 비롯한 각 모듈의 역할을 정의하였으며, 구문분석기, 질의변환 모듈, 추진 엔진, 의미 데이타베이스 모듈, 결과합성기 등의 알고리즘을 제시하였다. 또한 제안된 질의처리 시스템의 기반한 실제 작동의 과정을 한 예를 들어 검증한 결과 타당성 있는 결과가 입증되었으며, 사용자의 일반적인 질의뿐만 아니라 애미한 질의에도 지능적으로 대처하여 순서화된 겨로가를 보여주고 있다.

• 한국경영과학회지
• /
• 제32권1호
• /
• pp.125-136
• /
• 2007

The study on query relaxation which provides approximate answers has received attention. In recent years, some arguments have been made that semantic relationships are useful to present the relationships among data values and calculating the semantic distance between two data values can be used as a quantitative measure to express relative distance. The aim of this article is a hierarchical metricized knowledge abstraction (HiMKA) with an emphasis on combining data abstraction hierarchy and distance measure among data values. We propose the operations and the query relaxation algorithm appropriate to the HiMKA. With various experiments and comparison with other method, we show that the HiMKA is very useful for the quantified approximate query answering and our result is to offer a new methodological framework for query relaxation.

• 한국멀티미디어학회논문지
• /
• 제8권5호
• /
• pp.596-605
• /
• 2005

기존의 XML 질의 방법은 단순 키워드 정합이나 단순 구조적 확장 등에 국한되므로 문서에 내재된 정보를 검색하기에 불충분할 뿐만 아니라,모든 문서에 질의를 인가함으로써 정보검객의 효율을 저하시킨다. 본 연구는 온톨로지로부터 생성한 포괄적 BTD에 의해 검객대상 문서를 사전에 미리 선별하는 문서여과 방법과 온톨로지의 개념구조와 개념 간 연관관계를 추론하여 질의를 확장하는 방법을 제안함으로써 XML정보검색의 효과를 증대 하고자 한다. 제안한 문서여과 및 질의확장 방법은 다양한 XML 문서를 대상으로 검색 효과를 실험하였다.

• 한국산학기술학회논문지
• /
• 제5권1호
• /
• pp.38-43
• /
• 2004

We designed and implemented a medical image query system, including a relational database and DBMS (database management system), which can visualize image data and can achieve spatial, attribute, and mixed queries. Image data used in querying can be visualized in slice, MPR(multi-planner reformat), volume rendering, and overlapping on the query system. To reduce spatial cost and processing time in the system. brain images are spatially clustered, by an adaptive Hilbert curve filling, encoded, and stored to its database without loss for spatial query. Because the query is often applied to small image regions of interest(ROI's), the technique provides higher compression rate and less processing time in the cases.

• 디지털산업정보학회논문지
• /
• 제9권1호
• /
• pp.59-72
• /
• 2013

In this paper, we propose a keyword query processing technique based on semantic relationships for OWL data. The proposed keyword query processing technique can improve user's search satisfaction by performing two types of associative search. The first associative search uses information inferred by the relationships between classes or properties during keyword query processing. And it supports to search all information resources that are either directly or indirectly related with query keywords by semantic relationships between information resources. The second associative search returns not only information resources related with query keywords but also values of properties of them. We design a storage schema and index structures to support the proposed technique. And we propose evaluation functions to rank retrieved information resources according to three criteria. Finally, we evaluate the validity and accuracy of the proposed technique through experiments. The proposed technique can be utilized in a variety of fields, such as paper retrieval and multimedia retrieval.

• ETRI Journal
• /
• 제29권5호
• /
• pp.691-693
• /
• 2007

Existing methods to process continuous range queries are not scalable. In particular, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We propose a novel query indexing method called the projected attribute bit (PAB)-based query index. We project a two-dimensional continuous range query on each axis to get two one-dimensional bit lists. Since the queries are transformed to bit lists and query evaluation is performed by bit operations, the storage cost of indexing and query evaluation time are reduced significantly. Through various experiments, we show that our method outperforms the containment-encoded squares-based indexing method, which is one of the most recently proposed methods.

• International Journal of CAD/CAM
• /
• 제7권1호
• /
• pp.113-120
• /
• 2007

Sketch based query plays an important role in shape matching for 3D shape retrieval system. Some researchers suggest the sketch based query interfaces. It is more effective to capture the needs of users rather than query by example. In this paper, we propose a new 2D sketch based query interface with coarse filters for shape matching. Coarse filtering enables to eliminate unfavorable shapes from shapes in DB. For the purpose of coarse filtering, we use two filters with the topological and geometric patterns. For the validity of our method, we show the experimental results.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2003년도 추계학술발표논문집 (하)
• /
• pp.1429-1432
• /
• 2003

This paper addresses the problem of finding a constrained nearest neighbor for moving query point(we call it CNNMP) The Nearest neighbor problem is classified by existence of a constrained region, the number of query result and movement of query point and target. The problem assumes that the query point is not static, as 1-nearest neighbor problem, but varies its position over time to the constrained region. The parameters as NC, NCMBR, CQR and QL for the algorithm are also presented. We suggest the query optimization algorithm in consideration of topological relationship among them

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.832-837
• /
• 2002

As diverse researches are working about location acquisition, storing method, data modeling and query processing of moving objects, the moving object database systems, which can gain, store and manage location information and query processing, are tuning up. As the mobile device is moving but have constraints, the convenience user interface for spatio-temporal query and viewing query result needs. In this paper, we designed user Interface for spatio-temporal query related moving objects, viewing query result, tracing current and past location of those and monitoring. And we designed system for implementation of these interfaces.

• International journal of advanced smart convergence
• /
• 제10권2호
• /
• pp.64-72
• /
• 2021

XML message brokers have a lot of importance because XML has become a practical standard for data exchange in many applications. Message brokers covered in this document store many users. This paper is a study of the processing of twig pattern queries in XML documents using branching node streams in XML message broker structures. This work is about query processing in XML documents, especially for query processing with XML twig patterns in the XML message broker structure and proposed a method to reduce query processing time when parsing documents with XML twig patterns by processing information. In this paper, the twig pattern query processing method of documents using the branching node stream removes the twigging value of the branch node that does not include the labeling value of the branch node stream when it receives a twig query from the client. In this paper, the leaf node discovery time can be reduced by reducing the navigation time of nodes in XML documents that are matched to leaf nodes in twig queries for client twig queries. Overall, the overall processing time to respond to queries is reduced, allowing for rapid question-answer processing.