A unifying approach to evaluating block accesses in database organizations (Q1113696)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A unifying approach to evaluating block accesses in database organizations |
scientific article; zbMATH DE number 4080980
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A unifying approach to evaluating block accesses in database organizations |
scientific article; zbMATH DE number 4080980 |
Statements
A unifying approach to evaluating block accesses in database organizations (English)
0 references
1988
0 references
A nonrecursive discrete density function to compute the probability of retrieving k records from exactly i blocks of a file is introduced here. This function is shown to be equivalent to Siler's recursive one [\textit{K. F. Siler}, Commun. ACM 19, 84-95 (1976; Zbl 0317.68034)]. Furthermore, we prove that Yao's formula [\textit{S. B. Yao}, ibid. 20, 260-261 (1977; Zbl 0346.68019)] is the expected value of our (and Siler's) probability function.
0 references
database
0 references
number of block accesses
0 references
blocking factor
0 references
recursive and nonrecursive formulas
0 references
