English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 95906/126496 (76%)
Visitors : 31676193      Online Users : 468
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 期刊論文 >  Item 140.119/69382
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/69382

    Title: A New Relation Partitioning Scheme for Distributed Query Optimization
    Authors: 陳良弼
    Wang,Wen-Fang;Chen,Arbee L. P.
    Contributors: 資科系
    Keywords: distributed database system;query optimization;relation partition;relation replication;hash function;heterogeneous database system
    Date: 1996-03
    Issue Date: 2014-08-28 10:15:01 (UTC+8)
    Abstract: The "fragment and replicate" strategy has been used to process distributed queries. One of the relations referenced in a query is horizontally partitioned into fragments and distributed to a set of processing sites. After other relations are replicated at these sites, the query is processed in parallel. The query answer is the union of the results produced at each processing site. To process a query, we have to determine which relation to partition, how to partition this relation, and which sites will be the processing sites. In this paper, we extend this strategy by considering replication of portions of the relations instead of the entire relations to improve system performance. Based on the characteristics of semijoin, the min-max method and a hash-based method are designed to partition relations. A general algorithm based on these new processing methods is then given, which determines the relations to partition, the manner of partitioning, and the sites to use to process the query. Further, since the replicated relations may be useful for future queries, we will descuss the way to manage them. Finally, we will show how the algorithm can be used in a heterogeneous database system.
    Relation: Journal of Inforamtion Science and Engineering,12(1),79-99
    Data Type: article
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback