• Title/Summary/Keyword: System Query

Search Result 1,369, Processing Time 0.026 seconds

Visual Query and Analysis Tool of the Moving Object Database System

  • Lee, J.H.;Lee, S.H.;Nam, K.W.;Park, J.H.
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.455-457
    • /
    • 2003
  • Diverse researches are working moving objects. The most important activities in a moving object database system are query and analysis of spatio -temporal data providing decision-making and problem solving support. Traditional spatial database query language and tools are inappropriate of the real world entities. This paper presents a spatio-temporal query and analysis tool with visual environment. It provides effective, interactive and user-friendly as well as statistic analysis. The moving objects database system stores plentiful moving objects data and performs spatio-temporal and nonspatio-temporal queries.

  • PDF

An Efficient Extended Query Suggestion System Using the Analysis of Users' Query Patterns (사용자 질의패턴 분석을 이용한 효율적인 확장검색어 추천시스템)

  • Kim, Young-An;Park, Gun-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7C
    • /
    • pp.619-626
    • /
    • 2012
  • With the service suggesting additional extended or related query, search engines aim to provide their users more convenience. The extended or related query suggestion service based on popularity, or by how many people have searched on web using the query, has limitations to elevate users' satisfaction, because each user's preference and interests differ. This paper will demonstrate the design and realization of the system that suggests extended query appropriate for users' demands, and also an improvement in the computing process between entering the first search word and the subsequent extension to the related themes. According to the evaluation the proposed system suggested 41% more extended or related query than when searching on Google, and 48% more than on Yahoo. Also by improving the shortcomings of the extended or related query system based on general popularity rather than each user's preference, the new system enhanced users' convenience further.

Continuous Query over Business Event Streams in EPCIS Middleware (비즈니스 이벤트 스트리밍 대한 연속 질의 처리)

  • Piao, Yong-Xu;Hong, Bong-Hee;Park, Jeak-Wan;Kim, Gi-Hong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.718-720
    • /
    • 2008
  • In this paper, the study focus on continuous query in EPC Information Services(EPCIS) middleware which is a component of RFID system. We can consider EPCIS as a data stream system with a repository. In our work continuous query is implemented in two query execution model. One is standing query model another is traditional query execution model in which continuous query run over database periodically. Furthermore a balance strategy is presented. It is used to determine which continuous query implementation model is suitable for the query. Finally we conclude our work and issue some research topic for future work.

An XML Query System in a Wrapper System for Integrating Heterogeneous Biological Databases (이질의 생물 정보원 통합을 위한 랩퍼 시스템에서의 XML 질의 처리 시스템)

  • Park Eun-Koung;Kang Dong-Wan;Jung Chai-Young;Kim Hyun-Ju;Bae Jong-Min
    • The KIPS Transactions:PartD
    • /
    • v.12D no.4 s.100
    • /
    • pp.553-568
    • /
    • 2005
  • In order to integrate distributed biological information sources physically or virtually, it is necessary to overcome the heterogeneity of information sources and support a superior generality and adaptation in order to satisfy user's various demands. In this paper, we present a flexible and general XML query engine of a wrapper system in designing the middleware system to integrate data as well as application programs. Since this query engine applies user-defined XML view, it is possible to composite flexible integrated query. The query processing in a wrapper requires view composition, query translation into local sources, and generation of XML documents from local query results. We present a query processing model based on the view tree, where the n views and the XML queries are represented by the view tree. Moreover, to confirm the generality of our query processing model, we present a methodology of query processing for relational databases, web sources, and application programs whose return types of query results are relational tuples or XML documents.

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

Design and Implementation of a Korean Analysis System for Multi-lingual Query Answering (다국어 질의응답을 위한 한국어 해석 시스템 설계 및 구현)

  • Kang, Won-Seog;Hwang, Do-Sam
    • The Journal of Korean Association of Computer Education
    • /
    • v.7 no.4
    • /
    • pp.43-50
    • /
    • 2004
  • Multi-lingual query answering system is the system which answers on the queries with several languages. LASSO[l] is the system that aims to answer the multi-lingual query. In this paper, we design and implement a Korean analysis system for LASSO. The Korean analysis system for query answering needs processing techniques of dialogue style. And the system must be practical and general so as to use on various domains. This system uses not dialogue processing techniques with high cost and low utility but heuristic rules with low cost and high utility. It is designed and implemented as a Korean interface of multi-lingual query answering system. The techniques of this system highly contribute to information retrieval and Korean analysis researches.

  • PDF

Query Optimization Algorithm for Image Retrieval by Spatial Similarity) (위치 관계에 의한 영상 검색을 위한 질의 및 검색 기법)

  • Cho, Sue-Jin;Yoo, Suk-In
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.5
    • /
    • pp.551-562
    • /
    • 2000
  • Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

  • PDF

XQL Query Processing System using XML Views (XML뷰를 이용한 XQL질의처리 시스템)

  • 김천식;손기락
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.2
    • /
    • pp.129-140
    • /
    • 2002
  • XML has become a standard for exchanging document data on the web. Currently, most of the commercial data are stored in the relational database system. It requires to converse the document into XML form to transfer the data to a relational database system. The purpose of this paper is to research on a query processing system which will make it easy and convenient to raise a query and derive results from the document data stored in a relational database. We have designed a XML view called R2X(Relational To XML). With this R2X view, users can view a relational database as XML documents. Using R2X views, we design and implement a Query processing system which will make it expedient to form a query with a XML query language called XQL.

  • PDF

An Adaptive Query Processing System for XML Stream Data (XML 스트림 데이타에 대한 적응력 있는 질의 처리 시스템)

  • Kim Young-Hyun;Kang Hyun-Chul
    • Journal of KIISE:Databases
    • /
    • v.33 no.3
    • /
    • pp.327-341
    • /
    • 2006
  • As we are getting to deal with more applications that generate streaming data such as sensor network, monitoring, and SDI (selective dissemination of information), active research is being conducted to support efficient processing of queries over streaming data. The applications on the Web environment like SDI, among others, require query processing over streaming XML data, and its investigation is very important because XML has been established as the standard for data exchange on the Web. One of the major problems with the previous systems that support query processing over streaming XML data is that they cannot deal adaptively with dynamically changing stream because they rely on static query plans. On the other hand, the stream query processing systems based on relational data model have achieved adaptiveness in query processing due to query operator routing. In this paper, we propose a system of adaptive query processing over streaming XML data in which the model of adaptive query processing over streaming relational data is applied. We compare our system with YFiiter, one of the representative systems that provide XML stream query processing capability, to show efficiency of our system.

Content-based Video Indexing and Retrieval System using MPEG-7 Standard (MPEG-7 표준에 따른 내용기반 비디오 검색 시스템)

  • 김형준;김회율
    • Journal of Broadcast Engineering
    • /
    • v.9 no.2
    • /
    • pp.151-163
    • /
    • 2004
  • In this paper, we propose a content-based video indexing and retrieval system using MPEG-7 standard to retrieve and manage videos efficiently. The proposed system consists of video indexing module for a video DB and video retrieval module to allow various query methods on a web environment. Video indexing module stores metadata such as manually typed in keywords, automatically recognized character names, and MPEG-7 visual descriptors extracted by indexing module into a DB in a sever side. A user can access to retrieval module by a web and retrieve desired videos through various query methods like keywords, faces, example and sketch. For this retrieval system, we propose ATC(Adaptive Twin Comparison) as a cut detection method for efficient video indexing and QBME(Query By Modified Example) as an improved content-based query method for the convenience of users. Experimental results show that the proposed ATC method detects cuts well and the proposed QBME method provides the conveniences better than existing query methods such as QBE(Query By Example) and QBS(Query By Sketch).