Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Devanbu, P.: Moving selections into linear least fixpoint queries. IEEE Transactions on Knowledge and Data Engineering 1(4), 424–432 (1989)
Aho, A.V., Ullman, J.D.: Universality of data retrieval languages. In: Proceedings of the POPL 1979, pp. 110–119. ACM Press (1979)
Alfred, T.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5(2), 285–309 (1955)
Burzańska, M., Stencel, K., Wiśniewski, P.: Pushing Predicates into Recursive SQL Common Table Expressions. In: Grundspenkis, J., Morzy, T., Vossen, G. (eds.) ADBIS 2009. LNCS, vol. 5739, pp. 194–205. Springer, Heidelberg (2009)
Chakravarthy, U.S., Grant, J., Minker, J.: Logic-based approach to semantic query optimization. ACM Transactions on Database Systems 15(2), 162–207 (1990)
Codd, E.F.: Relational completeness of database subanguages. In: Database Systems, pp. 65–98 (1972)
Codd, E.F.: A relational model of data for large shared data banks. Communications of the ACM 25th Anniversary Issue 26(1), 64–69 (1983)
Cortesi, A., Zanioli, M.: Widening and narrowing operators for abstract interpretation. Computer Languages, Systems & Structures 37, 24–42 (2011)
Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the POPL 1977, pp. 238–252. ACM Press (1977)
Cousot, P., Cousot, R.: Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 269–295. Springer, Heidelberg (1992)
Halder, R., Cortesi, A.: A Persistent Public Watermarking of Relational Databases. In: Jha, S., Mathuria, A. (eds.) ICISS 2010. LNCS, vol. 6503, pp. 216–230. Springer, Heidelberg (2010)
Halder, R., Cortesi, A.: Cooperative Query Answering by Abstract Interpretation. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 284–296. Springer, Heidelberg (2011)
Halder, R.: Extending Abstract Interpretation to New Applicative Scenarios. Ph.D. thesis, Università Ca’ Foscari Venezia (2012)
Halder, R., Cortesi, A.: Abstract interpretation of database query languages. Computer Languages, Systems & Structures 38, 123–157 (2012)
Halder, R., Cortesi, A.: Fine Grained Access Control for Relational Databases by Abstract Interpretation. In: Pedrosa, V. (ed.) ICSOFT 2010. CCIS, vol. 170, pp. 235–249. Springer, Heidelberg (2012)
Halder, R., Cortesi, A.: Abstract program slicing of database query languages. In: Proceedings of the the 28th Symposium On Applied Computing - Special Track on Database Theory, Technology, and Applications. ACM Press, Coimbra (2013)
Halder, R., Pal, S., Cortesi, A.: Watermarking techniques for relational databases: Survey, classification and comparison. Journal of Universal Computer Science 16(21), 3164–3190 (2010)
Logozzo, F.: Class invariants as abstract interpretation of trace semantics. Computer Languages, Systems & Structures 35, 100–142 (2009)
Ordonez, C.: Optimization of linear recursive queries in sql. IEEE Transactions on Knowledge and Data Engineering 22(2), 264–277 (2010)
Pieciukiewicz, T., Stencel, K., Subieta, K.: Usable Recursive Queries. In: Eder, J., Haav, H.-M., Kalja, A., Penjam, J. (eds.) ADBIS 2005. LNCS, vol. 3631, pp. 17–28. Springer, Heidelberg (2005)
Przymus, P., Boniewicz, A., Burzańska, M., Stencel, K.: Recursive Query Facilities in Relational Databases: A Survey. In: Zhang, Y., Cuzzocrea, A., Ma, J., Chung, K.-i., Arslan, T., Song, X. (eds.) DTA and BSBT 2010. CCIS, vol. 118, pp. 89–99. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cortesi, A., Halder, R. (2013). Abstract Interpretation of Recursive Queries. In: Hota, C., Srimani, P.K. (eds) Distributed Computing and Internet Technology. ICDCIT 2013. Lecture Notes in Computer Science, vol 7753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36071-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-36071-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36070-1
Online ISBN: 978-3-642-36071-8
eBook Packages: Computer ScienceComputer Science (R0)