摘要
关系数据库管理系统的优势在于存储以二维数据表为模型的数据结构,而在科学研究领域中,一般树作为重要的数据模型广泛存在。本文讨论的中心问题是如何在数据库管理系统中存放压缩的一般树,并在维护海量数据的同时,降低数据冗余,最后讨论数据一致性的保证和对比分析存储、检索算法的时空复杂度。本文通过对树的压缩存储技术的研究,所产生的结论和方法可以延伸到解决众多非线性数据结构在数据库管理系统中的存储问题。
The superiority of relational database management system is to deal with two-dimensional table, it doesnt support the tree fitly. The general tree is a very representative data structure in the research of science, and is applied to many different domains too.Maintaining a great quantity of data and reducing its redundancy are emphases of research on data structure. A utility method will be given to compress and store general tree with relational database management system in this paper. Prefix code is commonly used to resolve the problem of frequency related data. It is also available in compression of database. The pivotal aim is to establish the relationship between two-dimensional data table and prefix code. By comparing the result with path expression method and parent express method, its consistency, time complexity and space complexity will be discussed later. The conclusions and methods of this paper can be used to resolve the problems of other nonlinear data structur＇s storage in database management system based on two-dimensional table.
出处
《重庆师范大学学报（自然科学版）》
CAS
2007年第4期50-53,共4页
Journal of Chongqing Normal University:Natural Science
基金
重庆市教育委员会科学技术研究项目(No.050305)
关键词
数据压缩
一般树
存储
检索
前缀码
data compress
general tree
storage
search
Prefix Code
