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.

随着数据来源和质量研究的兴起，插入传播问题已成为数据沿袭中的重要角色。作为关系数据库中经典视图更新问题的一个变体，它在给定的数据库D上定义，一个单调的关系代数查询Q及其在D上的物化视图V，插入传播的目的是找到一个元组的集合ΔD，其插入到D中保证Q的结果正好是具有预期插入量ΔV的视图V union ，即ΔD不会在视图上产生副作用。本文考虑了功能依赖性受限版本插入传播问题“ FD-vsef-IP ”，该问题概括了数据沿袭中涉及的计算问题，目的是发现ΔD不仅无视副作用，而且不会在预定义方面引入不一致功能依赖性。FD-vsef-IP的数据和组合复杂度都在单个插入和组插入下进行了研究。针对任一复杂度方面的不同类中的查询，针对此问题提供了大量分析。与对应的fd限制的缺失传播相反，本文显示了fd-受限版本更难获得最佳解决方案。