ACM Home Page
Please provide us with feedback. Feedback
Buffer management in relational database systems
Full text pdf formatPdf (1.97 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 11 ,  Issue 4  (December 1986) table of contents
Pages: 473 - 498  
Year of Publication: 1986
ISSN:0362-5915
Authors
Giovanni Maria Sacco  Univ. of Torino, Turin, Italy
Mario Schkolnick  IBM T. J. Watson Research Center, Yorktown Heights, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 190,   Citation Count: 37
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/7239.7336
What is a DOI?

ABSTRACT

The hot-set model, characterizing the buffer requirements of relational queries, is presented. This model allows the system to determine the optimal buffer space to be allocated to a query; it can also be used by the query optimizer to derive efficient execution plans accounting for the available buffer space, and by a query scheduler to prevent thrashing. The hot-set model is compared with the working-set model. A simulation study 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
BAYER, R. Database system design for high performance. In Information Processing 83, Mason, Ed. Elsevier North-Holland, New York, 1983, 147-155.
 
3
BAYER, R., AND MCCREIGHT, C. Organization and maintenance of large ordered indexes. Acta Inf. I, 3 (1972), 173-189.
4
 
5
BLASGEN, M. W., AND ESWARAN, K.P. Storage access in relational databases. IBM Syst. J. 16 (1977).
6
 
7
CHAMBERLIN, D. Do, ET AL. Sequel 2: A unified approach to data definition, manipulation, and control. IBM J. Res. Dev. 20, 6 (1976).
 
8
CHOU, H., AND DEWITT, D.J. An evaluation of buffer management strategies for relational database systems. In Proceedings of the l Ith Conference on Very Large Data Bases (Stockholm, 1985), 127-141.
9
10
 
11
12
13
14
15
 
16
FERNANDEZ, E. B., ET AL. Effect of replacement algorithms on a paged buffer database system. IBM J. Res. Dev. 22, 2 (1978), 185-196.
 
17
GHANEM, M.Z. Dynamic partitioning of the main memory using the working set concept. IBM J. Res. Dev. {1975), 445-450.
 
18
 
19
KAPLAN, J. Buffer management policies in a database system. M.S. thesis, Univ. of California, Berkeley, 1980.
20
 
21
22
23
24
 
25
MATTSON, R. L., ET AL. Evaluation strategies for storage hierarchies. IBM Syst. J. 9, 2 (1970), 78-117.
 
26
OBERMARK, R. Global deadlock detection algorithms. IBM Res. Rep. RJ2845, 1980.
27
 
28
SAcco, G.M. Fragmentation: A technique for efficient query processing. TR 20/11/82, Dip. Informatica, Univ. of Torino, Turin, Nov. 20, 1982 (revised: Aug. 26, 1983).
29
 
30
SACCO, G. M., AND BALBO, G. On the estimation of join result cardinalities. TR 24/2/83, Dip. Informatica, Univ. Torino, Turin, Feb. 24, 1983.
 
31
 
32
SACCO, G. M., AND SCHKOLNICK, M. Thrashing reduction in demand accessing of a data base through an LRU paging buffer pool. U.S. Patent 4.422.145, Dec. 20, 1983.
33
34
35
36
37

CITED BY  37
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 


REVIEW

"William Campbell McGee : Reviewer"

The main thesis of this paper is that the performance of a relational DBMS can be improved by scheduling queries for execution on the basis of their main memory cache buffer requirements. Queries are traditionally scheduled in order of arrival.   more...

Collaborative Colleagues:
Giovanni Maria Sacco: colleagues
Mario Schkolnick: colleagues

Peer to Peer - Readers of this Article have also read: