Abstract
Many methods have been used to express the relationships between different pieces of data. In the beginning, all relationships were assumed to be rigid and precise. Objects were either in a set or they were not. All data followed a rule or was incorrect. Traditional database systems are well-suited for storing knowledge explicitly and for deducing definite information from the stored knowledge through explicitly defined rules.
Research partly supported by a fellowship from the Pew Foundation and a grant from Pikeville College
Research partly supported by NSF Grant CCR-9110721
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
Biskup J. A formal approach to null values in database relations. In: Minker J, Nicholas JM (eds) Advances in database theory: vol 1. Plenum, New. York, 1981, pp 299–341
Codd EF. Extending the database relational model to capture more meaning. ACM Trans on Database Systems 1979; 4 (4): 394–434
Date CJ. An introduction to database systems. Addison-Wesley, Reading, Mass, 1986
Grant J. Null values in a relational database. Information Processing Letters 1977; 6 (5) 101
Grant J, Minker J. Inferences for numerical dependencies. Theoretical Computer Science 1985; 41: 271–287
Imielinski T, Lipski W. Incomplete information in relational databases. J ACM 1984; 31 (4): 761–791
Keen D, Rajasekar A. Inductive dependencies and approximate databases. In: First Intl Conference on Information and Knowledge Management. International Society for Computers and their Applications, 1992
Krynicki M. A note on rough concepts logic. Fundamenta Informaticae 1990; 13: 227–235
Marek W, Pawlak Z. Information storage and retrieval systems: mathematical foundations. Theoretical Computer Science 1976; 1: 331–354
Marek W, Pawlak Z. Rough sets and information systems. Technical Report 441, Polish Academy of Science, 1981
Marek W, Pawlak Z. Rough sets and information systems. Fundamenta Informaticae 1984; 1: 105–115
Mrozek A. Rough Sets and dependency analysis among attributes in computer implementations of expert’s inference models. Intl Journal of Man-Machine Studies 1989; 30: 457–473
Novotny M, Pawlak Z. Algebraic theory of independence in information systems. Fundamenta Informaticae 1991; XIV: 454–476, 1991
Pawlak Z. Information systems theoretical foundations. Information Systems 1981; 6 (3): 205–218
Pawlak Z. Rough sets. Intl Journal of Computer and Information Sciences 1982; 11 (5): 341–356
Reiter R. On closed world data bases. In: Gallaire H, Minker J (eds) Logic and Data Bases, Plenum Press, New York, 1978; 55–76
Ullman JD. Principles of database and knowledge-base systems. Computer Science Press, Rockville, MD, 1988
Vakarelov D. A modal logic for similarity relations in Pawlak knowledge representation systems. Fundamenta Informaticae 1991; XV: 61–79
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 British Computer Society
About this paper
Cite this paper
Keen, D., Rajasekar, A. (1994). Rough Sets and Data Dependencies. In: Alagar, V.S., Bergler, S., Dong, F.Q. (eds) Incompleteness and Uncertainty in Information Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3242-4_7
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3242-4_7
Publisher Name: Springer, London
Print ISBN: 978-3-540-19897-0
Online ISBN: 978-1-4471-3242-4
eBook Packages: Springer Book Archive