Introduction to “feature analysis of generalized data base management systems”
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Switching Circuits for Engineers
Switching Circuits for Engineers
Description of a set-theoretic data structure
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
On Interactions of Cardinality Constraints, Key, and Functional Dependencies
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
Disjoint essential sets of implicates of a CQ Horn function
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
The notion of a functional relation among the attributes of a data set can be fruitfully applied in the structuring of an information system. These relations are meaningful both to the user of the system in his semantic understanding of the data, and to the designer in implementing the system. An important equivalence between operations with functional relations and operations with analogous Boolean functions is demonstrated in this paper. The equivalence is computationally helpful in exploring the properties of a given set of functional relations, as well as in the task of partitioning a data set into subfiles for efficient implementation.