A unifying approach to evaluating block accesses in database organizations
type: Item
instance of: scholarly article
title: A unifying approach to evaluating block accesses in database organizations
zbMATH Open document ID: 0661.68111
DOI: 10.1016/0020-0190(88)90200-1
author: Paolo Ciaccia
author: Dario Maio
author: Paolo Tiberio
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 4080980
zbMATH Keywords: database
zbMATH Keywords: number of block accesses
zbMATH Keywords: blocking factor
zbMATH Keywords: recursive and nonrecursive formulas
MaRDI profile type: Publication
full work available at URL: 0020-0190(88)90200-1
OpenAlex ID: W2073913766
cites work: Analysis and performance of inverted data base structures
cites work: A stochastic evaluation model for database organizations in data retrieval systems
cites work: Estimating block accesses in database organizations
cites work: Approximating block accesses in database organizations
description: scientific article; zbMATH DE number 4080980