Extraction and Implication of Path Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Extraction and Implication of Path Constraints


We consider semistructured data as rooted edge-labeled directed graphs, and path inclusion constraints on these graphs. In this paper, we give a new decision algorithm for the implication problem of a constraint $p \preceq q$ by a set of constraints $p_i \preceq u_i$ where $p$, $q$, and the $p_i$'s are regular path expressions and the $u_i$'s are non-empty paths, improving in this particular case, the more general algorithms of S. Abiteboul and V. Vianu, and Alechina et al. Moreover, in the case of a set of word equalities $u_i \equiv v_i$, we give a more efficient decision algorithm for the implication of a word equality $u \equiv v$, improving the more general algorithm of P. Buneman et al., and we prove that, in this case, the implication problem for non-deterministic models or for (complete) deterministic models are equivalent.
Fichier principal
Vignette du fichier
Extraction-And-Implication-Of-Path-Constraints.pdf (179.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00536715 , version 1 (16-11-2010)


  • HAL Id : inria-00536715 , version 1


Yves André, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison. Extraction and Implication of Path Constraints. 29th Symposium on Mathematical Foundations of Computer Science, 2004, Prague, Costa Rica. pp.863-875. ⟨inria-00536715⟩
72 View
209 Download


Gmail Facebook Twitter LinkedIn More