Earliest Query Answering for Deterministic ...
Type de document :
Autre communication scientifique (congrès sans actes - poster - séminaire...): Communication dans un congrès avec actes
Titre :
Earliest Query Answering for Deterministic 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 :
27th International Conference on Implementation and Application of Automata (CIAA)
Ville :
famagusta
Pays :
Chypre
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]
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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.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