Skip to main content

Usable Recursive Queries

  • Conference paper

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

Abstract

Recursive queries are required for many tasks of database applications. Among them we can mention Bill-Of-Material (BOM), various kinds of networks (transportation, telecommunication, etc.), processing semi-structured data (XML, RDF), and so on. The support for recursive queries in current query languages is limited. In particular, this concerns corresponding extensions of SQL in Oracle and DB2 systems. In this paper we present recursive query processing capabilities for the object-oriented Stack-Based Query Language (SBQL). SBQL offers very powerful and flexible recursive querying capabilities due to the fact that recursive processing operators are fully orthogonal to other capabilities of this language. The presented features aim at the ease of recursive programming in databases and not at building new theoretical foundations. This paper discusses novel SBQL constructs, such as transitive closures, fixed point equations and recursive procedures/views. Their main advantage is that they are seamlessly integrated with object-oriented facilities, computer environment and databases.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atkinson, M.P., Buneman, P.: Types and Persistence in Database Programming Languages. ACM Computing Surveys 19(2), 105–190 (1987)

    Article  Google Scholar 

  2. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  3. Płodzień, J., Subieta, K.: Applying Low-Level Query Optimization Techniques by Rewriting. In: Mayr, H.C., Lazanský, J., Quirchmayr, G., Vogel, P. (eds.) DEXA 2001. LNCS, vol. 2113, pp. 867–876. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Kozankiewicz, H., Subieta, K.: SBQL Views –Prototype of Updateable Views. In: Benczúr, A.A., Demetrovics, J., Gottlob, G. (eds.) ADBIS 2004. LNCS, vol. 3255. Springer, Heidelberg (2004)

    Google Scholar 

  5. Subieta, K., Beeri, C., Matthes, F., Schmidt, J.W.: A Stack-Based Approach to Query Languages. In: Proc. East-West Database Workshop, 1994, pp. 159–180. Springer Workshops in Computing, Heidelberg (1995)

    Google Scholar 

  6. Subieta, K., Kambayashi, Y., Leszczyłowski, J.: Procedures in Object-Oriented Query Languages. In: Proc. VLDB Conf., pp. 182–193. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  7. Subieta, K.: Theory and Construction of Object-Oriented Query Languages. Polish-Japanese Institute of Information Technology Editors, Warsaw (2004)

    Google Scholar 

  8. Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. II, ch. 13. W H Freeman, New York (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pieciukiewicz, T., Stencel, K., Subieta, K. (2005). Usable Recursive Queries. In: Eder, J., Haav, HM., Kalja, A., Penjam, J. (eds) Advances in Databases and Information Systems. ADBIS 2005. Lecture Notes in Computer Science, vol 3631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11547686_2

Download citation

  • DOI: https://doi.org/10.1007/11547686_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28585-4

  • Online ISBN: 978-3-540-31895-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics