Approximating block accesses in random files: The case of blocking factors lower than one
作者:
Highlights:
•
摘要
Expressions available in the current literature to estimate the number of blocks accessed in a random file fail to work when the blocking factor is lower than one. A new expression is developed in this article to estimate the number of blocks accessed; this expression is valid for blocking factors that are higher as well as lower than one. It is shown using simulation experiments that this expression is quite accurate in most situations.
论文关键词:Databases,database design,performance evaluation,random files,blocking factors,block accesses
论文评审过程:Received 27 June 1989, Revised 12 January 1991, Available online 17 June 2003.
论文官网地址:https://doi.org/10.1016/0306-4379(91)90007-V