Chase algorithm - DBIS - Databases and Information Systems
dbis.informatik.uni-freiburg.de › projekte
Publications. On Chase Termination Beyond Stratification, Michael Meier, Michael Schmidt, Georg Lausen. In Proc. VLDB 2009, Lyon (France).
We show that all–instances termination of chase is undecidable. More precisely, there is no algorithm deciding, for a given set consisting of Tuple Generating ...
[PDF] Stratification-based Criteria for Checking Chase Termination?
sebd2012.dei.unipd.it › documents
Several database areas such as data exchange and integration share the problem of fixing database instance violations with respect to a set of constraints. The ...
On Chase Termination Beyond Stratification. PVLDB, 2009;2(1):970–. 981. doi:10.14778/1687627.1687737. [18] Spezzano F, Greco S. Chase Termination: A ...
The question that comes up is whether guardedness has the same positive impact on chase termination. ... On chase termination beyond stratification. PVLDB. 2(1), ...
On chase termination beyond stratification. M Meier, M Schmidt, G Lausen. arXiv preprint arXiv:0906.4228, 2009. 96, 2009. Towards rule-based minimization of RDF ...
On chase termination beyond stratification. M Meier, M Schmidt, G Lausen. arXiv preprint arXiv:0906.4228, 2009. 95, 2009. Towards rule-based minimization of RDF ...
Sep 26, 2020 · Although several different proofs for the decidability of the restricted chase termination problem for single-head linear TGDs can be obtained ...
... On chase termination beyond stratification. PVLDB 2(1), 970–. 981 (2009). 30. Nenov, Y., Piro, R., Motik, B., Horrocks, I., Wu, Z., Banerjee, J.: Rdfox: a ...
Figure 1 for On Chase Termination Beyond Stratification. Abstract:We study the termination problem of the chase algorithm, a central tool in various database ...