作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (16): 51-53. doi: 10.3969/j.issn.1000-3428.2009.16.017

• 软件技术与数据库 • 上一篇    下一篇

粗关系数据库查询模型

魏玲玲1,姚磊岳1,王荣福2,谢抢来1   

  1. (1. 江西蓝天学院软件研究所,南昌 330029;2. 江西赣江职业技术学院,南昌 330108)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-08-20 发布日期:2009-08-20

Query Model of Rough Relational Databases

WEI Ling-ling1, YAO Lei-yue1, WANG Rong-fu2, XIE Qiang-lai1   

  1. (1. Software Institute, Jiangxi Bluesky University, Nangchang 330029; 2. Jianxi Ganjiang Vocational College, Nangchang 330108)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-08-20 Published:2009-08-20

摘要: 针对粗关系数据库中数据的特性,提出一种不确定性数据的存储方法。基于汉明距离的一种变式,计算元组间距离,构成距离矩阵,根据距离矩阵将相同或相近的元组归类,从而有效地对表中的元组进行索引。借助粗集中的上、下近似,通过计算用户查询的数据与粗关系数据库中数据的相似度,查询出用户所需的数据。结合以上方法构建粗关系数据库查询模型,设计相应的查询算法并应用于实例中。

关键词: 粗关系数据库, 数据存储, 索引, 查询

Abstract: According to data characteristics of the Rough Relational Databases(RRDB), a method for storing uncertainty data is put forward. An approach to index uncertain data is proposed based on Hamming distance. A query method is presented by using the similarity degree calculated between the data entered by users and the data being queried in RRDB based on the concepts of upper and lower approximation of rough sets. The theory methods mentioned above are combined, and the query model of RRDB is constructed. And an algorithm for querying data in RRDB is described and illustrated by using an analysis example. The real world example shows that the proposed approach is useful and effective.

Key words: Rough Relational Databases(RRDB), data storage, index, query

中图分类号: