The Impact of Virtual Views on Containment
Summary: Containment and equivalence for queries built from unions of conjunctive queries with iterative view definitions (non-recursive Datalog) under virtual views. Shows co-NEXPTIME-completeness, persists under schema/query restrictions, and isolates tractable subcases from NP to PSPACE. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael Benedikt (University of Oxford)
- 2. Georg Gottlob (University of Oxford)
BibTeX Citation
@article{benedikt_vldb10,
title = {{The Impact of Virtual Views on Containment}},
author = {Benedikt, Michael and Gottlob, Georg},
journal = {PVLDB},
series = {{VLDB} '10},
volume = {3},
number = {1},
pages = {297--308},
doi = {10.14778/1920841.1920882},
url = {https://doi.org/10.14778/1920841.1920882},
year = {2010}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,747 | High-Level Why-Not Explanations using Ontologies | 2015 | PODS | 6.5252099e-05 |
| 9,430 | A Theory of Regular Queries | 2016 | PODS | 5.2704983e-05 |
| 11,893 | Containment for Rule-Based Ontology-Mediated Queries | 2018 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 686 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00014948634 |
| 853 | Queries Independent of Updates | 1993 | VLDB | 0.00013587101 |
| 1,269 | The Containment Problem for Real Conjunctive Queries with Inequalities | 2006 | PODS | 0.000113935 |
| 1,489 | Constraint Checking with Partial Information | 1994 | PODS | 0.00010612225 |
| 3,245 | On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs | 1994 | PODS | 7.60327e-05 |
| 4,445 | View-Based Query Containment | 2003 | PODS | 6.699172e-05 |
| 6,661 | Complexity of Nonrecursive Logic Programs with Complex Values | 1998 | PODS | 5.8101181e-05 |
| 6,926 | On the Decidability of Containment of Recursive Datalog Queries - Preliminary report | 2004 | PODS | 5.7382018e-05 |
| 7,654 | Positive Higher-Order Queries | 2010 | PODS | 5.5746273e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,630 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 2 | 515 | Answering Recursive Queries Using Views | 1997 | PODS |
| 3 | 7,121 | Query Evaluation using Overlapping Views: Completeness and Efficiency | 2006 | SIGMOD |
| 4 | 12,029 | Bounded Query Rewriting Using Views | 2016 | PODS |
| 5 | 12,165 | Does Query Evaluation Tractability Help Query Containment? | 2014 | PODS |
| 6 | 225 | Complexity of Answering Queries Using Materialized Views | 1998 | PODS |
| 7 | 3,039 | Query Containment for Data Integration Systems | 2000 | PODS |
| 8 | 916 | A Time Bound on the Materialization of Some Recursively Defined Views | 1985 | VLDB |
| 9 | 69 | Answering Queries Using Views (Extended Abstract) | 1995 | PODS |
| 10 | 4,445 | View-Based Query Containment | 2003 | PODS |