Towards Collaborative Query Planning in Multi-party Database Networks

Conference paper

DOI: 10.1007/978-3-319-20810-7_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9149)
Cite this paper as:
Zhao M., Liu P., Lobo J. (2015) Towards Collaborative Query Planning in Multi-party Database Networks. In: Samarati P. (eds) Data and Applications Security and Privacy XXIX. DBSec 2015. Lecture Notes in Computer Science, vol 9149. Springer, Cham

Abstract

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.

Keywords

Information confidentiality Multi-party database network Optimization 

Copyright information

© IFIP International Federation for Information Processing 2015

Authors and Affiliations

  1. 1.Pennsylvania State UniversityState CollegeUSA
  2. 2.ICREA-Universitat Pompeu FabraBarcelonaSpain

Personalised recommendations