Database Paper Browser

Back to papers

Explainable Security for Relational Databases

Summary: Formal, explainable security model for relational DBs; every query decision (allow/deny) yields a concise, formal explanation. Rooted in disclosure lattices and policy algebras, with a practical engine for disclosing/denying SQL under complex constraints. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4793
Venue
SIGMOD
Year
2014
Pagerank
4.996456e-05
Overall Rank
6,606 | 54.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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
335 Optimization of Real Conjunctive Queries 1993 PODS 0.00027036073
607 Extending Query Rewriting Techniques for Fine-Grained Access Control 2004 SIGMOD 0.00019266724
2,370 Query-Based Data Pricing 2012 PODS 8.9488834e-05
12,058 Fine-Grained Disclosure Control for App Ecosystems 2013 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers