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. Furthermore, we prove that Yao's formula is the expected value of our (and Siler's) probability function. © 1988.

A unifying approach to evaluating block accesses in database organizations / Ciaccia P.; Maio D.; Tiberio P.. - In: INFORMATION PROCESSING LETTERS. - ISSN 0020-0190. - STAMPA. - 28:5(1988), pp. 253-257. [10.1016/0020-0190(88)90200-1]

A unifying approach to evaluating block accesses in database organizations

Ciaccia P.;Maio D.;Tiberio P.
1988

Abstract

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. Furthermore, we prove that Yao's formula is the expected value of our (and Siler's) probability function. © 1988.
1988
A unifying approach to evaluating block accesses in database organizations / Ciaccia P.; Maio D.; Tiberio P.. - In: INFORMATION PROCESSING LETTERS. - ISSN 0020-0190. - STAMPA. - 28:5(1988), pp. 253-257. [10.1016/0020-0190(88)90200-1]
Ciaccia P.; Maio D.; Tiberio P.
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/918322
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 3
social impact