Chase (algorithm): Difference between revisions

Revision as of 05:07, 20 October 2015

Revision as of 05:08, 20 October 2015

Line 2:

It is used, directly or indirectly, on an everyday basis by people who design databases, and it is used in commercial systems to reason about the consistency and correctness of a data design.{{cn|date=November 2012}} New applications of the chase in meta-data management and data exchange are still being discovered.

The Chase has its origins in two seminal papers, one by [[Alfred V. Aho]], [[Catriel Beeri]], and [[Jeffrey D. Ullman]].<ref>[[Alfred V. Aho]], [[Catriel Beeri]], and [[Jeffrey D. Ullman]]: "The Theory of Joins in Relational Databases", ACM Trans. Datab. Syst. 4(3):297-314, 1979 .</ref> and the other by [[David Maier]], [[Alberto O. Mendelzon]], and [[Yehoshua Sagiv]]<ref>

[[David Maier]], [[Alberto O. Mendelzon]], and [[Yehoshua Sagiv]]: "Testing Implications of Data Dependencies". ACM Trans. Datab. Syst. 4(4):455-469, 1979.</ref>.