scientific article; zbMATH DE number 3464830

Cited in

(36)

Implementing imprecision in information systems
Characterizations for functional dependency and Boyce-Codd normal form families
On the size of nonredundant FD-covers
Non-transitive fuzzy dependencies. I
A theory of well-connected relations
Computable queries for relational data bases
On covering Boyce-Codd normal forms
The complexity of recognizing 3NF relation schemes
Inclusion and equivalence between relational database schemata
Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in O(N^ 2) time
On the complexity of finding the set of candidate keys for a given set of functional dependencies
QT logic: Simpler and more expressive than predicate calculus
The concept of a linguistic variable and its application to approximate reasoning. I
The concept of a linguistic variable and its application to approximate reasoning. II
The concept of a linguistic variable and its application to approximate reasoning. III
Testing for existence of a covering Boyce-Codd normal form
Equivalence of keyed relational schemas by conjunctive queries
A note on relation schemes which are in 3NF but not in BCNF
The theory of functional and subset dependencies over relational expressions
Structure and complexity of relational queries
Insertion anomalies and the justification for 4NF in relational databases
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
Implication and axiomatization of functional and constant constraints
BCNF via attribute splitting
Graphical normal forms based on root dependencies in relational data base systems
Theta-join and normalization
On storing arbitrarily many extendible arrays of arbitrary dimensions
Propositional team logics
Lossless Decompositions in Complex-Valued Databases
Design by example: An application of Armstrong relations
A temporal relational model and a query language
Armstrong axioms and Boyce-Codd-Heath normal form under bag semantics
Some results on the deductive structure of join dependencies
Flexible querying in a relational framework supported by possibilistic logic
Deciding implication for functional dependencies in complex-value databases
On database query languages for K-relations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4050126)