DBJun 4
Validation of graph databases against PG-Schema
arXiv:2606.0612742.3
AI Analysis
Provides foundational complexity results for graph database validation, relevant to database practitioners and theoreticians.
The paper establishes that validating graph databases against PG-Schema is NP-complete in combined complexity and PTIME in data complexity, with PTIME achievable under restricted alternation.
The problem of validating a given graph database instance against a given PG-Schema graph type without integrity constraints is NP- complete in terms of combined complexity and in PTIME in terms of data complexity. The combined complexity drops to PTIME when the alternation between type combinations and unions is suitably restricted