Subhedge Projection for Stepwise Hedge Automata
Type de document :
Communication dans un congrès avec actes
Titre :
Subhedge Projection for Stepwise Hedge Automata
Auteur(s) :
Al Serhali, Antonio [Auteur]
Linking Dynamic Data [LINKS]
Niehren, Joachim [Auteur]
Linking Dynamic Data [LINKS]
Linking Dynamic Data [LINKS]
Niehren, Joachim [Auteur]

Linking Dynamic Data [LINKS]
Titre de la manifestation scientifique :
24th International Symposium on Fundamentals of Computation Theory, FCT 2023
Ville :
Trier
Pays :
Allemagne
Date de début de la manifestation scientifique :
2023-09-18
Mot(s)-clé(s) en anglais :
Automata
Query answering
Nested words
Streaming
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]
Informatique [cs]/Théorie et langage formel [cs.FL]
Résumé en anglais : [en]
We show how to evaluate stepwise hedge automata (Shas) with subhedge projection. This requires passing finite state information top-down, so we introduce the notion of downward stepwise hedge automata. We use them to define ...
Lire la suite >We show how to evaluate stepwise hedge automata (Shas) with subhedge projection. This requires passing finite state information top-down, so we introduce the notion of downward stepwise hedge automata. We use them to define an in-memory and a streaming evaluator with subhedge projection for SHAs. We then tune the streaming evaluator so that it 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 >
Lire la suite >We show how to evaluate stepwise hedge automata (Shas) with subhedge projection. This requires passing finite state information top-down, so we introduce the notion of downward stepwise hedge automata. We use them to define an in-memory and a streaming evaluator with subhedge projection for SHAs. We then tune the streaming evaluator so that it 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
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- document
- Accès libre
- Accéder au document
- 0.pdf
- Accès libre
- Accéder au document