When is the Evaluation of Extended CRPQ Tractable? - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

When is the Evaluation of Extended CRPQ Tractable?

Résumé

We investigate the complexity of the evaluation problem for ECRPQ: Conjunctive Regular Path Queries (CRPQ), extended with synchronous relations (a.k.a. regular or automatic). We give a characterization for the evaluation and parameterized evaluation problems of ECRPQ in terms of the underlying structure of queries. As we show, complexity can range between PSpace, NP and polynomial time for the evaluation problem, and between XNL, W[1], and FPT for parameterized evaluation.
Fichier principal
Vignette du fichier
main.pdf (1.96 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03353483 , version 1 (24-09-2021)
hal-03353483 , version 2 (29-03-2022)

Identifiants

  • HAL Id : hal-03353483 , version 2

Citer

Diego Figueira, Varun Ramanathan. When is the Evaluation of Extended CRPQ Tractable?. Symposium on Principles of Database Systems (PODS), Jun 2022, Philidelphia, United States. ⟨hal-03353483v2⟩

Collections

CNRS TDS-MACS ANR
290 Consultations
128 Téléchargements

Partager

Gmail Facebook X LinkedIn More