The initial and basic role of the chase procedure was to test logical implication between sets of dependencies in order to determine equivalence of database instances known to satisfy a given set of dependencies and to determine query equivalence under database constrains. Recently the chase procedure has experienced a revival due to its application in data exchange. In this chapter we review the chase algorithm and its properties as well as its application in data exchange.
@InCollection{onet:DFU.Vol5.10452.1, author = {Onet, Adrian}, title = {{The Chase Procedure and its Applications in Data Exchange}}, booktitle = {Data Exchange, Integration, and Streams}, pages = {1--37}, series = {Dagstuhl Follow-Ups}, ISBN = {978-3-939897-61-3}, ISSN = {1868-8977}, year = {2013}, volume = {5}, editor = {Kolaitis, Phokion G. and Lenzerini, Maurizio and Schweikardt, Nicole}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DFU.Vol5.10452.1}, URN = {urn:nbn:de:0030-drops-42884}, doi = {10.4230/DFU.Vol5.10452.1}, annote = {Keywords: chase, chase termination, data exchange, incomplete information} }
Feedback for Dagstuhl Publishing