Optimization of a subclass of conjunctive queries

DOI10.1007/BF01185403zbMath0815.68048MaRDI QIDQ1346219

Pratul Dublish, Joachim Biskup, Yehoshua Sagiv

Publication date: 22 March 1995

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

query optimizationimplication graph techniqueotimization problem

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Conjunctive query containment revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing containment of conjunctive queries under functional and inclusion dependencies
• Ordering conjunctive queries
• An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon
• Optimizing Conjunctive Queries that Contain Untyped Variables
• Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions
• On conjunctive queries containing inequalities
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Power of Natural Semijoins
• Equivalences among Relational Expressions