A Benchmark Collection of Deterministic Automata for XPath Queries

Al Serhali, Antonio; Niehren, Joachim

Type de document :

Pré-publication ou Document de travail

URL permanente :

http://hdl.handle.net/20.500.12210/73817

Titre :

A Benchmark Collection of Deterministic Automata for XPath Queries

Auteur(s) :

Al Serhali, Antonio [Auteur]
Linking Dynamic Data [LINKS]
Niehren, Joachim [Auteur]

Linking Dynamic Data [LINKS]

Mot(s)-clé(s) en anglais :

nested words
XPath
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-world ...
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 (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.Lire moins >

Langue :

Anglais

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Date de dépôt :

2022-04-28T02:09:22Z

Fichiers

https://hal.inria.fr/hal-03527888v3/document
Accès libre
Accéder au document

A Benchmark Collection of Deterministic ... BibTeX CSV Excel RIS

Fichiers

A Benchmark Collection of Deterministic ...

BibTeX

CSV

Excel

RIS