[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

B-tree page size when caching is considered

Published: 01 September 1998 Publication History
First page of PDF

References

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

Cited By

View all
  • (2023)AirIndex: Versatile Index Tuning Through Data and StorageProceedings of the ACM on Management of Data10.1145/36173081:3(1-26)Online publication date: 13-Nov-2023
  • (2010)Enhancing the B+-tree by dynamic node popularity cachingInformation Processing Letters10.1016/j.ipl.2010.01.008110:7(268-273)Online publication date: 1-Mar-2010
  • (2006)B-tree indexes, interpolation search, and skewProceedings of the 2nd international workshop on Data management on new hardware10.1145/1140402.1140409(5-es)Online publication date: 25-Jun-2006
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record
ACM SIGMOD Record  Volume 27, Issue 3
Sept. 1, 1998
76 pages
ISSN:0163-5808
DOI:10.1145/290593
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1998
Published in SIGMOD Volume 27, Issue 3

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)76
  • Downloads (Last 6 weeks)16
Reflects downloads up to 02 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)AirIndex: Versatile Index Tuning Through Data and StorageProceedings of the ACM on Management of Data10.1145/36173081:3(1-26)Online publication date: 13-Nov-2023
  • (2010)Enhancing the B+-tree by dynamic node popularity cachingInformation Processing Letters10.1016/j.ipl.2010.01.008110:7(268-273)Online publication date: 1-Mar-2010
  • (2006)B-tree indexes, interpolation search, and skewProceedings of the 2nd international workshop on Data management on new hardware10.1145/1140402.1140409(5-es)Online publication date: 25-Jun-2006
  • (2005)Close pair queries in moving object databasesProceedings of the 13th annual ACM international workshop on Geographic information systems10.1145/1097064.1097067(2-11)Online publication date: 4-Nov-2005
  • (2004)A Cost Model for Spatial Intersection Queries on RI-TreesDatabase Systems for Advanced Applications10.1007/978-3-540-24571-1_30(331-338)Online publication date: 2004
  • (2003)Effect of node size on the performance of cache-conscious B+-treesACM SIGMETRICS Performance Evaluation Review10.1145/885651.78106331:1(283-294)Online publication date: 10-Jun-2003
  • (2003)Effect of node size on the performance of cache-conscious B+-treesProceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems10.1145/781027.781063(283-294)Online publication date: 11-Jun-2003
  • (2003)Bkd-Tree: A Dynamic Scalable kd-TreeAdvances in Spatial and Temporal Databases10.1007/978-3-540-45072-6_4(46-65)Online publication date: 2003
  • (2002)Fractal prefetching B+-TreesProceedings of the 2002 ACM SIGMOD international conference on Management of data10.1145/564691.564710(157-168)Online publication date: 3-Jun-2002
  • (2002)A Cost Model for Interval Intersection Queries on RI-TreesProceedings of the 14th International Conference on Scientific and Statistical Database Management10.1109/SSDM.2002.1029713(131-141)Online publication date: 24-Jul-2002
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media