Publication Type
Conference Proceeding Article
Version
submittedVersion
Publication Date
6-2005
Abstract
In data publishing, the owner delegates the role of satisfying user queries to a third-party publisher. As the publisher may be untrusted or susceptible to attacks, it could produce incorrect query results. In this paper, we introduce a scheme for users to verify that their query results are complete (i.e., no qualifying tuples are omitted) and authentic (i.e., all the result values originated from the owner). The scheme supports range selection on key and non-key attributes, project as well as join queries on relational databases. Moreover, the proposed scheme complies with access control policies, is computationally secure, and can be implemented efficiently.
Keywords
Access control, data publishing, relational query, data processing
Discipline
Databases and Information Systems | Numerical Analysis and Scientific Computing
Publication
SIGMOD 2005: Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, June 14-16, 2005
First Page
407
Last Page
418
ISBN
9781595930606
Identifier
10.1145/1066157.1066204
Publisher
ACM
City or Country
New York
Citation
PANG, Hwee Hwa; JAIN, Arpit; RAMAMRITHAM, Krithi; and TAN, Kian-Lee.
Verifying Completeness of Relational Query Results in Data Publishing. (2005). SIGMOD 2005: Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, June 14-16, 2005. 407-418.
Available at: https://ink.library.smu.edu.sg/sis_research/1136
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://doi.org/10.1145/1066157.1066204
Included in
Databases and Information Systems Commons, Numerical Analysis and Scientific Computing Commons