2005 | OriginalPaper | Buchkapitel
Authorization Views and Conditional Query Containment
verfasst von : Zheng Zhang, Alberto O. Mendelzon
Erschienen in: Database Theory - ICDT 2005
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A recent proposal for database access control consists of defining “authorization views” that specify the accessible data, and declaring a query valid if it can be completely rewritten using the views. Unlike traditional work in query rewriting using views, the rewritten query needs to be equivalent to the original query only over the set of database states that agree with a given set of materializations for the authorization views. With this motivation, we study conditional query containment,
i.e.
, containment over states that agree on a set of materialized views. We give an algorithm to test conditional containment of conjunctive queries with respect to a set of materialized conjunctive views. We show the problem is
${\it \Pi}^{p}_{2}$
-complete. Based on the algorithm, we give a test for a query to be conditionally authorized given a set of materialized authorization views.