Determinacy and query rewriting for conjunctive queries and views

DOI10.1016/j.tcs.2010.12.031zbMath1217.68072OpenAlexW1999377429MaRDI QIDQ631757

Foto N. Afrati

Publication date: 14 March 2011

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.031

zbMATH Keywords

first-order logicdeterminacyquery answeringconjunctive queriesviewsquery rewritingchain queriespath queries

Mathematics Subject Classification ID

Database theory (68P15) Grammars and rewriting systems (68Q42)

Related Items (4)

On Monotonic Determinacy and Rewritability for Recursive Queries and Views ⋮ Asymptotic determinacy of path queries using union-of-paths views ⋮ Unnamed Item ⋮ Determinacy and rewriting of functional top-down and MSO tree transformations

Uses Software

• XPath
• CoreCover

Cites Work

• Unnamed Item
• Rewriting of regular expressions and regular path queries
• Rewriting queries using views in the presence of arithmetic comparisons
• Using views to generate efficient evaluation plans for queries
• On the content of materialized aggregate views
• Information integration using logical views
• Conjunctive query containment revisited
• Rewriting Conjunctive Queries Determined by Views
• Designing data warehouses
• Database Theory - ICDT 2005
• Answering queries using views: A survey

This page was built for publication: Determinacy and query rewriting for conjunctive queries and views