Alternating hashing for expansible files

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

1997-01-01

類型

期刊名稱

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING

卷期與頁次

第 9 卷,頁 179–185

ISSN

1041-4347

語言

英文

摘要

In this paper, we propose a generalized approach for designing a class of dynamic hashing schemes which require no index and have the growth of a file at a rate of n+1/n per full expansion, where n is the number of pages of the file, as compared to a rate of two in linear hashing. Based on this generalized approach, we derive a new dynamic hashing scheme called alternating hashing, in which, when a split occurs in page k, the data records in page k will be redistributed to page k and page (k + 1), or page k and page (k - 1), according to whether the value of level dis even or odd, respectively. (Note that a level is defined as the number of full expansions happened so far.) From our performance analysis, given a fixed load control, the proposed scheme can achieve nearly 97% storage utilization as compared to 78% storage utilization by using linear hashing.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chang, Y., & Lee, C. (1997). Alternating hashing for expansible files. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 9, 179–185. https://doi.org/10.1109/69.567061

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/149475