Secure Querying of Recursive XML Views: A Standard XPath-based Technique

Most state-of-the art approaches for securing XML documents allow users to access data only through authorized views defined by annotating an XML grammar (e.g. DTD) with a collection of XPath expressions. To prevent improper disclosure of confidential information, user queries posed on these views need to be rewritten into equivalent queries on the underlying documents. This rewriting enables us to avoid the overhead of view materialization and maintenance. A major concern here is that query rewriting for recursive XML views is still an open problem. To overcome this problem, some works have been proposed to translate XPath queries into non-standard ones, called Regular XPath queries. However, query rewriting under Regular XPath can be of exponential size as it relies on automaton model. Most importantly, Regular XPath remains a theoretical achievement. Indeed, it is not commonly used in practice as translation and evaluation tools are not available. In this paper, we show that query rewriting is always possible for recursive XML views using only the expressive power of the standard XPath. We investigate the extension of the downward class of XPath, composed only by child and descendant axes, with some axes and operators and we propose a general approach to rewrite queries under recursive XML views. Unlike Regular XPath-based works, we provide a rewriting algorithm which processes the query only over the annotated DTD grammar and which can run in linear time in the size of the query. An experimental evaluation demonstrates that our algorithm is efficient and scales well.

Data and Resources

Additional Info

Field Value
Source https://inria.hal.science/hal-00650958
Author Mahfoud, Houari, Imine, Abdessamad
Maintainer CCSD
Last Updated November 10, 2026, 16:22 (UTC)
Created November 10, 2026, 16:22 (UTC)
Identifier Report N°: RR-7834
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Combination of approaches to the security of infinite states systems (CASSIS) ; Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST) ; Université de Technologie de Belfort-Montbeliard (UTBM)-SUPMICROTECH - Ecole Nationale Supérieure de Mécanique et des Microtechniques (SUPMICROTECH - ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université Marie et Louis Pasteur (UMLP)-Université de Technologie de Belfort-Montbeliard (UTBM)-SUPMICROTECH - Ecole Nationale Supérieure de Mécanique et des Microtechniques (SUPMICROTECH - ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université Marie et Louis Pasteur (UMLP)-Centre Inria de l'Université de Lorraine ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM) ; Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) ; Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) ; Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
creator Mahfoud, Houari
date 2011-12-12T00:00:00
harvest_object_id 7271c580-14e0-4800-8447-2bce9c26b192
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-09-22T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/1112.2605
set_spec type:REPORT