Please use this identifier to cite or link to this item:
|Title:||Verifying completeness of relational query results in data publishing|
|Citation:||Pang, H.,Jain, A.,Ramamritham, K.,Tan, K.-L. (2005). Verifying completeness of relational query results in data publishing. Proceedings of the ACM SIGMOD International Conference on Management of Data : 407-418. ScholarBank@NUS Repository. https://doi.org/10.1145/1066157.1066204|
|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. Copyright 2005 ACM.|
|Source Title:||Proceedings of the ACM SIGMOD International Conference on Management of Data|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 20, 2019
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.