Pépite | Évaluation de requêtes XPath sur des flux XML avec des réseaux d’automates de mots imbriqués

More precisely, to facilitate security auditing of XMLi, XPathi, and SQLi vulnerabilities in program source code, we apply static analysis to first identify the sinks and sources,

The situation is different for queries defined by deterministic nested word automata (Nwas) [1,2], for which earliest query answering is feasible with polynomial resources

For instance, (i) nodes synchronisation and consensus may well support implemen- tation of distributed tuple spaces – traditionally based on distributed hash tables techniques [11]

Our main results are the definability theorems, which give necessary and sufficient conditions under which a class of data trees can be defined by a node expression or set of

Simple XPath expressions may not require huge buffering space size, see figure 2, while the existence of descendant axis ‘//’, the wildcard * or the same name node in the

Similarly to many recent evaluation algorithms for XPath on Xml streams [9,12,6], it is based on the compilation of navigational XPath queries to nested word automata (Nwas) [1]...

si association noeud courant //fonction tous les noeuds fonction descendant du noeud courant... XPath

self ::library/ child ::book[@author = following - sibling ::book/@author] When data joins and navigations in every direction are available, the satisiability problem is undecidable