On conjunctive queries containing inequalities
Journal of the ACM (JACM)
The complexity of querying indefinite data about linearly ordered domains
Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Extending query rewriting techniques for fine-grained access control
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
The containment problem for Real conjunctive queries with inequalities
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
L-diversity: Privacy beyond k-anonymity
ACM Transactions on Knowledge Discovery from Data (TKDD)
A framework for health care information assurance policy and compliance
Communications of the ACM
Hi-index | 0.02 |
Wireless technology is steadily improving the access and cost-effectiveness of healthcare data management. With the growth in information access, comes the challenge of maintaining patient record privacy and security. Our work develops an algorithm to evaluate ad-hoc user queries against database policies. We consider an efficient evaluation algorithm (defined at the schema-level), based on a classification of attributes in the policy and query (both of which can be written in SQL). Our algorithm can be used for policy integration as well, and scales well with typical query sizes that may be expected for mobile devices.