Approximating Block Accesses in Random Files: The Case of Blocking Factors Lower than One

UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
Prashant Palvia, Joe Rosenthal Excellence Professor and Director of the McDowell Research Center for Global IT Management (Creator)
Institution
The University of North Carolina at Greensboro (UNCG )
Web Site: http://library.uncg.edu/

Abstract: 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.

Additional Information

Publication
Information Systems, Vol. 16, No. 3, 1991, pp. 357-361
Language: English
Date: 1991
Keywords
Databases, Database design, Performance evaluation, Random tiles, Blocking factors, Block accesses