Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers (Q1823739): Difference between revisions

By use of split-freedom and multivalued dependencies (MVDs) a characterization of sets of (MVDs) having conflict-free cover is developed. Two stages of this characterization - notion of split free sets and notion of intersection are used. Based on this characterization the polynomial-time algorithms of testing conflict free covers is developed.

0 references

zbMATH Keywords

multivalued dependencies

0 references

database schemes

0 references

conflict-free cover

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0304-3975(86)90013-7

0 references

cites work

On the menbership problem for functional and multivalued dependencies in relational databases

0 references

On the Desirability of Acyclic Database Schemes

0 references

Q3912018

0 references

A simplied universal relation assumption and its properties

0 references

An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database

0 references

Syntactic Characterization of Tree Database Schemas

0 references

A characterization of multivalued dependencies equivalent to a join dependency

0 references

On equivalence of relational and network database models

0 references

On the Equivalence of Database Models

0 references

Q3668890

0 references

An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic

0 references

Q3206351

0 references

Identifiers

zbMATH Open document ID

0681.68123

0 references

DOI

10.1016/0304-3975(86)90013-7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1823739

@@ Property / cites work @@
+On the menbership problem for functional and multivalued dependencies in relational databases
+Normal rank
@@ Property / cites work @@
+On the Desirability of Acyclic Database Schemes
@@ Property / cites work: On the Desirability of Acyclic Database Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3912018
@@ Property / cites work: Q3912018 / rank @@
+Normal rank
@@ Property / cites work @@
+A simplied universal relation assumption and its properties
+Normal rank
@@ Property / cites work @@
+An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
+Normal rank
@@ Property / cites work @@
+Syntactic Characterization of Tree Database Schemas
+Normal rank
@@ Property / cites work @@
+A characterization of multivalued dependencies equivalent to a join dependency
+Normal rank
@@ Property / cites work @@
+On equivalence of relational and network database models
+Normal rank
@@ Property / cites work @@
+On the Equivalence of Database Models
@@ Property / cites work: On the Equivalence of Database Models / rank @@
+Normal rank
@@ Property / cites work @@
+Q3668890
@@ Property / cites work: Q3668890 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
+Normal rank
@@ Property / cites work @@
+Q3206351
@@ Property / cites work: Q3206351 / rank @@
+Normal rank