The theory of joins in relational data bases
By Alfred V. Aho, C. Beeri, Jeffrey D. Ullman. 1977
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Sanjay Krishnan
- Eugene Wu
- M. Franklin
- Ken Goldberg
- Jean-François Baget
- Michel Leclère
- Marie-Laure Mugnier
- Eric Salvat
Citations in the corpus
- AlphaClean: Automatic Generation of Data Cleaning Pipelines (2019, background): “replace(fd) enforces a functional dependency with the chase algorithm [3].”
- BoostClean: Automated Error Detection and Repair for Machine Learning (2017, background): “This assumption avoids a fixed-point iteration, also called the “chase algorithm” [6], which repairs that cause additional errors.”
- On rules with existential variables: Walking the decidability line (2011, result): “[20,34,2]), as well as from more recent results in a graph-based framework (resp.”
- The chase revisited (2008, background): “These results are considered folklore or appear implicitly in proofs related to the chase [3, 22, 21, 12, 4, 2].”