Efficient consistency maintenance of incomplete and dynamic real-life databases is a quality label for further data analysis. In prior work, we tackled the generic problem of database updating in the presence of tuple generating constraints from a theoretical viewpoint. The current paper considers the usability of our approach by (a) introducing incremental update routines (instead of the previous from-scratch versions) and (b) removing the restriction that limits the contents of the database to fit in the main memory. In doing so, this paper offers new algorithms, proposes queries and data models inviting discussions on the representation of incompleteness on databases. We also propose implementations under a graph database model and the traditional relational database model. Our experiments show that computation times are similar globally but point to discrepancies in some steps.

翻译：对不完整且动态变化的真实数据库进行高效的一致性维护，是进一步数据分析的质量保证。在前期工作中，我们从理论角度解决了存在元组生成约束时的数据库更新这一通用问题。本文通过以下方式考察了该方法的应用性：（a）引入增量更新例程（取代先前从零开始的版本），（b）消除将数据库内容限制在主存中的约束。为此，本文提出了新算法、查询语句及数据模型，以引发关于数据库中不完整性表示的讨论。我们还提出了基于图数据库模型和传统关系数据库模型的实现方案。实验表明，整体计算时间相似，但在某些步骤中存在差异。