A Benchmark Collection of Deterministic Automata for XPath Queries - Archive ouverte HAL
Communication Dans Un Congrès Année : 2022

A Benchmark Collection of Deterministic Automata for XPath Queries

Antonio Al Serhali
Joachim Niehren

Résumé

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 (Shas), and determinize them. Large blowups by automata determinization are avoided by using schema-based determinization. The schema captures the XML data model and the fact that a variable must be bound to a single node by any query answer. Our collection also provides deterministic symbolic nested word automata that we obtain by compilation from deterministic symbolic Shas.
Fichier principal
Vignette du fichier
0.pdf (1.63 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03527888 , version 1 (23-02-2022)
hal-03527888 , version 2 (28-02-2022)
hal-03527888 , version 3 (27-04-2022)
hal-03527888 , version 4 (03-06-2022)

Identifiants

  • HAL Id : hal-03527888 , version 3

Citer

Antonio Al Serhali, Joachim Niehren. A Benchmark Collection of Deterministic Automata for XPath Queries. XML Prague, Jul 2022, Prague, Czech Republic. ⟨hal-03527888v3⟩
300 Consultations
183 Téléchargements

Partager

More