Name
Abstract | ||
|---|---|---|
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It is shown that these equivalences are still valid for the databases that store complex data elements obtained from the recursive nesting of record, list, set and multiset constructors. The major proof argument utilises properties of Brouwerian algebras. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.apal.2007.11.004 | Annals of Pure and Applied Logic |
Keywords | Field | DocType |
68P15 | Boolean function,Discrete mathematics,Relational database,Zeroth-order logic,Database design,Boolean algebra,Database theory,Dependency theory (database theory),Database,Propositional variable,Mathematics | Journal |
Volume | Issue | ISSN |
152 | 1 | 0168-0072 |
Citations | PageRank | References |
26 | 0.70 | 23 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sven Hartmann | 1 | 205 | 10.45 |
| Sebastian Link | 2 | 462 | 39.59 |