对二叉树存储空间的压缩和查询效率的提升  

Compression of Binary Tree Storage Space and Improved Query Efficiency

作　　者：王鹏 鲍正德 陈臻铭 李晨曦 Wang Peng;Baozhengde;Chenzhenming;Lichenxi

机构地区：[1]四川大学锦城学院,计算机与软件学院,四川省成都市611731

出　　处：《计算机系统网络和电信》2019年第1期42-45,共4页

摘　　要：在搜索二叉树的基础上,利用二叉树的两种存储方式(链式存储和顺序存储)对空间占用上的差异,动态的转换存储方式,以压缩二叉树总体的大小。在引入动态转换机制后,二叉树的随机访问能得到提升。为防止树在两种存储方式上过多的转换而造成的性能损耗,引入了插入(删除)变长缓冲区机制。并引入多级索引缓冲机制提高树的查询效率。on the basis of searching binary tree,using the difference between the two storage modes of binary tree(chain storage and sequential storage)to occupy space,the dynamic conversion storage method is used to compress the overall size of binary tree.After introducing the dynamic conversion mechanism,random access to the binary tree can be improved.In order to prevent the performance loss caused by too many tree conversions in both storage modes,the mechanism of inserting(removing)the variable-length buffer is introduced.A multi-level index buffer mechanism is introduced to improve the query efficiency of the tree.

关 键 词：二叉树 缓冲区 多级索引 数据压缩 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]