Titre :

Complete Subhedge Projection for Stepwise Hedge Automata

Auteur(s) :

Al Serhali, Antonio [Auteur]
Linking Dynamic Data [LINKS]
Niehren, Joachim [Auteur]
Linking Dynamic Data [LINKS]

Mot(s)-clé(s) en anglais :

Automata
Query answering
Nested words
Streaming

Discipline(s) HAL :

Informatique [cs]/Traitement du texte et du document
Informatique [cs]/Théorie et langage formel [cs.FL]

Résumé en anglais : [en]

We show how to evaluate stepwise hedge automata (SHAs) with subhedgeprojection, while completely projecting irrelevant subhedges. Since this requires passing finite state information top-down, we introduce the notion of ...
Lire la suite >We show how to evaluate stepwise hedge automata (SHAs) with subhedgeprojection, while completely projecting irrelevant subhedges. Since this requires passing finite state information top-down, we introduce the notion of downward stepwise hedge automata. We use them to define in-memory and streaming evaluators with complete subhedge projection for SHAs. We then tune theevaluators so that they can decide membership at the earliest time point. We apply our algorithms to the problem of answering regular XPath queries on XML streams. Our experiments show that subhedge projection of SHAs can indeed speed up earliest query answering on XML streams.Lire moins >

Langue :

Anglais

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL