Authorization views and conditional query containment

N/ACitations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 -complete. Based on the algorithm, we give a test for a query to be conditionally authorized given a set of materialized authorization views. © 2005 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhang, Z., & Mendelzon, A. O. (2005). Authorization views and conditional query containment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3363 LNCS, pp. 259–273). https://doi.org/10.1007/978-3-540-30570-5_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free