Earliest Query Answering for Deterministic Stepwise Hedge Automata - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Earliest Query Answering for Deterministic Stepwise Hedge Automata

Antonio Al Serhali
Joachim Niehren

Résumé

Earliest query answering (EQA) is the problem to enumerate certain query answers on streams at the earliest events. We consider EQA for regular monadic queries on hedges or nested words defined by deterministic stepwise hedge automata (dShas). We present an EQA algorithm for dShas that requires time O(c m) per event, where m is the size of the automata and c the concurrency of the query. We show that our EQA algorithm runs efficiently on regular XPath queries in practice.
Fichier principal
Vignette du fichier
0.pdf (723.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04106420 , version 1 (25-05-2023)

Licence

Paternité

Identifiants

  • HAL Id : hal-04106420 , version 1

Citer

Antonio Al Serhali, Joachim Niehren. Earliest Query Answering for Deterministic Stepwise Hedge Automata. 27th International Conference on Implementation and Application of Automata (CIAA), Sep 2023, famagusta, Cyprus. ⟨hal-04106420⟩
65 Consultations
27 Téléchargements

Partager

Gmail Facebook X LinkedIn More