Abstract
To avoid OID index retrieval becoming a bottleneck, efficient buffering strategies are needed to minimize the number of disk accesses. In this paper, we develop analytical cost models which we use to find optimal sizes of the index page buffer and the index entry cache, for different memory sizes, index sizes, and access patterns. Because existing buffer hit estimation models are not applicable for index page buffering in the case of tree based indexes, we have also developed an analytical model for index page buffer performance. The cost gain from using the results in this paper is typically in the order of 200–300%. Thus, the results should be of valuable use in optimizers and tools for configuration and tuning of object-oriented database systems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Bertino and P. Foscoli. On modeling cost functions for object-oriented databases. IEEE Transactions on Knowledge and Data Engineering, 9(3), 1997.
A. K. Bhide, A. Dan, and D. M. Dias. A simple analysis of the LRU buffer policy and its relationship to buffer warm-up transient. In Proceedings of the Ninth International Conference on Data Engineering, 1993.
A. F. Cardenas. Analysis and performance of inverted data base structures. Communications of the ACM, 18(5), 1975.
H. T. Chou and D. DeWitt. An evaluation of buffer management strategies for relational database systems. In Proceedings of the 14th VLDB Conference, 1985.
A. Dan and D. Towsley. An approximate analysis of the LRU and FIFO buffer replacement schemes. In Proceedings of ACM SIGMETRICS, 1990.
G. Diehr and A. N. Saharia. Estimating block accesses in database organizations. IEEE Transactions on Knowledge and Data Engineering, 6(3), 1994.
A. Eickler, C. A. Gerlhof, and D. Kossmann. Performance evaluation of OID mapping techniques. In Proceedings of the 21st VLDB Conference, 1995.
G. Gardarin, J.-R. Gruser, and Z.-H. Tang. A cost model for clustered object-oriented databases. In Proceedings of the 21st VLDB Conference, 1995.
W. S. Luk. On estimating block accesses in database organizations. Communications of the ACM, 26(11), 1983.
L. F. Mackert and G. M. Lohman. Index scans using a finite LRU buffer: A validated I/O model. ACM Transactions on Database Systems, 14(3), 1989.
M. L. McAuliffe. Storage Management Methods for Object Database Systems. PhD thesis, University of Wisconsin-Madison, 1997.
K. NØrvåg and K. Bratbergsengen. An analytical study of object identifier indexing. Technical Report IDI 4/98, Norwegian University of Science and Technology, 1998.
K.-Y. Whang and G. Wiederhold. Estimating block accesses in database organizations: A closed noniterative formula. Communications of the ACM, 26(11), 1983.
S. B. Yao. Approximating the number of accesses in database organizations. Communications of the ACM, 20(4), 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
NØrvåg, K., Bratbergsengen, K. (1998). An analytical study of object identifier indexing. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J. (eds) Database and Expert Systems Applications. DEXA 1998. Lecture Notes in Computer Science, vol 1460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054466
Download citation
DOI: https://doi.org/10.1007/BFb0054466
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64950-2
Online ISBN: 978-3-540-68060-4
eBook Packages: Springer Book Archive