Talk:Chase (algorithm)

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Computing

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
???	This article has not yet received a rating on the project's importance scale.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

Origins of chase algorithm

The paper "The theory of joins in relational databases" by Aho, Beeri and Ullman actually appeared two years before 1979 in Proceedings of 18th IEEE Symposium on Foundations of Computer Science, October 31st-November 2nd, 1977. Reference: https://ieeexplore.ieee.org/document/4567932 — Preceding unsigned comment added by RobertPaulDavis410 (talk • contribs) 00:48, 1 January 2020 (UTC)[reply]