Abstract
The chase of datalog programs is anew way to reason about datalog programs that are evaluated on databases consistent with a set of constraints. It is an equivalence-preserving program transformation that uncovers properties of datalog programs that must hold when they are evaluated on consistent databases. Here, we summarizes our research.
This work was partially supported by NSF grants HRD-9353271 and HRD-9628450, and by CICYT grant Tel96-1390-C02-02.
References
S. Abiteboul and R. Hull. Data Functions, Datalog and Negation. In Porc. Seventh ACM SIGACT-SIGMOD-SIGART. Symposium on Principle of Database Systems, pp 143–153, 1998.
A.V. Aho, C. Beer, and J.D. Ullman. The Theory of Joins in Relational Databases. ACM-TODS, 4(3) pp 297–314, 1979.
D. Maier, A.O. Mendelzon, and Y. Sagiv. Testing Implications of Data Dependencies. ACM-TODS, 4(4) pp 455–469, 1979.
Y. Sagiv. Optimizing Datalog Programs. In J. Minker, editor Foundations of Deductive Databases and Logic Programming, chapter 17 pp 659–698. Morgan Kauffmann Publishers, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brisaboa, N.R., González, A., Hernández, H.J., Paramá, J.R. (1998). The chase of datalog programs. In: Embury, S.M., Fiddian, N.J., Gray, W.A., Jones, A.C. (eds) Advances in Databases. BNCOD 1998. Lecture Notes in Computer Science, vol 1405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053479
Download citation
DOI: https://doi.org/10.1007/BFb0053479
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64659-4
Online ISBN: 978-3-540-69112-9
eBook Packages: Springer Book Archive