Querying Schemas With Access Restrictions
Summary: Proposes AccLTL, a first-order–temporal logic for access-based transitions on relational data; pairs with A-automata for compilation. Shows decidability and complexity bounds for restricted AccLTL, enabling analysis of access relevance and query equivalence. (summarized by gpt-5-nano 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. Pierre Bourhis (University of Oxford)
- 3. Clemens Ley (EPFL)
BibTeX Citation
@article{benedikt_vldb12,
title = {{Querying Schemas With Access Restrictions}},
author = {Benedikt, Michael and Bourhis, Pierre and Ley, Clemens},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {7},
pages = {634--645},
doi = {10.14778/2180912.2180916},
url = {https://doi.org/10.14778/2180912.2180916},
year = {2012}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 298 | Answering Queries Using Templates With Binding Patterns (Extended Abstract) | 1995 | PODS | 0.00022138018 |
| 1,159 | Relational Transducers for Electronic Commerce | 1998 | PODS | 0.00011898742 |
| 2,733 | Processing First-Order Queries under Limited Access Patterns | 2004 | PODS | 8.1927747e-05 |
| 12,364 | Determining Relevance of Accesses at Runtime | 2011 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,749 | Optimal Security-Aware Query Processing | 2014 | VLDB |
| 2 | 5,959 | Recency-Bounded Verification of Dynamic Database-Driven Systems | 2016 | PODS |
| 3 | 7,830 | When Can We Answer Queries Using Result-Bounded Data Interfaces? | 2018 | PODS |
| 4 | 2,733 | Processing First-Order Queries under Limited Access Patterns | 2004 | PODS |
| 5 | 12,678 | Analyzing Workflows implied by Instance-Dependent Access Rules | 2006 | PODS |
| 6 | 11,525 | Data Path Queries over Embedded Graph Databases | 2022 | PODS |
| 7 | 2,947 | Querying with Access Patterns and Integrity Constraints | 2015 | VLDB |
| 8 | 5,127 | Verification of Database-driven Systems via Amalgamation | 2013 | PODS |
| 9 | 12,364 | Determining Relevance of Accesses at Runtime | 2011 | PODS |
| 10 | 11,839 | Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding | 2019 | PODS |