Algorithmic Debugging of SQL Views
We present a general framework for debugging systems of correlated SQL views. The debugger locates an erroneous view by navigating a suitable computation tree. This tree contains the computed answer associated with every intermediate relation, asking the user whether this answer is expected or not. The correctness and completeness of the technique is proven formally, using a general definition of SQL operational semantics. The theoretical ideas have been implemented in an available tool which includes the possibility of employing trusted specifications for reducing the number of questions asked to the user.
Unable to display preview. Download preview PDF.
- 3.Codd, E.: Relational Completeness of Data Base Sublanguages. In: Rustin (ed.) Data Base Systems. Courant Computer Science Symposia Series, vol. 6. Prentice-Hall, Englewood Cliffs (1972)Google Scholar
- 5.Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems: The Complete Book. Prentice Hall PTR, Upper Saddle River (2008)Google Scholar
- 6.Grefen, P.W.P.J., de By, R.A.: A multi-set extended relational algebra: a formal approach to a practical issue. In: 10th International Conference on Data Engineering, pp. 80–88. IEEE (1994)Google Scholar
- 7.Naish, L.: A Declarative Debugging Scheme. Journal of Functional and Logic Programming 3 (1997)Google Scholar
- 10.Sáenz-Pérez, F.: DES: A Deductive Database System. In: Spanish Conference on Programming and Computer Languages (September 2010) (in Press)Google Scholar
- 11.Shapiro, E.: Algorithmic Program Debugging. In: ACM Distiguished Dissertation. MIT Press (1982)Google Scholar
- 12.SQL, ISO/IEC 9075:1992, third edition (1992)Google Scholar
- 13.Vansummeren, S., Cheney, J.: Recording provenance for sql queries and updates. IEEE Data Eng. Bull. 30(4), 29–37 (2007)Google Scholar