Incorporating cardinality constraints and synonym rules into conditional functional dependencies

DOI10.1016/j.ipl.2009.03.021zbMath1211.68149OpenAlexW2139484086WikidataQ57495465 ScholiaQ57495465MaRDI QIDQ989485

Wenguang Chen, Shuai Ma, Wenfei Fan

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17653348/Chen_Fan_ET_AL_2009_Incorporating_Cardniality_Constraints_and_Synonym_Rules_into_Conditional_Functional_Dependencies.pdf

zbMATH Keywords

computational complexityspecification languagesdatabases

Mathematics Subject Classification ID

Database theory (68P15) Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Extending inclusion dependencies with conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computational complexity of cardinality constraints in relational databases
• Constrained dependencies
• Scalar aggregation in inconsistent databases.
• Constraint-generating dependencies
• Normalization and axiomatization for numerical dependencies
• Answer sets for consistent query answering in inconsistent databases

This page was built for publication: Incorporating cardinality constraints and synonym rules into conditional functional dependencies