English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13697651      Online Users : 51
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 > 電機資訊學院 > 資訊工程學系 > 期刊論文 >  An Efficient Organization or Large Frequency-Dependent Files for Binary Searcking


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


    Title: An Efficient Organization or Large Frequency-Dependent Files for Binary Searcking
    Authors: Ramamoorthy, C.V.
    Yeh-hao chin
    Date: 1971
    Publisher: Institute of Electrical and Electronics Engineers Computer Society
    Keywords: Access time
    binary search
    cost of memory type
    file
    frequency of usage
    frequency partition file
    item
    key
    mean frequency
    memory hierarchy
    saturated file.
    Abstract: The efficient organization of a very large file to facilitate search and retrieval operations is an important but very complex problem. This paper considers the case of a large file in which the frequency of use of its component subfiles are known. The authors develop the organization of the file so that the average number of entries to locate individual items in it by means of binary search is minimized. The algorithm iteratively partitions the file into `saturated' subfiles, and with each successive iteration the average number of entries to locate an item is reduced until no more improvement is possible. Next, they extend the method to solve the realistic problem of designing an optimal memory hierarchy to hold the file in a computer system. The sizes of various memory components and location of various items of the frequency-dependent file are determined so that the average time to locate an item (over the totality of items) in the memory hierarchy is minimized for a given total cost of the memory system. A number of examples are given to elucidate the methods. Also, the characteristics and results of a Fortran implementation of the algorithms on the CDC 6600 are described
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/12818
    Appears in Collections:[資訊工程學系] 期刊論文
    [資訊系統與應用研究所] 期刊論文
    [電腦與通訊科技研發中心] 期刊論文
    [腦科學研究中心] 期刊論文

    Files in This Item:

    There are no files associated with this item.



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

    SFX Query

    與系統管理員聯絡

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