Characterization of desirable properties of general database decompositions.

DOI10.1007/BF01556353zbMath1034.68515MaRDI QIDQ1353960

Stephen J. Hegner

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

desirabilityquery evaluation algorithms

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

The complexity of embedded axiomatization for a class of closed database views ⋮ Lossless Decompositions in Complex-Valued Databases

Uses Software

• Datalog

Cites Work

• Inclusion dependencies and their interaction with functional dependencies
• The interaction of integrity constraints in an information system
• Unique complements and decompositions of database schemata
• Theory of equivalence relations
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• A note on subdirect products
• Update semantics of relational views
• On interpretations of relational languages and solutions to the implied constraint problem
• On the Complexity of Testing Implications of Functional and Join Dependencies
• Template Dependencies
• A simplied universal relation assumption and its properties
• Horn clauses and database dependencies
• On the family of generalized dependency constraints
• Note on a subdirect representation of universal algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterization of desirable properties of general database decompositions.