摘要： 根据粗关系数据库中所存数据的特性，提出不确定性数据索引方法。将粗关系数据库中的元组属性值以二进制串表示，借助改进的汉明距离公式计算元组间的距离，构成距离矩阵，根据该矩阵中的距离值将元组分类，从而实现对表中元组的索引。给出描述索引的算法，通过实例说明了该索引方法是可行和有效的。

关键词: 粗关系数据库, 索引, 汉明距离

Abstract: According to the characteristic of data stored in rough relational databases, one approach to index uncertain data is put forward. The values of attributes of tuples in rough relational databases are represented by binary string. Based on the improved formula of Hamming distance, the distance between tuples is calculated and a distance matrix is constructed. On the basis of the distance matrix, the tuples are classified and index of tuples is implemented. An algorithm for index of rough relational databases is described and illustrated by using a soil analysis example. The example shows that the proposed approach is useful and effective.

Key words: rough relational database, index, Hamming distance

中图分类号: 

• TP311.134