Testing satisfiability of a class of object-oriented conjunctive queries

DOI10.1016/0304-3975(94)00015-8MaRDI QIDQ1341716zbMATH OpenOpenAlexFDO

Authors Edward P. F. Chan

Publication date 15 June 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)00015-8

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Database theory (68P15)

Recommendations

• Optimization of a subclass of conjunctive queries
• scientific article; zbMATH DE number 219223
• scientific article; zbMATH DE number 1951561
• Conjunctive query containment over trees using schema information
• Containment and Optimization of Object-Preserving Conjunctive Queries

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Equivalences among Relational Expressions
• Logical foundations of object-oriented and frame-based languages

Cited in

(4)

• Testing containment of object-oriented conjunctive queries is ∏2p-hard
• Testing bag-containment of conjunctive queries
• On the satisfiability problem for SPARQL patterns
• Property testers for dense constraint satisfaction programs on finite domains

This page was built for publication: Testing satisfiability of a class of object-oriented conjunctive queries

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