Abstract: 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.