A Benchmark of Deterministic Automata for ...
Type de document :
Pré-publication ou Document de travail
URL permanente :
Titre :
A Benchmark of Deterministic Automata for Regular XPath Queries
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]
Mot(s)-clé(s) en anglais :
XPath
nested words
trees
regular path queries
Automata
nested words
trees
regular path queries
Automata
Discipline(s) HAL :
Informatique [cs]
Résumé en anglais : [en]
We provide a benchmark collection of deterministic automata for regular XPath queries. For this, we select the subcollection of forward navigational XPath queries from a corpus that Lick and Schmitz extracted from real ...
Lire la suite >We provide a benchmark collection of deterministic automata for regular XPath queries. For this, we select the subcollection of forward navigational XPath queries from a corpus that Lick and Schmitz extracted from real world XSLT and XQuery programs, compile them to symbolic stepwise hedge automata (SSHAs) and determinize them. Large blowups by automata determinization are avoided by using schema-based determinization. Therefore, we show how to lift a recent algorithm for schema-based determinization from SHAs to symbolic SHAs. Our collection also provides deterministic symbolic nested word automata, that we obtain by compilation from deterministic symbolic SHAs.Lire moins >
Lire la suite >We provide a benchmark collection of deterministic automata for regular XPath queries. For this, we select the subcollection of forward navigational XPath queries from a corpus that Lick and Schmitz extracted from real world XSLT and XQuery programs, compile them to symbolic stepwise hedge automata (SSHAs) and determinize them. Large blowups by automata determinization are avoided by using schema-based determinization. Therefore, we show how to lift a recent algorithm for schema-based determinization from SHAs to symbolic SHAs. Our collection also provides deterministic symbolic nested word automata, that we obtain by compilation from deterministic symbolic SHAs.Lire moins >
Langue :
Anglais
Collections :
Source :
Date de dépôt :
2022-03-02T02:00:56Z
Fichiers
- https://hal.inria.fr/hal-03527888v2/document
- Accès libre
- Accéder au document