Partition semantics for relations

DOI10.1016/0022-0000(86)90019-XMaRDI QIDQ579957zbMATH OpenOpenAlexFDO

Authors Paris C. Kanellakis, Stavros S. Cosmandakis

Publication date 1986

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(86)90019-x

zbMATH Keywords

implication problemconnectivityundirected graphsfunctional dependenciespolynomial time algorithmrelational databasepartition semanticsfunctional determinationpartition dependenciesset-theoretic partitionsuniform word problem for lattices

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Free lattices, projective lattices, word problems (06B25)

Recommendations

• scientific article; zbMATH DE number 554492
• An Algebraic Theory of Relational Databases
• Weakly independent database schemes
• Constrained dependencies
• scientific article; zbMATH DE number 817193

Cites work

• scientific article; zbMATH DE number 3646330 (Why is no real title available?)
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 3777562 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3290336 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A Proof Procedure for Data Dependencies
• Algebraic Structures with Hard Equivalence and Minimization Problems
• Algebraic dependencies
• Component Subsets of the Free Lattice on n Generators
• Every finite lattice can be embedded in a finite partition lattice
• Formal Systems for Tuple and Equality Generating Dependencies
• Free lattices
• Horn clauses and database dependencies
• Inclusion dependencies and their interaction with functional dependencies
• Lattices, equivalence relations, and subgroups
• On the Computational Complexity of Algebra on Lattices
• Template Dependencies
• Testing satisfaction of functional dependencies
• The Word Problem for Abstract Algebras
• The decision problem for some classes of sentences without quantifiers
• Word problems

Cited in

(13)

• Logic and linguistics meeting, Stanford, 1987
• Functional and approximate dependency mining: database and FCA points of view
• A NEW RELATIONAL (DOMAIN-CALCULUS TYPE) QUERY LANGUAGE BASED ON THE PARTITION MODEL
• scientific article; zbMATH DE number 3922023 (Why is no real title available?)
• On the orthographic dimension of definable sets
• A new interpretation for null values in the weak instance model
• Containment and disjointedness in partitioned normal form relations
• Partition relations on a plain product order type
• Partition Relations and Transitivity Domains of Binary Relations
• Reducing one class of machine learning algorithms to logical operations of plausible reasoning
• Dependencies and generalized relations
• scientific article; zbMATH DE number 817193 (Why is no real title available?)
• Partitioned binary relations

This page was built for publication: Partition semantics for relations

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