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)

Paper ID: h01ef314e4a4b04d6
Venue: VLDB
Year: 2012
Pagerank: 4.9793485e-05
Overall Rank: 12,642 | 15.01%
DOI: 10.14778/2180912.2180916

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

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
301	Answering Queries Using Templates With Binding Patterns (Extended Abstract)	1995	PODS	0.00021682744
1,176	Relational Transducers for Electronic Commerce	1998	PODS	0.00011643011
2,790	Processing First-Order Queries under Limited Access Patterns	2004	PODS	8.0100392e-05
12,655	Determining Relevance of Accesses at Runtime	2011	PODS	4.9793485e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,912	Optimal Security-Aware Query Processing	2014	VLDB
2	6,081	Recency-Bounded Verification of Dynamic Database-Driven Systems	2016	PODS
3	7,991	When Can We Answer Queries Using Result-Bounded Data Interfaces?	2018	PODS
4	2,790	Processing First-Order Queries under Limited Access Patterns	2004	PODS
5	12,968	Analyzing Workflows implied by Instance-Dependent Access Rules	2006	PODS
6	11,834	Data Path Queries over Embedded Graph Databases	2022	PODS
7	3,000	Querying with Access Patterns and Integrity Constraints	2015	VLDB
8	5,244	Verification of Database-driven Systems via Amalgamation	2013	PODS
9	12,655	Determining Relevance of Accesses at Runtime	2011	PODS
10	12,140	Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding	2019	PODS