What question did this study set out to answer?

This research aims to develop a method for repairing property graphs while adhering to Property Graph Constraints (PG-Constraints).

Repairing Property Graphs under PG-Constraints

View Full Paper

Ask AI

Bookmark

This research aims to develop a method for repairing property graphs while adhering to Property Graph Constraints (PG-Constraints).
Developed a comprehensive repair pipeline for property graphs under PG-Constraints.
Identified a significant subset of PG-Constraints including denial constraints and recursion.
Compared three algorithmic strategies: Integer Linear Programming (ILP), naive, and LP-guided greedy algorithm.
Repairing with label deletions resulted in a 59% reduction in deletions compared to node/edge deletions.
The LP-guided greedy algorithm achieved a runtime improvement of up to 97% compared to the ILP strategy, maintaining quality.

No takes yet. Share an insight, caveat, or question.

Randomized trial examines property graph repairs under PG-Constraints, indicating significant efficiency gains with selective deletions.

Spinrath et al. (2026) studied this question.

View Full Paper

Ask AI

Bookmark