BPlusTree(B+树)的一种实现---转

来自：http://hi.baidu.com/lovelink/item/fd60de0d1c4ca1cf905718aa

以下是C++源代码，拷贝保存为cpp文件即可编译。
该代码实现了B+树的索引文件，可以用于数据库中的稀疏索引和密集索引，具体请看注释。
由于水平所限，本人仅保证其能正常运行，不保证执行效率及合理性。
仅供参考，All Rights Reserved------------------------------------------------------------------------------------------
#include <iostream>
#include <fstream>
#include <string>
#include <windows.h>using namespace std;// 定义B+树的阶数
#define M 4// B+树结点定义
struct BPlusNode
{
int amount;       // 该结点中已保存的键值个数
long key[M];      // 键值数组
long children[M]; // 子结点位置数组
long father;      // 父结点位置
long left;        // 同一层中的左结点位置
long right;       // 同一层中的右结点位置
bool isactive;    // 有效位
bool isleave;     // 标志该结点是否叶结点
};// 函数头定义
bool findkey (long key, long &position);   // 查找包含给定键值的结点位置
bool insertkey (long key, long position); // 插入一个新键值
bool deletekey (long key, long position); // 删除给定的键值
void printkey (long mode);                 // 按照给定模式输出B+树// 全局变量
static long pre;             // 上一个被访问的结点
static long cur;             // 当前指向的结点
static long root;            // 根结点位置
static long smallest;        // 保存最小关键值的叶结点
static long nodenewposition; // 新插入的结点位置// 主函数
void main()
{
string command;
long keynumber;
BPlusNode node;
long position = -1;
int tick1,tick2;
fstream iofile;// 检测索引文件是否存在，若不存在则创建一个初始化的索引文件，其中包含根结点位置，最小键值位置和一个空结点
fstream infile ("BPlusTreeData.dat", ios::binary|ios::in);
if (!infile)
{
   node.amount = 1;
   for (int i = 0; i < M; ++i)
   {
    node.key[i] = 0;
    node.children[i] = 0;
   }
   node.father = 0;
   node.left = 0;
   node.right = 0;
   node.isactive = true;
   node.isleave = true;
   root = 8;
   smallest = 8;
   fstream outfile ("BPlusTreeData.dat", ios::binary|ios::out);
   outfile.seekp(0, ios::beg);
   outfile.write((char *)&root, sizeof(long));
   outfile.write((char *)&smallest, sizeof(long));
   outfile.write((char *)&node, sizeof(BPlusNode));
   outfile.close();
}
infile.close();// 循环获取命令行，执行给定的命令
while (true)
{
   cin >> command >> keynumber;   // 插入一个新的键值，该值不能与已有关键值重复
   if (command == "insert")
   {
    tick1 = GetTickCount();
    if (findkey(keynumber, position))
    {
     cout << keynumber << " is already in this B+ tree" << endl;
    }
    else if (insertkey(keynumber, position))
    {
     tick2 = GetTickCount();
     cout << "Successful inserted in " << tick2 - tick1 << " millisecond" << endl;
    }
    else cout << "Action falled" << endl;
   }   // 删除给定的键值
   else if (command == "delete")
   {
    if (deletekey(keynumber, position))
     cout << "Successful deleted" << endl;
   }   // 按照指定模式输出B+数
   // 模式“1”输出整棵树结构
   // 模式“2”按照从小到大的顺序输出所有键值
   else if (command == "print")
   {
    tick1 = GetTickCount();
    printkey(keynumber);
    tick2 = GetTickCount();
    cout << "Printed in " << tick2 - tick1 << " millisecond" << endl;
   }   // 退出程序
   else if (command == "exit")
    break;
   else
   {
    cout << "Please make sure the command is correct" << endl;
    continue;
   }
}
}// 查找包含给定键值的结点位置，若找到则返回“true”
// “position”保存最后访问的结点位置
bool findkey (long key, long &position)
{
BPlusNode node;
long point;
fstream iofile ("BPlusTreeData.dat", ios::binary|ios::in|ios::out);
iofile.seekp(0, ios::beg);
iofile.read((char *)&root, sizeof(long));
iofile.seekp(root, ios::beg);
while (true)
{
   cur = iofile.tellp();
   iofile.read((char *)&node, sizeof(BPlusNode));
   if(!node.isactive) continue;
 
   // B+树只在叶结点保存记录信息
   // 所以查找必须执行到叶结点
   if(!node.isleave)      // 如果该结点不是叶结点，则根据键值决定访问哪个子结点
   {
    for (int i = 1; i < node.amount; ++i)
    {
     point = -1;
     if (node.key[i] > key)
     {
      point = node.children[i-1];
      break;
     }
    }
    if (point == -1) point = node.children[node.amount-1];
    iofile.seekp(point, ios::beg);
    pre = cur;
   }
   else                 // 如果该结点是叶结点，则顺序访问结点中的键值
   {
    for (int i = 1; i < node.amount; ++i)
    {
     if (node.key[i] == key)
     {
      position = cur;
      iofile.close();
      return true;
     }
    }
    position = cur;
    iofile.close();
    return false;
   }
}
}// 按照给定格式输出B+数
void printkey (long mode)
{
BPlusNode node;
int i = 1, k = 1;
fstream iofile("BPlusTreeData.dat", ios::binary|ios::in|ios::out);
/*/ for debug ///
BPlusNode rootnode;
iofile.read((char *)&root, sizeof(long));
iofile.seekp(root, ios::beg);
iofile.read((char *)&rootnode, sizeof(BPlusNode));
cout << "root's children: ";
for (int m = 0; m < rootnode.amount; ++m)
   cout << rootnode.children[m] << " ";
cout << endl;
///*/
// 从根结点开始广度遍历，输出整棵B+树结构
if (mode == 1)
{
   iofile.seekp(0, ios::beg);
   iofile.read((char *)&root, sizeof(long));
   iofile.seekp(root, ios::beg);
   do
   {
    cur = iofile.tellp();
    cout << "level " << k << ":";
    do
    {
     iofile.read((char *)&node, sizeof(BPlusNode));
     cout << "   node " << i << ": ";
     for (int j = 1; j < node.amount; ++j)
      cout << node.key[j] << " ";
     if (node.right == 0)
     {
      i = 1;
      cout << endl;
      break;
     }
     iofile.seekp(node.right, ios::beg);
     ++i;
    }
    while(true);
    iofile.seekp(cur, ios::beg);
    iofile.read((char *)&node, sizeof(BPlusNode));
    if (node.children[0] == 0)
     break;
    iofile.seekp(node.children[0], ios::beg);
    ++k;
   }
   while (true);
   iofile.close();
}// 从包含最小键值的叶结点开始按照从小到大的顺序输出所有键值
else if (mode == 2)
{
   iofile.seekp(4, ios::beg);
   iofile.read((char *)&smallest, sizeof(long));
   iofile.seekp(smallest, ios::beg);
   do
   {
    iofile.read((char *)&node, sizeof(BPlusNode));
    for (int l = 1; l < node.amount; ++l)
     cout << node.key[l] << " ";
    if (node.right == 0)
    {
     cout << endl;
     break;
    }
    iofile.seekp(node.right, ios::beg);
   }
   while(true);
   iofile.close();
}
}// 在位于“position”的结点中插入一个新键值“key”
// 按照B+树的规则，根据情况分裂结点
bool insertkey (long key, long position)
{
fstream iofile;
iofile.open("BPlusTreeData.dat", ios::binary|ios::in|ios::out);
BPlusNode node;
BPlusNode nodenew;
BPlusNode nodetemp1, nodetemp2;
long keytemp[M];
long childrentemp[M+1];
iofile.seekp(0, ios::end);
long posEnd = iofile.tellp();//根节点分裂之后新建根节点
if (position == 0)
{
   iofile.seekp(0, ios::beg);
   iofile.read((char *)&root, sizeof(long));
   iofile.seekp(root, ios::beg);
   iofile.read((char *)&node, sizeof(BPlusNode));
   nodenew.amount = 2;
   nodenew.key[1] = key;
   nodenew.children[0] = root;
   nodenew.children[1] = nodenewposition;
   nodenew.father = 0;
   nodenew.left = 0;
   nodenew.right = 0;
   nodenew.isactive = true;
   nodenew.isleave = false;
   iofile.seekp(8, ios::beg);
   do
   {
    cur = iofile.tellp();
    iofile.read((char *)&nodetemp2, sizeof(BPlusNode));
   }
   while(nodetemp2.isactive && iofile.tellp() < posEnd);
   if (nodetemp2.isactive)
   {
    nodenewposition = iofile.tellp();
    iofile.write((char *)&nodenew, sizeof(BPlusNode));
   }
   else
   {
    iofile.seekp(cur, ios::beg);
    nodenewposition = cur;
    iofile.write((char *)&nodenew, sizeof(BPlusNode));
   }
   root = nodenewposition;
   iofile.seekp(0, ios::beg);
   iofile.write((char *)&root, sizeof(long));
   for (int i = 0; i <= 1; ++i)
   {
    iofile.seekp(nodenew.children[i], ios::beg);
    iofile.read((char *)&nodetemp1, sizeof(BPlusNode));
    nodetemp1.father = nodenewposition;
    iofile.seekp(nodenew.children[i], ios::beg);
    iofile.write((char *)&nodetemp1, sizeof(BPlusNode));
   }
   iofile.close();
   return true;
}// 没有分裂到根结点
else
{
   int insertposition = 0;
   iofile.seekp(position, ios::beg);
   iofile.read((char *)&node, sizeof(BPlusNode));
   if (node.amount < M)         // 结点中还有空位保存新插入的键值，不需要分裂
   {
    // 按照从小到大的顺序重新排列原有键值和新插入的键值
    bool issort1 = false;
    for (int i = 1; i < node.amount; ++i)
    {
     if (node.key[i] > key)
     {
      for (int j = node.amount - i, k = 0; j > 0; --j, ++k)
      {
       node.key[node.amount-k] = node.key[node.amount-k-1];
      }
      node.key[i] = key;
      insertposition = i;
      issort1 = true;
      break;
     }
    }
    if (!issort1)
    {
     node.key[node.amount] = key;
     insertposition = node.amount;
    }
    node.amount++;
    if (!node.isleave)
    {
     for (int p = node.amount-1; p > insertposition; --p)
     {
      node.children[p] = node.children[p-1];
     }
     node.children[insertposition] = nodenewposition;
    }
    iofile.seekp(position, ios::beg);
    iofile.write((char *)&node, sizeof(BPlusNode));
    iofile.close();
    return true;
   }
   else         // 结点中没有空位保存新插入的键值，必须分裂成两个结点
   {
    long nextinsertkey = 0;    // 按照从小到大的顺序重新排列原有键值和新插入的键值
    // 并且按照键值的顺序重新排列保存子结点位置的数组
    bool issort2 = false;
    for (int m = 1, n = 0, o = 0; m < M; ++m, ++o)
    {
     if (node.key[m] < key || issort2)
     {
      keytemp[m-1+n] = node.key[m];
      childrentemp[o+n] = node.children[o];
     }
     else
     {
      keytemp[m-1] = key;
      childrentemp[o] = node.children[o];
      childrentemp[o+1] = nodenewposition;
      n = 1;
      --m;
      issort2 = true;
     }
    }
    if (!issort2)
    {
     keytemp[M-1] = key;
     childrentemp[M-1] = node.children[M-1];
     childrentemp[M] = nodenewposition;
    }
    /*/ for debug //
    cout << "keytemp: ";
    for (int a = 0; a < M; ++a)
     cout << keytemp[a] << " ";
    cout << endl;
    /*/
    node.amount = M/2+1;
    if (!node.isleave)      // 按照内部结点的方式创建新结点
    {
     nodenew.amount = M/2;
     for (int i = 0, j = 1; i <= M; ++i)
     {
      if (i < M/2)
      {
       node.key[i+1] = keytemp[i];
       node.children[i] = childrentemp[i];
      }
      else if (i == M/2)
      {
       nextinsertkey = keytemp[i];
       node.children[i] = childrentemp[i];
      }
      else if (i < M)
      {
       nodenew.key[j] = keytemp[i];
       nodenew.children[j-1] = childrentemp[i];
       node.key[i] = 0;
       ++j;
      }
      else if (i == M)
      {
       nodenew.children[j-1] = childrentemp[i];
      }
     }
     nodenew.isleave = false;
    }
    else      // 按照叶结点的方式创建新结点
    {
     nodenew.amount = M/2+1;
     for (int i = 0, j = 1; i < M; ++i)
     {
      if (i < M/2)
      {
       node.key[i+1] = keytemp[i];
      }
      else
      {
       nodenew.key[j] = keytemp[i];
       if (i < M-1)
        node.key[i+1] = 0;
       ++j;
      }
     }
     nextinsertkey = nodenew.key[1];
     nodenew.isleave = true;
     for (int n = 0; n < M; ++n)
      nodenew.children[n] = 0;
    }
    nodenew.key[0] = 0;
    nodenew.father = node.father;
    nodenew.left = position;
    nodenew.right = node.right;
    nodenew.isactive = true;    // 查找新结点的插入位置
    // 若索引文件中存在一个曾经被删除的结点，则用新结点覆盖掉这个结点
    // 若不存在这样的结点，则将新结点添加到索引文件尾部
    iofile.seekp(8, ios::beg);
    do
    {
     cur = iofile.tellp();
     iofile.read((char *)&nodetemp2, sizeof(BPlusNode));
    }
    while(nodetemp2.isactive && iofile.tellp() < posEnd);
    if (nodetemp2.isactive)
    {
     nodenewposition = iofile.tellp();
     iofile.write((char *)&nodenew, sizeof(BPlusNode));
    }
    else
    {
     iofile.seekp(cur, ios::beg);
     nodenewposition = cur;
     iofile.write((char *)&nodenew, sizeof(BPlusNode));
    }
    node.right = nodenewposition;
    iofile.seekp(position, ios::beg);
    iofile.write((char *)&node, sizeof(BPlusNode));
    iofile.close();
    if (insertkey(nextinsertkey, nodenew.father))      // 递归调用插入算法将分裂后需要插入到父结点的键值插入到父结点中
     return true;
    else return false;
   }
}
}// 删除给定的键值
// 该算法不符合B+树的删除规则
// 只是简单地将除被删除键值外的其它键值重新插入一遍
bool deletekey (long key, long position)
{
fstream iofile;
iofile.open("BPlusTreeData.dat", ios::binary|ios::in|ios::out);
BPlusNode node;
long *keynumbertemp = new long[];
long number = 0;
long posEnd;
iofile.seekp(0, ios::end);
posEnd = iofile.tellp();
iofile.seekp(4, ios::beg);
iofile.read((char *)&smallest, sizeof(long));
iofile.seekp(smallest, ios::beg);
do
{
   iofile.read((char *)&node, sizeof(BPlusNode));
   for (int i = 1; i < node.amount; ++i)
   {
    keynumbertemp[number] = node.key[i];
    ++number;
   }
   if (node.right == 0)
   {
    --number;
    break;
   }
   iofile.seekp(node.right, ios::beg);
}
while(true);
/*/ for debug /
cout << "smallest: " << smallest << endl;
for (int x = 0; x <= number; ++x)
{
   cout << keynumbertemp[x] << " " << endl;
}
/*/
node.amount = 1;
for (int j = 0; j < M; ++j)
{
   node.key[j] = 0;
   node.children[j] = 0;
}
node.father = 0;
node.left = 0;
node.right = 0;
node.isactive = true;
node.isleave = true;
root = 8;
smallest = 8;
iofile.seekp(0, ios::beg);
iofile.write((char *)&root, sizeof(long));
iofile.write((char *)&smallest, sizeof(long));
iofile.write((char *)&node, sizeof(BPlusNode));
for (;iofile.tellp() < posEnd;)
{
   iofile.read((char *)&node, sizeof(BPlusNode));
   node.isactive = false;
   iofile.seekp(-long(sizeof(BPlusNode)), ios::cur);
   iofile.write((char *)&node, sizeof(BPlusNode));
}
iofile.close();
for (int k = 0; k <= number; ++k)
{
   if (keynumbertemp[k] == key)
    continue;
   findkey(keynumbertemp[k], position);
   insertkey(keynumbertemp[k], position);
}
return true;
}