摘要
在目前UNIX的目录结构中,对目录项的搜索是线性的。本文首先简要说明目前UNIX目录的搜索过程,然后提出了一种新的Hash目录结构,给出了hash函数,并给出了在这种目录上的搜索过程,最后对其性能作了详细分析,包括它的搜索速度、磁盘块分布和使用情况。实验证明,这种目录结构搜索性能比传统结构有很大的提高。
At present directory structure of UNIX, the searching for its directory entries is linear. This article briefly illustrated the searching process of present directory structure,and proposed a new directory structure based on hash algorithms, provided the function of hash and the searching algorithms for it. At the last, we analyzed it' s performance in detail,including the speed of searching for a entries and the distribution of disk block . The experiment certified that the new directory structure excelled the present in their searching efficiency.
出处
《微计算机信息》
北大核心
2006年第09X期257-260,共4页
Control & Automation
基金
成都信息工程学院科技发展基金资助(项目编号:CSRF200406)