English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 11228901      Online Users : 67
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  Redundant MKH Files Design among Multiple Disks for Concurrent Partial Match Retrieval


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80774


    Title: Redundant MKH Files Design among Multiple Disks for Concurrent Partial Match Retrieval
    Authors: Chen, C.Y.;Lin, H.F.;Lee, R.C.T.;Chang, C.C.
    教師: 李家同
    Date: 1996
    Publisher: Elsevier
    Relation: JOURNAL OF SYSTEMS AND SOFTWARE, Elsevier, Volume 35, Issue 3, DEC 1996, Pages 199-207
    Keywords: CARTESIAN PRODUCT FILES
    MODULO ALLOCATION METHOD
    SYSTEMS
    Abstract: It is known that the average query cost of a file in a multiple disk system can be dramatically reduced by storing redundant records of the file onto different disks. However, additional space is needed for the redundant records. In addition, the achievement of minimum redundance is difficult. Recently, Chen et al. (1994) showed that the problem of allocating all buckets of a multiple key hashing (MKH) file optimally among multiple disks for concurrent partial match retrieval can be reduced to a smaller sized subfile, called the remainder of the file. Based upon their reduction work, this article suggests two redundant storage schemes for MKH files in a multiple disk system. We point out that only modest copies of the remainder are necessary to be redundantly stored, in order to get perfectly optimal average query response time performance for an MKH file. We also emphasize that by using different clusterings for different copies,both the record organization cost and the bucket allocation cost can be simultaneously reduced, and thus, the cost can be dramatically reduced.
    Relation Link: http://www.elsevier.com/wps/find/homepage.cws_home
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80774
    Appears in Collections:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML629View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

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