Skip to Main content Skip to Navigation
Conference papers

When is the Evaluation of Extended CRPQ Tractable?

Abstract : 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.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03353483
Contributor : Diego Figueira Connect in order to contact the contributor
Submitted on : Tuesday, March 29, 2022 - 12:52:36 PM
Last modification on : Saturday, June 25, 2022 - 10:44:49 AM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03353483, version 2

Collections

Citation

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⟩

Share

Metrics

Record views

77

Files downloads

60