The chase revisited

368 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

AlphaClean: Automatic Generation of Data Cleaning Pipelines (2019, methodology): “set of FDs, and will run the chase algorithm [15] for f d .”
Description Logic Knowledge and Action Bases (2014, methodology): “This behavior closely resembles the chase of tuple-generating dependencies (TGDs) in data exchange, where an application of γ + corresponds to a “parallel” chase step (Deutsch, Nash, & Remmel, 2008).”
Foundations of SPARQL query optimization (2008, methodology): “There exist, however, sufﬁcient conditions for the termination of the chase; the best condition known so far is that of stratiﬁed constraints [8].”
On rules with existential variables: Walking the decidability line (2011, background): “Note that the undecidability of fes recognition has also been proven in [27], with a reduction from the halting problem of a Turing Machine.”
A general datalog-based framework for tractable query answering over ontologies (2009, background): “We recall that the two problems of CQ and BCQ evaluation under TGDs are LOGSPACE-equivalent [16, 25, 23, 20].”
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints (2008, background): “ notable syntactic restriction guaranteeing chase termination is weak acyclicity of TGDs, for which we refer the reader to the milestone paper [41]. More general syntactic restrictions are studied in [39, 69, 54, 7, 53]. A semantic property of TGDs, called parsimony, is introduced in [64]. Parsimony”