Abstract Interpretation of Recursive Queries

In this paper, we extend recent works on concrete and abstract semantics of structured query languages by considering recursive queries too. We show that combining abstraction of data and widening operators that guarantee the convergence of the computation may be useful not only for static analysis purposes, but also as a sound and effective tool for query language transformations.

[1]  Markus Helfert,et al.  Software and Data Technologies , 2008 .

[2]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[3]  Agostino Cortesi,et al.  Abstract program slicing of database query languages , 2013, SAC '13.

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

[5]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[6]  Agostino Cortesi,et al.  Widening and narrowing operators for abstract interpretation , 2011, Comput. Lang. Syst. Struct..

[7]  Carlos Ordonez,et al.  Optimization of Linear Recursive Queries in SQL , 2010, IEEE Transactions on Knowledge and Data Engineering.

[8]  Rozaida Ghazali,et al.  An Improved Back Propagation Neural Network Algorithm on Classification Problems , 2010, FGIT-DTA/BSBT.

[9]  Raju Halder,et al.  Extending abstract interpretation to new applicative scenarios , 2012 .

[10]  John Grant,et al.  Logic-based approach to semantic query optimization , 1990, TODS.

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

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

[13]  Krzysztof Stencel,et al.  Usable Recursive Queries , 2005, ADBIS.

[14]  Pierre Deransart,et al.  Programming Languages Implementation and Logic Programming , 1989, Lecture Notes in Computer Science.

[15]  Agostino Cortesi,et al.  Abstract interpretation of database query languages , 2012, Comput. Lang. Syst. Struct..

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

[17]  Krzysztof Stencel,et al.  Pushing Predicates into Recursive SQL Common Table Expressions , 2009, ADBIS.

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

[19]  Patrick Cousot,et al.  Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation , 1992, PLILP.

[20]  Francesco Logozzo.  Class invariants as abstract interpretation of trace semantics , 2009, Comput. Lang. Syst. Struct..

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

[22]  Krzysztof Stencel,et al.  Recursive Query Facilities in Relational Databases: A Survey , 2010, FGIT-DTA/BSBT.

[23]  Agostino Cortesi,et al.  Fine Grained Access Control for Relational Databases by Abstract Interpretation , 2010, ICSOFT.

[24]  Marko Vukolic,et al.  SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings , 2011, SOFSEM.

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

[26]  Premkumar T. Devanbu,et al.  Moving Selections into Linear Least Fixpoint Queries , 1989, IEEE Trans. Knowl. Data Eng..