Equivalence of keyed relational schemas by conjunctive queries

DOI10.1006/jcss.1999.1628zbMath0941.68039OpenAlexW2035020007MaRDI QIDQ1307695

Raghu Ramakrishnan, Joseph Albert, Yannis E. Ioannidis

Publication date: 8 February 2000

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

Full work available at URL: https://semanticscholar.org/paper/67225b55a4fbd58eab4a013c808b7d0007adc01c

zbMATH Keywords

query equivalencecalculus equivalence

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Equivalence of keyed relational schemas by conjunctive queries

Cites Work

• Unnamed Item
• Unnamed Item
• Adequacy of decompositions of relational databases
• Inclusion and equivalence between relational database schemata
• Equivalence of keyed relational schemas by conjunctive queries
• Relative Information Capacity of Simple Relational Database Schemata
• An improved third normal form for relational databases
• Equivalence of Relational Database Schemes
• A new normal form for the design of relational database schemata
• A relational model of data for large shared data banks

This page was built for publication: Equivalence of keyed relational schemas by conjunctive queries