Algorithmic debugging of SQL views

Authors:
Rafael Caballero;Yolanda García-Ruiz;Fernando Sáenz-Pérez
Affiliations:
Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain
Venue:
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Year:
2011

Citing 8
Cited 3

Formal semantics of SQL queries

ACM Transactions on Database Systems (TODS)
Algorithmic Program DeBugging

Algorithmic Program DeBugging
An extended relational algebra with control over duplicate elimination

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A Multi-Set Extended Relational Algebra - A Formal Approach to a Practical Issue

Proceedings of the Tenth International Conference on Data Engineering
Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs

FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger

Journal of Functional Programming
Database Systems: The Complete Book

Database Systems: The Complete Book
A Theoretical Framework for the Declarative Debugging of Datalog Programs

Semantics in Data and Knowledge Bases

A deductive database with datalog and SQL query languages

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Outer Joins in a Deductive Database System

Electronic Notes in Theoretical Computer Science (ENTCS)
Declarative debugging of wrong and missing answers for SQL views

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.