Optimal Security-Aware Query Processing
Summary: Impossibility of universally optimal security-aware query processing under access control; optimal algorithms exist only for certain relational-calculus fragments (e.g., existential). Analyzes Truman vs Non-Truman FGAC models; Non-Truman ⊆ Truman for boolean queries, coincide with aggregation, but diverge on non-boolean queries. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Marco Guarnieri
- 2. David Basin
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,757 | An Authorization Model for Multi-Provider Queries | 2018 | VLDB | 4.1905499e-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 |
|---|---|---|---|---|
| 297 | Complexity of Answering Queries Using Materialized Views | 1998 | PODS | 0.00028572729 |
| 607 | Extending Query Rewriting Techniques for Fine-Grained Access Control | 2004 | SIGMOD | 0.00019248482 |
| 1,785 | Limiting Disclosure in Hippocratic Databases | 2004 | VLDB | 0.00010546532 |
| 2,373 | Query-Based Data Pricing | 2012 | PODS | 8.9405504e-05 |
| 3,500 | On the Correctness Criteria of Fine-Grained Access Control in Relational Databases | 2007 | VLDB | 7.0338899e-05 |
| 7,391 | Incomplete Information and Certain Answers in General Data Models | 2011 | PODS | 4.7383385e-05 |
Previous
Page 1 / 1
Next