Algebraic dependencies

DOI10.1016/0022-0000(82)90008-3zbMath0493.68095OpenAlexW4212851315WikidataQ114685269 ScholiaQ114685269MaRDI QIDQ1168760

Mihalis Yannakakis, Christos H. Papadimitriou

Publication date: 1982

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(82)90008-3

zbMATH Keywords

NP-completedata dependenciesalgebraic rewriting rules

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (13)

Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Inferences for numerical dependencies ⋮ A finite axiomatization of conditional independence and inclusion dependencies ⋮ Finite approximatization of languages for representation of system properties: Axiomatization of dependencies ⋮ A first step towards implementing dynamic algebraic dependences ⋮ On characterizing boundedness of database schemes with bounded dependencies ⋮ Partition semantics for relations ⋮ Verification of knowledge bases based on containment checking ⋮ Automatic generation of test data for relational queries ⋮ A theory of data dependencies over relational expressions ⋮ Some results on the deductive structure of join dependencies ⋮ Inclusion dependencies and their interaction with functional dependencies ⋮ The implication and finite implication problems for typed template dependencies

Cites Work

• Unnamed Item
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• A Complete Axiomatization of Full Join Dependencies
• Equivalences among Relational Expressions
• A relational model of data for large shared data banks

This page was built for publication: Algebraic dependencies