基于密文块数组折半查找的B~+树密文数据库索引

为提升密文数据库的查询性能,提出了一种新型的B+树密文数据库索引.通过用密文块数组来组织树节点键值的方法,使节点能容纳的键值数量可以为任意大小,从而不再受加密长度限制.为提高在这种新型B~+树索引节点上的查找速度,设计了密文块数组折半查找算法,它根据密文块数组的特点,通过引入折半查找的思想,解决了原折半查找算法只能在一维数组上进行查找的局限,减少了对密文块的解密量.仿真实验结果表明,该索引比密文块数组顺序查找速度更快.

B~+ tree index for encrypted database based on modified binsearch

To improve the query performance of encrypted database,a new B+ tree index is presented.There is a cryptogram-block array in the tree node.The array can hold as many keys as you want.So the number of the keys in a tree node is no longer determined by the encryption algorithm.To speed up the search in the new B+ tree nod,a new custom-designed binary search algorithm is created,which takes into account the characteristics of the cryptogram-block array and the binary search algorithm.It can be used for a crypt...