基于替罪羊树的批量保序加密算法在CryptDB中的应用

CryptDB is a mature encryption database software in recent years, but it is also a hot spot for researchers to improve the efficiency of the algorithms involved. In this paper, we use the scapegoat tree to replace the AVL tree used in the original algorithm to find the plaintext in order to reduce the number of rotations when adding nodes, reduce the time complexity and improve the algorithm search Speed, thereby improving the efficiency of the algorithm to speed up the user on-line speed. And theoretical analysis and experimental verification of improved programs in different data volumes and a variety of simultaneous on-line users under the circumstances, have significantly improved.