• Title/Summary/Keyword: Integrated Query

Search Result 124, Processing Time 0.036 seconds

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.

Cost-Effective Replication Schemes for Query Load Balancing in DHT-Based Peer-to-Peer File Searches

  • Cao, Qi;Fujita, Satoshi
    • Journal of Information Processing Systems
    • /
    • v.10 no.4
    • /
    • pp.628-645
    • /
    • 2014
  • In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness of users' preferences regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.

A Cache Manager for Enhancing the Performance of Query Evaluation in Data Warehousing Environment (데이타웨어하우스 환경에서의 질의 처리 성능 향상을 위한 캐시 관리자)

  • 심준호
    • Journal of KIISE:Databases
    • /
    • v.30 no.4
    • /
    • pp.408-419
    • /
    • 2003
  • Data warehouses are usually dedicated to the processing of quires issued by decision support system(DSS). The response time of DSS queries is typically several orders of magnitude higher than the one of OLTP queries. Since DSS queries are often submitted interactively, techniques for reducing their response time are important. The caching of query results is one such technique particularly well suited to the DSS environment. In this paper, we present a cache manager for such an environment. Specifically, we define a canonical form of query. The cache manager looks up a query based on the exact query match or using a suggested query split process if the query is found is non-canonical form or in canonical form, respectively. It dynamically maintains the cache content by employing a profit function which reflects in an integrated manner the query execution cost, the size of query result, the reference rate, the maintenance cost of each result due to updates of their base tables, and the frequency of such updates. We performed the experimental evaluation and it positively shows the performance benefit of our cache manager.

Real-time Virtual Integration of heterogeneous system and Union Query System

  • Min, Seong-Hyeon;Lee, Sang-Joon;Kwak, Ho-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.10
    • /
    • pp.107-114
    • /
    • 2016
  • In this paper, we propose the building method for the unified IoT service platform between the variety of legacy systems with the heterogeneous structures and the operating environments. To accommodate the structural diversity of legacy systems, we develop a virtual integrated structure and interface abstracting method. By this, the new platform can use the data sources of the legacy systems as if the data source is in the new platform. In a manner without modification of the legacy systems with performing minimum tasks, we proposes a model that can be integrated without affecting the availabilities of the legacy systems.

Knowledge-Based Approach for an Object-Oriented Spatial Database System (지식기반 객체지향 공간 데이터베이스 시스템)

  • Kim, Yang-Hee
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.3
    • /
    • pp.99-115
    • /
    • 2003
  • In this paper, we present a knowledge-based object-oriented spatial database system called KOBOS. A knowledge-based approach is introduced to the object-oriented spatial database system for data modeling and approximate query answering. For handling the structure of spatial objects and the approximate spatial operators, we propose three levels of object-oriented data model: (1) a spatial shape model; (2) a spatial object model; (3) an internal description model. We use spatial type abstraction hierarchies(STAHs) to provide the range of the approximate spatial operators. We then propose SOQL, a spatial object-oriented query language. SOQL provides an integrated mechanism for the graphical display of spatial objects and the retrieval of spatial and aspatial objects. To support an efficient hybrid query evaluation, we use the top-down spatial query processing method.

  • PDF

Automatic 5 Layer Model construction of Business Process Framework(BPF) with M2T Transformation (모델변환을 이용한 비즈니스 프로세스 프레임워크 5레이어 모델 자동 구축 방안)

  • Seo, Chae-Yun;Kim, R. Youngchul
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.63-70
    • /
    • 2013
  • In previous research, we suggested a business process structured query language(BPSQL) for information extraction and retrieval in the business process framework, and used an existing query language with the tablization for each layer within the framework, but still had a problem to manually build with the specification of each layer information of BFP. To solve this problem, we suggest automatically to build the schema based business process model with model-to-text conversion technique. This procedure consists of 1) defining each meta-model of the entire structure and of database schema, and 2) also defining model transformation rules for it. With this procedure, we can automatically transform from defining through meta-modeling of an integrated information system designed to the schema based model information table specification defined of the entire layer each layer specification with model-to-text conversion techniques. It is possible to develop the efficiently integrated information system.

A New Three-dimensional Integrated Multi-index Method for CBIR System

  • Zhang, Mingzhu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.3
    • /
    • pp.993-1014
    • /
    • 2021
  • This paper proposes a new image retrieval method called the 3D integrated multi-index to fuse SIFT (Scale Invariant Feature Transform) visual words with other features at the indexing level. The advantage of the 3D integrated multi-index is that it can produce finer subdivisions in the search space. Compared with the inverted indices of medium-sized codebook, the proposed method increases time slightly in preprocessing and querying. Particularly, the SIFT, contour and colour features are fused into the integrated multi-index, and the joint cooperation of complementary features significantly reduces the impact of false positive matches, so that effective image retrieval can be achieved. Extensive experiments on five benchmark datasets show that the 3D integrated multi-index significantly improves the retrieval accuracy. While compared with other methods, it requires an acceptable memory usage and query time. Importantly, we show that the 3D integrated multi-index is well complementary to many prior techniques, which make our method compared favorably with the state-of-the-arts.

Integrated Semantic Querying on Distributed Bioinformatics Databases Based on GO (분산 생물정보 DB 에 대한 GO 기반의 통합 시맨틱 질의 기법)

  • Park Hyoung-Woo;Jung Jun-Won;Kim Hyoung-Joo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.4
    • /
    • pp.219-228
    • /
    • 2006
  • Many biomedical research groups have been trying to share their outputs to increase the efficiency of research. As part of their efforts, a common ontology named Gene Ontology(GO), which comprises controlled vocabulary for the functions of genes, was built. However, data from many research groups are distributed and most systems don't support integrated semantic queries on them. Furthermore, the semantics of the associations between concepts from external classification systems and GO are still not clarified, which makes integrated semantic query infeasible. In this paper we present an ontology matching and integration system, called AutoGOA, which first resolves the semantics of the associations between concepts semi-automatically, and then constructs integrated ontology containing concepts from GO and external classification systems. Also we describe a web-based application, named GOGuide II, which allows the user to browse, query and visualize integrated data.

Preference-based search technology for the user query semantic interpretation (사용자 질의 의미 해석을 위한 선호도 기반 검색 기술)

  • Jeong, Hoon;Lee, Moo-Hun;Do, Hana;Choi, Eui-In
    • Journal of Digital Convergence
    • /
    • v.11 no.2
    • /
    • pp.271-277
    • /
    • 2013
  • Typical semantic search query for Semantic search promises to provide more accurate result than present-day keyword matching-based search by using the knowledge base represented logically. Existing keyword-based retrieval system is Preference for the semantic interpretation of a user's query is not the meaning of the user keywords of interconnect, you can not search. In this paper, we propose a method that can provide accurate results to meet the user's search intent to user preference based evaluation by ranking search. The proposed scheme is Integrated ontology-based knowledge base built on the formal structure of the semantic interpretation process based on ontology knowledge base system.

Building an Integrated Protein Data Management System Using the XPath Query Process

  • Cha Hyo Soung;Jung Kwang Su;Jung Young Jin;Ryu Keun Ho
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.99-102
    • /
    • 2004
  • Recently according to developing of bioinformatics techniques, there are a lot of researches about large amount of biological data. And a variety of files and databases are being used to manage these data efficiently. However, because of the deficiency of standardization there are a lot of problems to manage the data and transform one into the other among heterogeneous formats. We are interested in integrating. saving, and managing gene and protein sequence data generated through sequencing. Accordingly, in this paper the goal of our research is to implement the system to manage sequence data and transform a sequence file format into other format. To satisfy these requirements, we adopt BSML (Bioinformatics Sequence Markup Language) as the standard to manage the bioinformatics data. And then we integrate and store the heterogeneous 리at file formats using BSML schema based DTD. And we developed the system to apply the characteristics of object-oriented database and to process XPath query, one of the efficient structural query. that saves and manages XML documents easily.

  • PDF