Determining Relevance of Accesses at Runtime
Summary: Defines runtime notions of immediate and long-term relevance of access methods for answering queries over binding-restricted Web sources, shifting focus from static plans to dynamic decision-making. Characterizes complexity for conjunctive and positive queries and ties relevance to query containment under access limitations, producing new containment complexity results. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Michael Benedikt (University of Oxford)
- 2. Georg Gottlob (Oxford Man Institute; University of Oxford)
- 3. Pierre Senellart (CNRS; Institut Mines-Telecom; Télécom Paris)
BibTeX Citation
@inproceedings{benedikt_pods11,
address = {New York, NY, USA},
series = {{PODS} '11},
title = {{Determining Relevance of Accesses at Runtime}},
url = {https://dl.acm.org/doi/10.1145/1989284.1989309},
doi = {10.1145/1989284.1989309},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Benedikt, Michael and Gottlob, Georg and Senellart, Pierre},
year = {2011}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,642 | Querying Schemas With Access Restrictions | 2012 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 301 | Answering Queries Using Templates With Binding Patterns (Extended Abstract) | 1995 | PODS | 0.00021682744 |
| 699 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00014686953 |
| 2,790 | Processing First-Order Queries under Limited Access Patterns | 2004 | PODS | 8.0100392e-05 |
| 3,315 | On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs | 1994 | PODS | 7.4376793e-05 |
| 5,426 | Active Knowledge: Dynamically Enriching RDF Knowledge Bases by Web Services | 2010 | SIGMOD | 6.1342038e-05 |
| 8,714 | Satisfiability and Relevance for Queries over Active Documents | 2009 | PODS | 5.2905577e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,954 | Querying Big Data by Accessing Small Data | 2015 | PODS |
| 2 | 4,452 | Bounded Conjunctive Queries | 2014 | VLDB |
| 3 | 301 | Answering Queries Using Templates With Binding Patterns (Extended Abstract) | 1995 | PODS |
| 4 | 9,152 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD |
| 5 | 869 | Query Optimization in the Presence of Limited Access Patterns | 1999 | SIGMOD |
| 6 | 3,000 | Querying with Access Patterns and Integrity Constraints | 2015 | VLDB |
| 7 | 8,714 | Satisfiability and Relevance for Queries over Active Documents | 2009 | PODS |
| 8 | 7,991 | When Can We Answer Queries Using Result-Bounded Data Interfaces? | 2018 | PODS |
| 9 | 3,095 | Query Containment for Data Integration Systems | 2000 | PODS |
| 10 | 12,642 | Querying Schemas With Access Restrictions | 2012 | VLDB |