Querying data sources that export infinite sets of views

DOI10.1007/s00224-010-9293-4zbMath1263.68048OpenAlexW1989045705MaRDI QIDQ639847

Nicola Onose, Alin Deutsch, Bogdan Cautis

Publication date: 11 October 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.9230

zbMATH Keywords

expressibilitysupportintegrity constraintsconjunctive queriesDATALOGquering data sources

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Reasoning about XML update constraints ⋮ The complexity of higher-order queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantic query optimization in the presence of types
• Rewriting queries using views in the presence of arithmetic comparisons
• Answering queries using limited external query processors
• Undecidable optimization problems for database logic programs
• Expressive capabilities description languages and query rewriting algorithms
• Database Theory - ICDT 2005

This page was built for publication: Querying data sources that export infinite sets of views