On the Complexity of Finding Set Repairs for Data-Graphs
Journal of Artificial Intelligence Research · 30.03.2023 · 76 · 721-759
DOI: 10.1613/jair.1.13994 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Artificial Intelligence Research, online erschienen am 30.03.2023. Verfasst von Sergio Abriola und 4 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).
Abstract (Originalsprache)
In the deeply interconnected world we live in, pieces of information link domains all around us. As graph databases embrace effectively relationships among data and allow processing and querying these connections efficiently, they are rapidly becoming a popular platform for storage that supports a wide range of domains and applications. As in the relational case, it is expected that data preserves a set of integrity constraints that define the semantic structure of the world it represents. When a database does not satisfy its integrity constraints, a possible approach is to search for a ‘similar’ database that does satisfy the constraints, also known as a repair. In this work, we study the problem of computing subset and superset repairs for graph databases with data values using a notion of consistency based on having a set of Reg-GXPath expressions as integrity constraints. We show that for positive fragments of Reg-GXPath these problems admit a polynomial-time algorithm, while the full expressive power of the language renders them intractable.
Zitieren
APA
Abriola, S., Martínez, M. V., Pardal, N., Cifuentes, S., & Baque, E. P. (2023). On the Complexity of Finding Set Repairs for Data-Graphs. Journal of Artificial Intelligence Research, 76, 721-759. https://doi.org/10.1613/jair.1.13994
Vancouver
Abriola S, Martínez MV, Pardal N, Cifuentes S, Baque EP. On the Complexity of Finding Set Repairs for Data-Graphs. Journal of Artificial Intelligence Research. 2023;76:721-759. doi:10.1613/jair.1.13994
BibTeX
@article{Abriola2023,
author = {Abriola, Sergio and Martínez, María Vanina and Pardal, Nina and Cifuentes, Santiago and Baque, Edwin Pin},
title = {On the Complexity of Finding Set Repairs for Data-Graphs},
journal = {Journal of Artificial Intelligence Research},
year = {2023},
volume = {76},
pages = {721--759},
doi = {10.1613/jair.1.13994}
}
EUVIMED