Database Paper Browser

Back to papers

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
10507
Venue
VLDB
Year
2012
Pagerank
4.1945683e-05
Overall Rank
12,155 | 15.44%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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
291 Answering Queries Using Templates With Binding Patterns (Extended Abstract) 1995 PODS 0.00028831632
989 Relational Transducers for Electronic Commerce 1998 PODS 0.00014814282
3,065 Processing First-Order Queries under Limited Access Patterns 2004 PODS 7.6230903e-05
12,168 Determining Relevance of Accesses at Runtime 2011 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers