一种粗关系数据库索引方法  

Index Approach of Rough Relational Database

作　　者：邱桃荣[1] 袁新娣[2] 魏玲玲[1] 徐苏[1] 

机构地区：[1]南昌大学计算机系,南昌330031 [2]江西赣南师范学院物理与信息科学系,赣州341000

出　　处：《计算机工程》2008年第22期80-82,共3页Computer Engineering

基　　金：江西省科技厅重点攻关计划基金资助项目(20061B01002);江西省教育厅科技基金资助项目([2007]28)

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

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

分 类 号：TP311.134[自动化与计算机技术—计算机软件与理论]