首页 | 本学科首页   官方微博 | 高级检索  
     

基于相似度的粗关系数据库的近似查询
引用本文:邱桃荣,葛寒娟,魏玲玲,徐苏,姚晓昆.基于相似度的粗关系数据库的近似查询[J].计算机工程与应用,2008,44(21):195-198.
作者姓名:邱桃荣  葛寒娟  魏玲玲  徐苏  姚晓昆
作者单位:南昌大学 计算机系,南昌 330031
基金项目:江西省科技厅科技攻关项目 , 江西省教育厅科研项目
摘    要:基于数据库理论和粗集方法研究了粗关系数据库中不确定数据的存储、索引和检索。提出了分别采用邻接表和十字链表实现粗关系数据库中属性值等价类和元组数据的存储;借助汉明距离和聚类方法,提出了实现粗关系数据库索引的方法;提出一种基于Rough集中的上、下近似计算数据间的相似度,并基于相似度给出了对粗关系数据库进行查询的模型,设计了相应的查询算法。最后,通过一个具体实例说明了查询算法的可行性和有效性。

关 键 词:粗糙集  粗关系数据库  查询模型  
收稿时间:2008-4-30
修稿时间:2008-5-27  

Approximate query based on similarity degree in rough relation ratabases
QIU Tao-rong,GE Han-juan,WEI Ling-ling,XU Su,YAO Xiao-kun.Approximate query based on similarity degree in rough relation ratabases[J].Computer Engineering and Applications,2008,44(21):195-198.
Authors:QIU Tao-rong  GE Han-juan  WEI Ling-ling  XU Su  YAO Xiao-kun
Affiliation:Department of Computer,Nanchang University,Nancahng 330031,China
Abstract:In this paper,the storage,index and search of uncertain data in a rough relational database(RRDB) are studied by combining database theory and rough sets.First,two storing techniques are proposed.One is to store equivalence classes with regard to the values of attributes by using an adjacency list.The other is to store records of RRDB by using an orthogonal list.Secondly,based on Hamming distance and the given clustering method,one way to index uncertain data in RRDB is put forward.Thirdly,an approach to calculating the similarity 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 is presented.Fourthly,a querying model of RRDB is constructed and an algorithm for querying uncertain data in RRDB is presented.Finally,a real world example is illustrated and results shows that the proposed algorithm is useful and effective.
Keywords:rough sets  rough relational database  query model
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号