Querying Data from RRDB Based on Rough Sets Theory
Based on RRDM(Rough Relational Database Model), the querying theory of RRDB(Rough Relational Database) is analyzed from decomposition principle, projection principle and the definability of RRDB. We divide rough data querying into three types: crisp querying, rough complete querying and rough combinatorial querying. In addition, we discuss the rough data querying from the three aspects and do some computational simulation to obtain the results that are good agreement with the conclusion in this paper.
KeywordsComputational Simulation Query Data Attribute Subset Decomposition Principle Decomposition Operator
Unable to display preview. Download preview PDF.