Skip to content

References

Jump to bottom
Zbigniew Romanowski edited this page Apr 19, 2018 · 6 revisions

References, books

  • A. Silberschatz, H.F. Korth, S. Sudarshan, "Database System Concepts", 6th ed. (McGraw Hill, 2011)

  • R. Ramakrishnan, J. Gehrke, "Database Management Systems ", 3rd ed. (McGraw Hill, 2003)

  • A. Drozdek, D.L. Simon "Data Structures in C", (PWS, 1995)

References, articles

  • R. Bayer E.M. McCreight, "Organization and maintenance of large ordered indexes", Acta Informatica, Volume 1, Issue 3, pp. 173–189, Year 1972, PDF

  • R. Bayer, "Symmetric binary B-Trees: Data structure and maintenance algorithms", Acta Informatica, Volume 1, Issue 4, pp. 290–306, Year 1972, Abstract

  • R. Bayer, K. Unterauer, "Prefix B-trees", ACM Transactions on Database Systems, Volume 2, Issue 1, pp. 11-26, Year 1977, Abstract

  • D. Comer, "Ubiquitous B-Tree", ACM Computing Surveys, Volume 11, Issue 2, Pages 121-137, Year 1979, PDF

  • J. Zhou "A B+-tree Index fot the Know-It-All Database Framework", 2003, PDF

  • D. Lomet, "The Evolution of Effective B-tree: Page Organization and Techniques: A Personal Account", SIGMOD Record, Volume 30, No. 3, 2001, PDF

  • R. ORLANDIC, H.M. MAHMOUD "STORAGE OVERHEAD OF O-TREES, B-TREES AND PREFIX B-TREES: A COMPARATIVE ANALYSIS", International Journal of Foundations of Computer Science, PDF

  • G. Graefe, "Sorting And Indexing With Partitioned B-Trees ", Proceedings of the 2003 CIDR Conference, PDF

  • G. Graefe, "Write-Optimized B-Trees ", Proceedings of the 30th VLDB Conference, 2004, PDF

  • G. Graefe, "A Survey of B-Tree Logging and Recovery Technique", ACM Transactions on Database Systems, Vol. 35, No. 3, Article 16, 2012, PDF

  • G. Graefe, "Modern B-Tree Techniques", Foundations and Trends in Databases, Vol. 3, No. 4, pp. 203–402, Year 2010, PDF

  • G. Graefe, "A Survey of B-Tree Locking Technique", ACM Transactions on Database Systems, Vol. 35, No. 3, Article 16, Year 2010, PDF

  • P. Wang, "An In-Depth Analysis of Concurrent B-tree Algorithms", Massachusetts Institute of Technology Report MIT/LCS/TR-496, Year 1991, PDF

  • Y.-S. KWONG,D. WOOD, "A New Method for Concurrency in B-Trees", IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. SE-8, NO. 3, pp. 211-222, Year 1982, PDF

  • M.K. Aguilera, W. Golab, M.A. Shah, "A Practical Scalable Distributed B-Tree", VLDB, Year 2008, PDF

  • J. Jannink, "Implementing Deletion in B+-trees", Stanford University report, 1995, PDF

  • T. Johnson, D. Shasha, "B-trees with inserts and deletes: Why free-at-empty is better than merge-at-half", Journal of Computer and System Sciences, Volume 47, Issue 1, Pages 45-76, 1993, PDF

  • A. Braginsky, E. Petrank, "A Lock-Free B+tree", SPAA, June 25–27, 2012, PDF

  • A. Sultana, "Concurrent B-trees Using Lock-free Techniques", Master Thesis, 2007, PDF

  • A. Sultana, H.A. Cameron, P.C.J. Graham, "Concurrent B-trees with Lock-free Techniques", Concordia University report, 2011, PDF

  • S. Sen, R.E. Tarjan, "Deletion Without Rebalancing in Multiway Search Trees", ACM Transactions on Database Systems, Volume 39, Issue 1, Article No. 8, January 2014, PDF

Clone this wiki locally