Chase (algorithm)
The Chase is a simple fixpoint algorithm testing and enforcing implication of data dependencies in database systems. It plays important roles in database theory as well as in practice. 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. 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 David Maier, Alberto O. Mendelzon, and Yehoshua Sagiv[1] and the other by Alfred V. Aho, Catriel Beeri, and Jeffrey D. Ullman[2].
References
- ^ David Maier, Alberto O. Mendelzon, and Yehoshua Sagiv: "Testing Implications of Data Dependencies". ACM Trans. Datab. Syst. 4(4):455-469, 1979.
- ^ 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.
- Serge Abiteboul, Richard B. Hull, Victor Vianu: Foundations of Databases. Addison-Wesley, 1995.
 | This database-related article is a stub. You can help Wikipedia by expanding it. |