Minimizing restricted-fanout queries

DOI10.1016/0166-218X(92)90032-6zbMath0767.68035OpenAlexW2013136702MaRDI QIDQ1202893

Yehoshua Sagiv, Yatin P. Saraiya

Publication date: 31 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90032-6

zbMATH Keywords

conjunctive queriesfanout-free queriesminimum equivalent

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Related Items (1)

Combined-semantics equivalence of conjunctive queries: decidability and tractability results

Cites Work

• Unnamed Item
• Unnamed Item
• Optimizing Conjunctive Queries that Contain Untyped Variables
• Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Equivalences among Relational Expressions

This page was built for publication: Minimizing restricted-fanout queries