B-tree page size when caching is considered

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

B-tree page size when caching is considered

Full text

Pdf (366 KB)

Source

ACM SIGMOD Record archive
Volume 27 , Issue 3 (September 1998) table of contents

Pages: 28 - 32

Year of Publication: 1998

ISSN:0163-5808

Author

David Lomet

Microsoft Research, Redmond. WA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

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/290593.290598 What is a DOI?

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	Gray, J. and Graefe, G. The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb. <i>ACM Sigmod Record</i> 26,4 (Dec. 1997) 63-68.
	2	Litwin, W. and Lomet, D. The Bounded Disorder Access Method. <i>Intl. Conf. on Data Engineering ,</i> Los Angeles (1985) 38-48.

CITED BY 5

	David Lomet, The evolution of effective B-tree: page organization and techniques: a personal account, ACM SIGMOD Record, v.30 n.3, September 2001
	Richard A. Hankins , Jignesh M. Patel, Effect of node size on the performance of cache-conscious B⁺-trees, ACM SIGMETRICS Performance Evaluation Review, v.31 n.1, June 2003
	Panfeng Zhou , Donghui Zhang , Betty Salzberg , Gene Cooperman , George Kollios, Close pair queries in moving object databases, Proceedings of the 13th annual ACM international workshop on Geographic information systems, November 04-05, 2005, Bremen, Germany
	Shimin Chen , Phillip B. Gibbons , Todd C. Mowry , Gary Valentin, Fractal prefetching B⁺-Trees: optimizing both cache and disk performance, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin
	Goetz Graefe, B-tree indexes, interpolation search, and skew, Proceedings of the 2nd international workshop on Data management on new hardware, June 25-25, 2006, Chicago, Illinois