Subhedge Projection for Stepwise Hedge Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Subhedge Projection for Stepwise Hedge Automata

Antonio Al Serhali
Joachim Niehren

Abstract

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.
Fichier principal
Vignette du fichier
0.pdf (677.37 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04165835 , version 1 (22-07-2023)
hal-04165835 , version 2 (29-10-2023)
hal-04165835 , version 3 (01-11-2023)

Licence

Identifiers

  • HAL Id : hal-04165835 , version 3

Cite

Antonio Al Serhali, Joachim Niehren. Subhedge Projection for Stepwise Hedge Automata. 24th International Symposium on Fundamentals of Computation Theory, FCT 2023, Sep 2023, Trier, Germany. ⟨hal-04165835v3⟩
60 View
27 Download

Share

Gmail Mastodon Facebook X LinkedIn More