An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
On the menbership problem for functional and multivalued dependencies in relational databases
ACM Transactions on Database Systems (TODS)
On Axiomatizing Multivalued Dependencies in Relational Databases
Journal of the ACM (JACM)
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
On the Complexity of Testing Implications of Functional and Join Dependencies
Journal of the ACM (JACM)
An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
Journal of the ACM (JACM)
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
Journal of the ACM (JACM)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
Constructing the Dependency Structure of a Multiagent Probabilistic Network
IEEE Transactions on Knowledge and Data Engineering
Fast In-Place Verification of Data Dependencies
IEEE Transactions on Knowledge and Data Engineering
Utilizing first-order logic in query processing
CSC '84 Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium
Multi-valued dependencies in the presence of lists
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Functional and multivalued dependencies in nested databases generated by record and list constructor
Annals of Mathematics and Artificial Intelligence
Horn clauses and functional dependencies in complex-value databases
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Impacts of logic and databases (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
An Equivalence between Dependencies in Nested Databases and a Fragment of Propositional Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
An Equivalence between Dependencies in Nested Databases and a Fragment of Propositional Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Appropriate reasoning about data dependencies in fixed and undetermined universes
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
When data dependencies over SQL tables meet the logics of paradox and S-3
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On multivalued dependencies in fixed and undetermined universes
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Characterisations of multivalued dependency implication over undetermined universes
Journal of Computer and System Sciences
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
ACM Transactions on Database Systems (TODS)
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
| Hi-index | 0.00 |
An algorithm is given for deciding whether a functional or a multivalued dependency &sgr; (with a right-hand side Y) is implied by a set of functional and multivalued dependencies &Sgr;. The running time of the algorithm is O(| Y |‖&Sgr;‖), where Y is the number of attributes in Y and ‖&Sgr;‖ is the size of the description of &Sgr;. The problem of constructing the dependency basis of a set of attributes X is also investigated. It is shown that the dependency basis can be found in O(S‖&Sgr;‖) time, where S is the number of sets in the dependency basis. Since functional and multivalued dependencies correspond to a subclass of propositional logic (that can be viewed as a generalization of Horn clauses), the algorithm given is also an efficient inference procedure for this subclass of propositional logic.