An Algorithm to Extend An Existing Function for Query Optimization in Rough Dataset
Uncertainty and incompleteness of knowledge is a challenging task in information technology. Rough set theory due to its versatility can be applied to handle this challenge. Here, rouge set theory is used for designing and querying Rough Relational DataBase (RRDB). Unlike traditional RDB, RRDB can contain multi-valued attributes and has an indiscernibility relation in its domain. Currently, the research on rough data querying, mainly is discussed some simple select-querying, i.e., selecting the tuples whose attribute's value is equal to a constant from a single table.