Abstract
In this paper, some important theoretical problems about rough relational database(RRDM) are studied. Firstly, the relationship between rough relational database and non-deterministic information systems is analyzed, secondly, the decomposition operator is introduced based on rough relational operator and its basic properties are discussed. In addition, the definability of rough relational database and the rough description of attribute values of rough relational database are investigated respectively. The redundant factor of rough functional dependency is proposed, as well as rough functional dependency and its inference rules are mainly studied.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beaubouef, T., Petry, F.E., Buckles, B.P.: Extension of the relational database and its algebra with rough set techniques. Computational Intelligence 11(2), 233–245 (1995)
Beaubouef, T.: Uncertainty processing in a relational database model via a rough set representation. University Microfilms International. A Bell & Howell Information Company. Doctor dissertation, pp. 67–76 (1994)
Beaubouef, T., Petry, F.E., Arora, G.: Information-theoretic measures of uncertainty measures of rough sets of uncertainty for rough sets and rough relational databases. Information Sciences 109(1-4), 185–195 (1998)
Beaubouef, T., Petry, F.: Rough Querying of Crisp Data in Relational Databases. In: Proc. Third Int. Workshop on Rough Sets and Soft Computing (RSSC’94), San Jose, November 1994, pp. 368–375 (1994)
Beaubouef, T., Petry, F.: Rough Functional Dependencies. In: 2004 Multiconferences: Int. Conf. on Information and Knowledge Engineering (IKE’04), Las Vegas, June 21-24, 2004, pp. 175–179 (2004)
Ladner, R., Beaubouef, T., Petry, F.E.: Normalization in a Rough Relational Database. In: Ślęzak, D., et al. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 275–282. Springer, Heidelberg (2005)
Sakai, H., Okuma, A.: Basic Algorithms and Tools for Rough Non-deterministic Information Analysis. In: Peters, J.F., et al. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 209–231. Springer, Heidelberg (2004)
An, Q., et al.: Rough Relational Database Model and its Relational Operations. Computer Science (China) 29(7), 72–74 (2002)
Lin, T.Y., Louie, E.: Data Mining Using Granular Computing: Fast Algorithms for Finding Association Rules. In: Lin, T.Y., Yao, Y.Y., Zadeh, L.A. (eds.) Data Mining, Rough Sets and Granular Computing. Studies in Fuzziness and Soft Computing, vol. 95, pp. 22–42. Physica, Heidelberg (2003)
An, Q., et al.: Querying data from RRDM based on Rough Sets Theory. In: Wang, G., et al. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 342–345. Springer, Heidelberg (2003)
An, Q., et al.: Rough Functional Dependency and Its Inference Rules. Mini-Micro Systems 25(4), 638–641 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
An, Q. (2007). The Study of Some Important Theoretical Problems for Rough Relational Database. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2007. Lecture Notes in Computer Science(), vol 4482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72530-5_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-72530-5_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72529-9
Online ISBN: 978-3-540-72530-5
eBook Packages: Computer ScienceComputer Science (R0)