B+ tree是计算机科学tree算法里面的一种,特点是能通过key(关键字)能高效的读取,插入和删除数据。它是动态的,多索引还有最大和最小界限。数据库存储基本上使用的是这个算法,如 IBM
DB2,[1] Informix,[1] Microsoft
SQL Server,[1] Oracle
8,[1] SybaseASE,[1] PostgreSQL,[2] Firebird[3], MySQL[4] and SQLite[5]。
support
this type of tree for table indices. Key-value database management systems such as CouchDB,[6] Tokyo
Cabinet[7] support
this type of tree for data access. InfinityDB[8] is
a concurrent BTree.