摘要
根据粗关系数据库中数据的特性,借助邻接表、十字链表存储不确定性数据,其中邻接表用于等价类的存储,十字链表用于数据库中基本表的存储。与传统的关系数据库更新不同,在粗关系数据库中更新基本表时,相应地等价类也要随之更新,该存储结构加快了对数据库中的数据更新速度。将算法与实例相结合,根据用户条件详细地讨论对等价类和RRDB中基本表的数据更新。
According to the data characteristic of the rough relational database, this paper solves the problem of uncertainty data storage with adjacency list and orthogonal list, and the adjacency list is for the equivalence classes storage and the orthogonal list for the basic table storage. The data updating of RRDB is different from the relational database, in which the equivalence class updates according to the basic table. This kind of storage structure can update the data quickly. In order to further discuss this problem, an algorithm lot updating the data in RRDB is proposed and illustrated by using soil analysis example.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第4期113-115,共3页
Computer Engineering
基金
江西省科技基金资助重点项目(20061B01002)
关键词
粗关系数据库
数据更新
等价类
邻接表
十字链表
rough relational database
data updating
equivalence class
adjacency list
orthogonal list
