Skip to main content
SpringerLink
Log in

Abstract Interpretation of Recursive Queries

  • Conference paper
Book cover Distributed Computing and Internet Technology (ICDCIT 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7753))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Devanbu, P.: Moving selections into linear least fixpoint queries. IEEE Transactions on Knowledge and Data Engineering 1(4), 424–432 (1989)

    Article  Google Scholar 

  2. Aho, A.V., Ullman, J.D.: Universality of data retrieval languages. In: Proceedings of the POPL 1979, pp. 110–119. ACM Press (1979)

    Google Scholar 

  3. Alfred, T.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5(2), 285–309 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Chakravarthy, U.S., Grant, J., Minker, J.: Logic-based approach to semantic query optimization. ACM Transactions on Database Systems 15(2), 162–207 (1990)

    Article  Google Scholar 

  6. Codd, E.F.: Relational completeness of database subanguages. In: Database Systems, pp. 65–98 (1972)

    Google Scholar 

  7. 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)

    Google Scholar 

  8. Cortesi, A., Zanioli, M.: Widening and narrowing operators for abstract interpretation. Computer Languages, Systems & Structures 37, 24–42 (2011)

    Article  MATH  Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. Halder, R.: Extending Abstract Interpretation to New Applicative Scenarios. Ph.D. thesis, Università Ca’ Foscari Venezia (2012)

    Google Scholar 

  14. Halder, R., Cortesi, A.: Abstract interpretation of database query languages. Computer Languages, Systems & Structures 38, 123–157 (2012)

    Article  MATH  Google Scholar 

  15. 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)

    Chapter  Google Scholar 

  16. 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)

    Google Scholar 

  17. 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)

    Google Scholar 

  18. Logozzo, F.: Class invariants as abstract interpretation of trace semantics. Computer Languages, Systems & Structures 35, 100–142 (2009)

    Article  Google Scholar 

  19. Ordonez, C.: Optimization of linear recursive queries in sql. IEEE Transactions on Knowledge and Data Engineering 22(2), 264–277 (2010)

    Article  MathSciNet  Google Scholar 

  20. 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)

    Chapter  Google Scholar 

  21. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DAIS, Università Ca’ Foscari Venezia, Italy

    Agostino Cortesi

  2. Dept. of Comp. Sc. & Engg., Indian Institute of Technology Patna, India

    Raju Halder

Authors
  1. Agostino Cortesi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raju Halder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty Incharge, Information Processing and Business Intelligence Unit, Birla Institute of Technology and Science, Pilani, Hyderabad Campus, 500078, Hyderabad, Andhra Pradesh, India

    Chittaranjan Hota

  2. Department of Computer Science, Clemson University, 29634, Clemson, SC, USA

    Pradip K. Srimani

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation