• Title/Summary/Keyword: Query generation

Search Result 118, Processing Time 0.024 seconds

Development of an XML Query Interface to Support Integrated Queries for Biological Information Sources (생물 정보원에 대한 통합 질의를 지원하는 그래픽 사용자 인터페이스 개발)

  • Jung, Chai-Young;Cho, Chan-Je;Park, Hong-Won;Park, Eun-Kyung;Kim, Hvun-Ju;Bae, Jong-Min
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.1
    • /
    • pp.102-116
    • /
    • 2007
  • An XML-based mediator system is the one of the methods to virtually integrate distributed heterogeneous information sources. It considers each information source as the virtual XML database and accesses the information source by XML query language. In this paper, we present a design concept and a development result of the graphic user interface that generates XML views for each biological information sources with flexibility and XML queries on the views. In addison to the easy generation of XML views and queries for the integrated schema, the system supports the form of the workflow, in which the part of the query result against biological information sources is used as input data of an another source.

  • PDF

Building Intelligent User Interface Agent for Semantically Reformulating User Query in Medicine

  • Lim, Chae-Myung;Chu, Sung-Joon;Lee, Dong-Hoon;Park, Duck-Whan;Park, Tae-Young;Yang, Jung-Jin
    • 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.

  • PDF

GO Guide : Browser & Query Translation for Biological Ontology (GO Guide : 생물학 온톨로지를 위한 브라우저 및 질의 변환)

  • Jung Jun-Won;Park Hyoung-Woo;Im Dong-Hhyuk;Lee Kang-Pyo;Kim Hyoung-Joo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.3
    • /
    • pp.183-191
    • /
    • 2006
  • As genetic research is getting more active, data construction of genes are needed in the field of biology. Therefore, Gene Ontology Consortium has constructed genetic information by OWL, which is Ontology description language published by W3C. However, previous browsers for Gene Ontology only support simple searching mechanisms based on keyword, tree, and graph, but it is not able to search high quality information considering various relationships. In this paper, we suggest browsing technique which integratesvarious searching methods to support researchers who are doing actually experiment in biology field. Also, instead of typing a query, we propose querv generation technique which constructs query while browsing and query translation technique which translate generated query into SeRQL query It is convenient for user and enables user to obtain high quality information. And by this GO Guide browser, it has been shown that the information of Gene Ontology could be used efficiently.

Enhancing Query Efficiency for Huge 3D Point Clouds Based on Isometric Spatial Partitioning and Independent Octree Generation (등축형 공간 분할과 독립적 옥트리 생성을 통한 대용량 3차원 포인트 클라우드의 탐색 효율 향상)

  • Han, Soohee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.5
    • /
    • pp.481-486
    • /
    • 2014
  • This study aims at enhancing the performance of file-referring octree, suggested by Han(2014), for efficiently querying huge 3D point clouds, acquired by the 3D terrestrial laser scanning. Han's method(2014) has revealed a problem of heavy declining in query speed, when if it was applied on a very long tunnel, which is the lengthy and narrow shaped anisometric structure. Hereupon, the shape of octree has been analyzed of its influence on the query efficiency with the testing method of generating an independent octree in each isometric subdivision of 3D object boundary. This method tested query speed and main memory usage against the conventional single octree method by capturing about 300 million points in a very long tunnel. Finally, the testing method resulted in which twice faster query speed is taking similar size of memory. It is also approved that the conclusive factor influencing the query speed is the destination level, but the query speed can still increase with more proximity to isometric bounding shape of octree. While an excessive unbalance of octree shape along each axis can heavily degrade the query speed, the improvement of octree shape can be more effectively enhancing the query speed than increasement of destination level.

A Probabilistic Context Sensitive Rewriting Method for Effective Transliteration Variants Generation (효과적인 외래어 이형태 생성을 위한 확률 문맥 의존 치환 방법)

  • Lee, Jae-Sung
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.2
    • /
    • pp.73-83
    • /
    • 2007
  • An information retrieval system, using exact match, needs preprocessing or query expansion to generate transliteration variants in order to search foreign word transliteration variants in the documents. This paper proposes an effective method to generate other transliteration variants from a given transliteration. Because simple rewriting of confused characters produces too many false variants, the proposed method controls the generation priority by learning confusion patterns from real uses and calculating their probability. Especially, the left and right context of a pattern is considered, and local rewriting probability and global rewriting probability are calculated to produce more probable variants in earlier stage. The experimental result showed that the method was very effective by showing more than 80% recall with top 20 generations for a transliteration variants set collected from KT SET 2.0.

Generation of Object-Oriented Metamodel based on XMI (XMI기반 객체지향 메타모델 생성)

  • Lee, Don-Yang;Song, Young-Jae
    • The KIPS Transactions:PartD
    • /
    • v.11D no.2
    • /
    • pp.397-406
    • /
    • 2004
  • Usually, design method to use UML by Object-Oriented Modelling is used much. But, generation of Metadata that use UML is not easy by difference of expression about detailed functions that Is Involved language and this in environment that differ. In this paper that solution method use XML Metadata Interchange Format(XMI) for standardization and normalization of Pattern and Class. And, for design of Metamodel select frequency A many 4 element of use among XMI Metamodel and create Metadata. Design DB repository for created Metadata storing and add pattern and Information about each class composition and use query and did so that reusability and extension of Metadata nay be easy.

An Efficient String Similarity Search Technique based on Generating Inverted Lists of Variable-Length Grams (가변길이 그램의 역리스트 생성을 이용한 효율적인 유사 문자열 검색 기법)

  • Kim, Jongik
    • Journal of KIISE
    • /
    • v.43 no.11
    • /
    • pp.1275-1280
    • /
    • 2016
  • Existing techniques for string similarity search first generate a set of candidate strings and then verify the candidates. The efficiency of string similarity search is highly dependent on candidate generation methods. State of the art techniques select fixed length q-grams from a query string and generate candidates using inverted lists of the selected q-grams. In this paper, we propose a technique to generate candidates using variable length grams of a query string and develop a dynamic programming algorithm that selects an optimal combination of variable length grams from a query string. Experimental results show that the proposed technique improves the performance of string similarity search compared with the existing techniques.

Implementation of a Dialogue Interface System Using Pattern Matching and Statistical Modeling (패턴 매칭과 통계 모델링을 이용한 대화 인터페이스 시스템의 구현)

  • Kim, Hark-Soo
    • The Journal of Korean Association of Computer Education
    • /
    • v.10 no.3
    • /
    • pp.67-73
    • /
    • 2007
  • In this paper, we review essential constituents of a dialogue interface system and propose practical methods to implement the each constituent. The implemented system consists of a discourse manager, an intention analyzer, a named entity recognizer, a SQL query generator, and a response generator. In the progress of implementation, the intention analyzer uses a maximum entropy model based on statistics because the domain dependency of the intention analyzer is comparatively low. The others use a simple pattern matching method because they needs high domain portability. In the experiments in a schedule arrangement domain, the implemented system showed the precision of 88.1% in intention analysis and the success rate of 83,4% in SQL query generation.

  • PDF

Minimizing the MOLAP/ROLAP Divide: You Can Have Your Performance and Scale It Too

  • Eavis, Todd;Taleb, Ahmad
    • Journal of Computing Science and Engineering
    • /
    • v.7 no.1
    • /
    • pp.1-20
    • /
    • 2013
  • Over the past generation, data warehousing and online analytical processing (OLAP) applications have become the cornerstone of contemporary decision support environments. Typically, OLAP servers are implemented on top of either proprietary array-based storage engines (MOLAP) or as extensions to conventional relational DBMSs (ROLAP). While MOLAP systems do indeed provide impressive performance on common analytics queries, they tend to have limited scalability. Conversely, ROLAP's table oriented model scales quite nicely, but offers mediocre performance at best relative to the MOLAP systems. In this paper, we describe a storage and indexing framework that aims to provide both MOLAP like performance and ROLAP like scalability by essentially combining some of the best features from both. Based upon a combination of R-trees and bitmap indexes, the storage engine has been integrated with a robust OLAP query engine prototype that is able to fully exploit the efficiency of the proposed storage model. Specifically, it utilizes an OLAP algebra coupled with a domain specific query optimizer, to map user queries directly to the storage and indexing framework. Experimental results demonstrate that not only does the design improve upon more naive approaches, but that it does indeed offer the potential to optimize both query performance and scalability.

AutoCor: A Query Based Automatic Acquisition of Corpora of Closely-related Languages

  • Dimalen, Davis Muhajereen D.;Roxas, Rachel Edita O.
    • 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.

  • PDF