On conjunctive queries containing inequalities
Journal of the ACM (JACM)
The complexity of querying indefinite data about linearly ordered domains
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the Fifth International Conference on Data Engineering
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Tableau Techniques for Querying Information Sources through Global Schemas
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Security Administration for Federations, Warehouses, and other Derived Data
Proceedings of the IFIP WG 11.3 Thirteenth International Conference on Database Security: Research Advances in Database and Information Systems Security
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Query containment for data integration systems
Journal of Computer and System Sciences - Special issue on PODS 2000
Extending query rewriting techniques for fine-grained access control
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Evaluating privacy threats in released database views by symmetric indistinguishability
Journal of Computer Security - Selected papers from the Third and Fourth Secure Data Management (SDM) workshops
Requirements and protocols for inference-proof interactions in information systems
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Access control to materialized views: an inference-based approach
Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop
View-based query answering in Description Logics: Semantics and complexity
Journal of Computer and System Sciences
Indistinguishability: the other aspect of privacy
SDM'06 Proceedings of the Third VLDB international conference on Secure Data Management
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
Inference-usability confinement by maintaining inference-proof views of an information system
International Journal of Computational Science and Engineering
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Dynamic policy adaptation for inference control of queries to a propositional information system
Journal of Computer Security - DBSec 2011
| Hi-index | 0.00 |
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.