Buffer performance modeling in the context of unclustered index accesses with non-uniform access pattern

Authors:
Kjetil Nørvåg
Affiliations:
Department of Computer and Information Science, Norwegian University of Science and Technology, Sem Saelands v. 7-9, 7491 Trondheim, Norway
Venue:
Information Sciences—Informatics and Computer Science: An International Journal
Year:
2004

Citing 13
Cited 0

Principles of database buffer management

ACM Transactions on Database Systems (TODS)
Index scans using a finite LRU buffer: a validated I/O model

ACM Transactions on Database Systems (TODS)
A comparative study of log-only and in-place update based temporal object database systems

Proceedings of the ninth international conference on Information and knowledge management
Estimating block accesses in database organizations: a closed noniterative formula

Communications of the ACM
On estimating block accesses in database organizations

Communications of the ACM
Approximating block accesses in database organizations

Communications of the ACM
Estimating page fetches for index scans with finite LRU buffers

The VLDB Journal — The International Journal on Very Large Data Bases
Estimating Block Accesses in Database Organizations

IEEE Transactions on Knowledge and Data Engineering
The Effect of Buffering on the Performance of R-Trees

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
A Simple Analysis of the LRU Buffer Policy and Its Relationship to Buffer Warm-Up Transient

Proceedings of the Ninth International Conference on Data Engineering
Rethinking Database System Architecture: Towards a Self-Tuning RISC-Style Database System

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
An Analytical Study of Object Identifier Indexing

DEXA '98 Proceedings of the 9th International Conference on Database and Expert Systems Applications
The Persistent Cache: Improving OID Indexing in Temporal Object-Oriented Database Systems

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cost models are powerful tools for analyzing algorithms, and important in cost-based query optimization. With increasing amounts of main memory available, it is important to include buffer performance in the models. In this paper, we describe and validate (1) buffer models for fine-granularity caching in buffers with locking, and (2) a buffer model for nodes in multiway-tree indexes in the context of unclustered accesses and non-uniform access patterns. The validations show a high accuracy of the models. In future self-tuning database systems, the importance of such models will be even higher than today, and the models presented in this paper should be ideally suited for use in these applications.