A Benchmark Collection of Deterministic Automata for XPath Queries
Résumé
We provide a benchmark collection of deterministic automata
for regular XPath queries. For this, we select the subcollection of for-
ward 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.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)