Abstract Interpretation for sound approximation of database query languages

In this paper we extend the Abstract Interpretation framework to the field of query languages for relational databases as a way to support sound approximation techniques. This way, the semantics of query languages can be tuned according to suitable abstractions of the concrete domain of data.

[1]  Georg Gottlob,et al.  Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries , 1985, IEEE Transactions on Software Engineering.

[2]  Giuseppe Pelagatti,et al.  Formal semantics of SQL queries , 1991, TODS.

[3]  Anthony C. Klug.  Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions , 1982, JACM.

[4]  Patrick Cousot,et al.  Systematic design of program transformation frameworks by abstract interpretation , 2002, POPL '02.

[5]  Alessandro Orso,et al.  A Classification of SQL Injection Attacks and Countermeasures , 2006, ISSSE.

[6]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[7]  Giinter von Biiltzingsloewen.  Translating and Optimizing SQL Queries Having Aggregates , 1987 .

[8]  Ryohei Nakano.  Translation with optimization from relational calculus to relational algebra having aggregate functions , 1990, TODS.

[9]  Derek Goldrei.  Propositional and Predicate Calculus: A Model of Argument , 2005 .

[10]  Qiming Chen,et al.  A Structured Approach for Cooperative Query Answering , 1994, IEEE Trans. Knowl. Data Eng..

[11]  Roberto Giacobazzi,et al.  Making abstract interpretations complete , 2000, JACM.

[12]  Wesley W. Chu,et al.  The design and implementation of CoBase , 1993, SIGMOD '93.

[13]  Günter von Bültzingsloewen.  Translating and Optimizing SQL Queries Having Aggregates , 1987, VLDB.