Skip to main content
SpringerLink
Log in

Recursive Query Facilities in Relational Databases: A Survey

  • Conference paper
Database Theory and Application, Bio-Science and Bio-Technology (BSBT 2010, DTA 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 118))

Abstract

The relational model is the basis for most modern databases, while SQL is the most commonly used query language. However, there are data structures and computational problems that cannot be expressed using SQL-92 queries. Among them are those concerned with the bill-of-material and corporate hierarchies. A newer standard, called the SQL-99, introduced recursive queries which can be used to solve such tasks. Yet, only recently recursive queries have been implemented in most of the leading relational databases. In this paper we have reviewed and compared implementations of the recursive queries defined by SQL:1999 through SQL:2008 and offered by leading vendors of DBMSs. Our comparison concerns features, syntax and performance.

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. Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic sets and other strange ways to implement logic programs. In: Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1986, pp. 1–15. ACM, New York (1986)

    Chapter  Google Scholar 

  2. Letuchy, D.: Recursive queries in sql. In: Proceedings of SYRCoDIS (2005)

    Google Scholar 

  3. Ordonez, C.: Carlos Ordonez. Optimization of linear recursive queries in sql. IEEE Trans. on Knowl. and Data Eng. 22(2), 264–277 (2010)

    Article  MathSciNet  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. Ghazal, A., Crolotte, A., Seid, D.Y.: Recursive sql query optimization with k-iteration lookahead. In: Bressan, S., Küng, J., Wagner, R. (eds.) DEXA 2006. LNCS, vol. 4080, pp. 348–357. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Stuparu, D., Petrescu, M.: Common Table Expression: Different Database Systems Approach. Journal of Communication and Computer 6(3), 9–15 (2009)

    Google Scholar 

  7. Melton, J., Simon, A.R.: SQL: 1999: understanding relational language components. Morgan Kaufmann Pub., San Francisco (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland

    Piotr Przymus, Aleksandra Boniewicz, Marta Burzańska & Krzysztof Stencel

  2. Institute of Informatics, University of Warsaw, Warsaw, Poland

    Krzysztof Stencel

Authors
  1. Piotr Przymus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aleksandra Boniewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marta Burzańska
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Krzysztof Stencel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Victoria University, 8001, Melbourne, VIC, Australia

    Yanchun Zhang

  2. University of Calabria, Via P. Bucci, 41C, I-87036, Rende, Cosenza, Italy

    Alfredo Cuzzocrea

  3. Hosei University, 3-7-2, Kajino-cho, Koganei-shi, 184-8584, Tokyo, Japan

    Jianhua Ma

  4. Information Security Infrastructure Research Group, Electronics and Telecommunications Research Institute, 161, Gajeong-Dong, Yuseong-Gu, Daejeon, Korea

    Kyo-il Chung

  5. Engineering and Electronics, Edinburgh University, King’s Buildings, Faraday, rm 3.101, Mayfield Road, EH9 3JL, Edinburgh, UK

    Tughrul Arslan

  6. Nanjing University of Aeronautics and Astronautics, 210016, Jiangsu, Nanjing, China

    Xiaofeng Song

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Przymus, P., Boniewicz, A., Burzańska, M., Stencel, K. (2010). Recursive Query Facilities in Relational Databases: A Survey. In: Zhang, Y., Cuzzocrea, A., Ma, J., Chung, Ki., Arslan, T., Song, X. (eds) Database Theory and Application, Bio-Science and Bio-Technology. BSBT DTA 2010 2010. Communications in Computer and Information Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17622-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17622-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17621-0

  • Online ISBN: 978-3-642-17622-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation