Abstract interpretation 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. The abstraction of relational database system has many interesting applications, in particular, for security purposes, such as fine grained access control, watermarking, etc.

[1]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

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

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

[4]  Matthias Jarke,et al.  Query Optimization in Database Systems , 1984, CSUR.

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

[6]  Yannis E. Ioannidis,et al.  Histogram-Based Approximation of Set-Valued Query-Answers , 1999, VLDB.

[7]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[8]  F. E..  A Relational Model of Data Large Shared Data Banks , 2000 .

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

[10]  Soon-Young Huh,et al.  Providing ranked cooperative query answers using the metricized knowledge abstraction hierarchy , 2007, Expert Syst. Appl..

[11]  Agostino Cortesi,et al.  Watermarking Techniques for Relational Databases: Survey, Classification and Comparison , 2010, J. Univers. Comput. Sci..

[12]  Agostino Cortesi,et al.  Observation-Based Fine Grained Access Control for XML Documents , 2011, CISIM.

[13]  Agostino Cortesi,et al.  Persistent Watermarking of Relational Databases , 2010 .

[14]  Jorge Lobo,et al.  On the Correctness Criteria of Fine-Grained Access Control in Relational Databases , 2007, VLDB.

[15]  Agostino Cortesi,et al.  Cooperative Query Answering by Abstract Interpretation , 2011, SOFSEM.

[16]  Agostino Cortesi,et al.  Observation-based Fine Grained Access Control for Relational Databases , 2010, ICSOFT.

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

[18]  Véronique Benzaken,et al.  Static Integrity Constraint Management in Object-Oriented Database Programming Languages via Predicate Transformers , 1997, ECOOP.

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

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

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

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

[23]  Agostino Cortesi,et al.  A Persistent Public Watermarking of Relational Databases , 2010, ICISS.

[24]  E. F. Codd,et al.  A data base sublanguage founded on the relational calculus , 1971, SIGFIDET '71.

[25]  Véronique Benzaken,et al.  Ensuring Efficiently the Integrity of Persistent Object Systems via Abstract Interpretation , 1996, POS.

[26]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

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

[28]  Agostino Cortesi,et al.  Abstract Interpretation for sound approximation of database query languages , 2010, 2010 The 7th International Conference on Informatics and Systems (INFOS).

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