Functional dependency restricted insertion propagation

With a rise of research on data provenance and quality, insertion propagation problem has been an important role in data lineage. As an variated version of classic view update problem in relational databases, it is defined on a given database D, a monotonic relational algebraic query Q and its materialized view V on D, insertion propagation aims to find a set ΔD of tuples whose insertion into D guarantees that the result of Q is exactly the view V union with a intended insertion ΔV, i.e, ΔD will not produce side-effect on view. This paper considers functional dependency restricted version insertion propagation problem ‘FD-vsef-IP’ which generalizes the computational issues involved in data lineage, it is to find the ΔD not only view side-effect free but also without introducing inconsistency with respect to the predefined functional dependencies. Both data and combined complexity of FD-vsef-IP are studied under both single and group insertion. Plenty of analysis are provided on this problem with respect to queries in different classes on either complexity aspect. Contrary to its counterpart fd-restricted deletion propagation, this paper shows the fd-restricted version is harder to get the optimal solution.