Consistent Query Plan Generation in Secure Cooperative Data Access - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Consistent Query Plan Generation in Secure Cooperative Data Access

Meixing Le
  • Function : Author
  • PersonId : 978067
Krishna Kant
  • Function : Author
  • PersonId : 978068
Sushil Jajodia
  • Function : Author
  • PersonId : 978046


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.
Fichier principal
Vignette du fichier
978-3-662-43936-4_15_Chapter.pdf (4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01284858 , version 1 (08-03-2016)





Meixing Le, Krishna Kant, Sushil Jajodia. Consistent Query Plan Generation in Secure Cooperative Data Access. 28th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec), Jul 2014, Vienna, Austria. pp.227-242, ⟨10.1007/978-3-662-43936-4_15⟩. ⟨hal-01284858⟩
37 View
69 Download



Gmail Facebook Twitter LinkedIn More