TY - GEN
T1 - Towards collaborative query planning in multi-party database networks
AU - Zhao, Mingyi
AU - Liu, Peng
AU - Lobo, Jorge
N1 - Funding Information:
We would like to thank Dr. Alessandra Russo and the anonymous reviewers for their valuable comments and suggestions. This research was sponsored by the U.S. Army Research Laboratory and the U.K. Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001. The views and conclusions contained in this document are those of the author(s) and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.
Publisher Copyright:
© IFIP International Federation for Information Processing 2015.
PY - 2015
Y1 - 2015
N2 - Multi-party distributed database networks require secure and decentralized query planning services. In this work, we propose the collaborative query planning (CQP) service that enables multiple parties to jointly plan queries and controls sensitive information disclosure at the same time. We conduct several simulated experiments to evaluate the performance characteristics of our approach compared to other planning schemes, and also study the trade-off between information confidentiality and query plan efficiency. The evaluation shows that when sharing more than 30% of query planning information between coalition parties, the CQP service is able to generate reasonably efficient query plans. We also outline potential improvements of the CQP service at the end.
AB - Multi-party distributed database networks require secure and decentralized query planning services. In this work, we propose the collaborative query planning (CQP) service that enables multiple parties to jointly plan queries and controls sensitive information disclosure at the same time. We conduct several simulated experiments to evaluate the performance characteristics of our approach compared to other planning schemes, and also study the trade-off between information confidentiality and query plan efficiency. The evaluation shows that when sharing more than 30% of query planning information between coalition parties, the CQP service is able to generate reasonably efficient query plans. We also outline potential improvements of the CQP service at the end.
UR - http://www.scopus.com/inward/record.url?scp=84949936582&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84949936582&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-20810-7_2
DO - 10.1007/978-3-319-20810-7_2
M3 - Conference contribution
AN - SCOPUS:84949936582
SN - 9783319208091
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 19
EP - 34
BT - Data and Applications Security and Privacy XXIX - 29th Annual IFIP WG 11.3 Working Conference, DBSec 2015, Proceedings
A2 - Samarati, Pierangela
PB - Springer Verlag
T2 - 29th IFIP WG 11.3 Working Conference on Data and Applications Security, DBSec 2015
Y2 - 13 July 2015 through 15 July 2015
ER -