Chase (algorithm): Difference between revisions

Content deleted Content added

Revision as of 17:02, 6 March 2020 edit MewTheEditor (talk \| contribs) 191 edits m →Example: Better paragraph spacing ← Previous edit		Latest revision as of 17:34, 26 September 2021 edit undo Jac16888 (talk \| contribs) Administrators 55,766 edits rm sig Tag: Undo
(3 intermediate revisions by 3 users not shown)
Line 9: The chase can be done by drawing a tableau (which is the same formalism used in [[tableau query]]). Suppose ''R'' has [[attribute (computing)\|attributes]] ''A, B, ...'' and components of ''t'' are ''a, b, ...''. For ''t<sub>i</sub>'' use the same letter as ''t'' in the components that are in S<sub>''i''</sub> but subscript the letter with ''i'' if the component is not in S<sub>''i''</sub>. Then, ''t<sub>i</sub>'' will agree with ''t'' if it is in S<sub>''i''</sub> and will have a unique value otherwise. The chase process is [[confluence (rewriting system)\|confluent]]. There exist implementations of the chase algorithm,<ref>[[Michael Benedikt (computer scientist)\|Michael Benedikt]], [[George Konstantinidis]], [[Giansalvatore Mecca]], [[Boris Motik]], [[Paolo Papotti]], [[Donatello Santoro]], [[Efthymia Tsamoura]]: ''Benchmarking the Chase''. In Proc. of PODS, 2017.</ref>, some of them are also open-source.<ref>{{cite web \|url=https://github.com/donatellosantoro/Llunatic \|title=The Llunatic Mapping and Cleaning Chase Engine\|date=6 April 2021}}</ref>. ==Example==