Database interrogation using conjunctive queries

DOI10.1007/3-540-36285-1_17MaRDI QIDQ4414539zbMATH OpenFDO

Authors Michał Bielecki, Jan Van den Bussche

Publication date 25 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2572/25720259.htm

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• On the containment of conjunctive queries
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 1735629
• Tractable counting of the answers to conjunctive queries
• Efficient Approximations of Conjunctive Queries

Cited in

(5)

• Ordering conjunctive queries
• Regularizing conjunctive features for classification
• Tractable counting of the answers to conjunctive queries
• scientific article; zbMATH DE number 2020203 (Why is no real title available?)
• When do homomorphism counts help in query algorithms?

This page was built for publication: Database interrogation using conjunctive queries

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