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
forward navigational XPath queries from a corpus that Lick and Schmitz
extracted from real-world XSLT and XQuery programs, compile them to
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
any answer of a path query must return a single node.
Our collection also provides deterministic nested word automata
that we obtain by compilation from deterministic SHAs.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)