Skip to Main content Skip to Navigation
Book sections

Efficient Querying of XML Data Through Arbitrary Security Views

Houari Mahfoud 1 Abdessamad Imine 2
2 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : We study the problem of querying virtual security views of XML data that has received a great attention during the past years. A major concern here is that user XPath queries posed on recursive views cannot be rewritten to be evaluated on the underlying XML data. Existing rewriting solutions are based on the non-standard language, “Regular XPath”, which makes rewriting possible under recursion. However, query rewriting under Regular XPath can be of exponential size. We show that query rewriting is always possible for arbitrary security views (recursive or not) by using only the expressive power of the standard XPath. We propose a more expressive language to specify XML access control policies as well as an efficient algorithm to enforce such policies. Finally, we present our system, called SVMAX, that implements our solutions and we show that it scales well through an extensive experimental study based on real-life DTD.
Complete list of metadata
Contributor : Abdessamad Imine Connect in order to contact the contributor
Submitted on : Thursday, December 10, 2015 - 10:38:03 AM
Last modification on : Saturday, October 16, 2021 - 11:26:06 AM



Houari Mahfoud, Abdessamad Imine. Efficient Querying of XML Data Through Arbitrary Security Views. Transactions on Large-Scale Data- and Knowledge-Centered Systems XXII, 9430, pp.75-114, 2015, Lecture Notes in Computer Science, 978-3-662-48566-8. ⟨10.1007/978-3-662-48567-5_3⟩. ⟨hal-01241212⟩



Record views