Revision as of 11:44, 16 April 2012 edit A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,578 edits The chase process is confluent. ← Previous edit		Revision as of 17:47, 24 September 2012 edit undo Yobot (talk \| contribs) Bots 4,733,870 edits m clean up, References after punctuation per WP:REFPUNC and WP:PAIC using AWB (8434) Next edit →
Line 4: The Chase has its origins in two seminal papers, one 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> and the other 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>. '''Chase test''' is for testing whether the [[projection (relational algebra)\|projection]] of a relation onto any decomposition can be recovered by rejoining.

Chase (algorithm): Difference between revisions