Rewriting queries using views in the presence of arithmetic comparisons

DOI10.1016/J.TCS.2006.08.020zbMath1171.68446OpenAlexW2042077278MaRDI QIDQ859842

N. E. Zubov

Publication date: 22 January 2007

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

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

zbMATH Keywords

query languagesdatabasesquery rewriting

Mathematics Subject Classification ID

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

Related Items (3)

On the complexity of tree pattern containment with arithmetic comparisons ⋮ Determinacy and query rewriting for conjunctive queries and views ⋮ Querying data sources that export infinite sets of views

Cites Work

• Unnamed Item
• The complexity of querying indefinite data about linearly ordered domains
• Some results on the containment and minimization of (in)equality queries
• Information integration using logical views
• Conjunctive query containment revisited
• MiniCon: a scalable algorithm for answering queries using views
• On conjunctive queries containing inequalities

This page was built for publication: Rewriting queries using views in the presence of arithmetic comparisons