Abstract: The storage of complete lattice is an important issue in various types of applications. The theory of formal concept analysis is adopted in the storage of complete lattice. For a given complete lattice, when it is stored by using a matrix, irreducible elements are identified. This paper marks the upper and lower irreducible elements separately by using different types of signs, i.e. object labels and attribute labels, and lets them indicate rows and columns of the matrix. It ascertains the element of the matrix according to the relationship between the upper and lower irreducible elements. Compared with using adjacent matrix, this method is more efficient and suitable for application.

Key words: formal concept analysis, complete lattice, irreducible elements, storage model, concept lattice

摘要： 完全格的存储是一个有实际应用价值的关键问题。在利用矩阵存储完全格时，识别完全格中的不可约元；分别对上确界不可约元和下确界不可约元用对象标签和属性标签进行标注，使得对象标签和属性标签分别对应矩阵的行和列；根据不可约元之间的关系确定矩阵中元素的值。与采用邻接矩阵存储完全格相比，该方法只存储不可约元的相关信息，能够提高存储的效率。

关键词: 形式概念分析, 完全格, 不可约元, 存储模型, 概念格