Consistent Query Plan Generation in Secure Cooperative Data Access

  • Meixing Le
  • Krishna Kant
  • Sushil Jajodia
Conference paper

DOI: 10.1007/978-3-662-43936-4_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8566)
Cite this paper as:
Le M., Kant K., Jajodia S. (2014) Consistent Query Plan Generation in Secure Cooperative Data Access. In: Atluri V., Pernul G. (eds) Data and Applications Security and Privacy XXVIII. DBSec 2014. Lecture Notes in Computer Science, vol 8566. Springer, Berlin, Heidelberg


In this paper, we consider restricted data sharing between a set of parties that wish to provide some set of online services requiring such data sharing. We assume that each party stores its data in private relational databases, and is given a set of mutually agreed set of authorization rules that may involve joins over relations owned by one or more parties. Although the query planning problem in such an environment is similar to the one for distributed databases, the access restrictions introduce significant additional complexity that we address in this paper. We examine the problem of efficiently enforcing rules and generating query execution plans in this environment. Because of the exponential complexity of optimal query planning, our query planning algorithm is heuristics based but produces excellent, if not optimal, results in most of the practical cases.


Rule enforcement Consistent query planning Cooperative data access 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© IFIP International Federation for Information Processing 2014

Authors and Affiliations

  • Meixing Le
    • 1
  • Krishna Kant
    • 2
  • Sushil Jajodia
    • 3
  1. 1.Cisco Corp.USA
  2. 2.Temple Univ.USA
  3. 3.Geoerge Mason Univ.USA

Personalised recommendations