ACM Home Page
Please provide us with feedback. Feedback
The distribution of granule accesses made by database transactions
Full text PdfPdf (133 KB)
Source
Communications of the ACM archive
Volume 25 ,  Issue 11  (November 1982) table of contents
Pages: 831 - 832  
Year of Publication: 1982
ISSN:0001-0782
Authors
Annie W. Shum  Harvard Univ., Cambridge, MA
Andrew M. Langer  Harvard Univ., Cambridge, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/358690.358714
What is a DOI?

ABSTRACT

The problem of characterizing the number of granules (or blocks) accessed by a transaction is important in modeling the performance of database management systems and other applications. Different expressions for this quantity have appeared in the literature under different probabilistic assumptions. These expressions along with one new result are presented with a uniform notation and a clear statement of the assumptions underlying each. The partial order relating the predictions of the expected number of granules accessed is presented.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Merett, T.H., and Otoo, E. Distribution models of relations. Proc. 5th Conf. Very Large Data Bases, Rio de Janeiro, 1979.
 
3
Ries, D. The effect of concurrency control on database management system performance. Ph.D Dissertation, Computer Science Department, University of California, Berkeley, Apr. 1979.
 
4
Piordan, J. An Introduction to Combinatorial Analysis. Wiley, New York, 1958.
5
6
7

CITED BY  11

Collaborative Colleagues:
Annie W. Shum: colleagues
Andrew M. Langer: colleagues