PDQ: Proof-driven Query Answering over Web-based Data
Summary: PDQ plans queries over overlapping Web APIs by proving answerability, while respecting access constraints and exploiting constraint-based rewrites. It combines proof-driven plan generation with service costs to produce cheaper executable query plans. (summarized by gpt-5.6-luna on Jul 21 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael Benedikt (University of Oxford)
- 2. Julien Leblay (University of Oxford)
- 3. Efthymia Tsamoura (University of Oxford)
BibTeX Citation
@article{benedikt_vldb14,
title = {{PDQ: Proof-driven Query Answering over Web-based Data}},
author = {Benedikt, Michael and Leblay, Julien and Tsamoura, Efthymia},
journal = {PVLDB},
series = {{VLDB} '14},
volume = {7},
number = {13},
pages = {1553--1556},
doi = {10.14778/2733004.2733017},
url = {https://doi.org/10.14778/2733004.2733017},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,674 | Benchmarking the Chase | 2017 | PODS | 8.1480823e-05 |
| 3,000 | Querying with Access Patterns and Integrity Constraints | 2015 | VLDB | 7.7669839e-05 |
| 7,991 | When Can We Answer Queries Using Result-Bounded Data Interfaces? | 2018 | PODS | 5.4115836e-05 |
| 9,704 | Exploiting the Power of Equality-generating Dependencies in Ontological Reasoning | 2022 | VLDB | 5.1378347e-05 |
| 10,034 | Materializing Knowledge Bases via Trigger Graphs | 2021 | VLDB | 5.0925155e-05 |
| 11,477 | Chase Termination Beyond Polynomial Time | 2024 | PODS | 4.9793485e-05 |
| 12,201 | How Can Reasoners Simplify Database Querying (And Why Haven’t They Done It Yet)? | 2018 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 869 | Query Optimization in the Presence of Limited Access Patterns | 1999 | SIGMOD | 0.00013348278 |
| 2,616 | Query Optimization over Web Services | 2006 | VLDB | 8.2253465e-05 |
| 5,426 | Active Knowledge: Dynamically Enriching RDF Knowledge Bases by Web Services | 2010 | SIGMOD | 6.1342038e-05 |
| 7,714 | Generating Low-cost Plans From Proofs | 2014 | PODS | 5.4702268e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,646 | Optimizing Query Answering under Ontological Constraints | 2011 | VLDB |
| 2 | 9,097 | Efficient Query Answering in Probabilistic RDF Graphs | 2011 | SIGMOD |
| 3 | 51 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |
| 4 | 5,911 | On Efficient Approximate Queries over Machine Learning Models | 2023 | VLDB |
| 5 | 12,145 | Query-Driven Learning for Next Generation Predictive Modeling & Analytics | 2019 | SIGMOD |
| 6 | 7,714 | Generating Low-cost Plans From Proofs | 2014 | PODS |
| 7 | 1,551 | Multiple Query Processing in Deductive Databases using Query Graphs | 1986 | VLDB |
| 8 | 3,000 | Querying with Access Patterns and Integrity Constraints | 2015 | VLDB |
| 9 | 5,909 | Query Processing over Incomplete Autonomous Databases | 2007 | VLDB |
| 10 | 13,366 | Learning Efficient Query Processing Strategies | 1992 | PODS |