English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 95940/126530 (76%)
Visitors : 31809049      Online Users : 319
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/69375
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/69375

    Title: Partition strategy for distributed query processing in fast local networks
    Authors: 陳良弼
    Yu,C.T.;Keh-Chang Guh;Brill, D;Chen,Arbee L. P.
    Contributors: 資科系
    Date: 1989-06
    Issue Date: 2014-08-28 10:08:34 (UTC+8)
    Abstract: A partition-and-replicate strategy for processing distributed queries referencing no fragmented relation is sketched. An algorithm is given to determine which relation and which copy of the relation is to be partitioned into fragments, how the relation is to be partitioned, and where the fragments are to be sent for processing. Simulation results show that the partition strategy is useful for processing queries in fast local network environments. The results also show that the number of partitions does not need to be large. The use of semijoins in the partition strategy is discussed. A necessary and sufficient condition for a semijoin to yield an improvement is provided
    Relation: IEEE Transactions on Software Engineering (SCI,EI),780-793
    Data Type: article
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File 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