摘要
本文综合了线性表、循环表、矩阵等数据结构的基本概念以及压缩存储、索引存储等存储方式的基本概念，通过矿山计划计算机交互辅助编制系统中遇到的极大量数据的处理问题，导出了压缩循环阵存储的概念及定义。这种存储结构既保持了线性表、循环表的灵活性，又能有效地压缩存储空间，而且能象索引存储那样对数据结点快速定位，是对大量分段重复数据进行处理的有效存储结构之一。
This paper introduces the concept and the definition of a proposed compressed circular array storage technique, based upon the synthesis of the fundamental concepts of data structures and storage metho ds, such as linear list. circular list, two-dimentional array, data compression and indexed storage, and through the interactive microcomputer-alded mining design and planning where substantially large data set has to be accesed and processed. This storage technique has not only the flexibility of linear list and circular list but also the quick data node location like the indexed storage, with efficient leduction of the memory storage required. It is one of the effective storage techniques for segmentally-repeated values of data nodes.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1994年第1期57-62,共6页
Journal of Computer Research and Development
关键词
数据结构
压缩存储
data structure, data compression. microcomputer aided design.
