Editing B+ tree (section)

==History==
{{see also|B-tree}}

There is no single paper introducing the B+ tree concept. Instead, the notion of maintaining all data in leaf nodes is repeatedly brought up as an interesting variant of the B-tree, which was introduced by R. Bayer and E. McCreight.<ref>{{cite book |first1=R. |last1=Bayer |first2=E. |last2=McCreight  |title=Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control - SIGFIDET '70 |chapter=Organization and maintenance of large ordered indices |date=November 1970 |pages=107–141 |doi=10.1145/1734663.1734671 |isbn=978-1-4503-7941-0 |chapter-url=https://dl.acm.org/doi/abs/10.1145/1734663.1734671}}</ref> [[Douglas Comer]] notes in an early survey of B-trees (which also covers B+ trees) that the B+ tree was used in IBM's [[VSAM]] data access software, and refers to an IBM published article from 1973.<ref>{{cite journal | doi=10.1145/356770.356776 | title=Ubiquitous B-Tree | year=1979 | last1=Comer | first1=Douglas | journal=ACM Computing Surveys | volume=11 | issue=2 | pages=121–137 | s2cid=101673 | doi-access=free }}</ref>