Advertisement

Usable Recursive Queries

  • Tomasz Pieciukiewicz
  • Krzysztof Stencel
  • Kazimierz Subieta
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Query Language Transitive Closure Recursive Procedure Recursive Processing Infinite Loop 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Atkinson, M.P., Buneman, P.: Types and Persistence in Database Programming Languages. ACM Computing Surveys 19(2), 105–190 (1987)CrossRefGoogle Scholar
  2. 2.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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. 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. 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. 7.
    Subieta, K.: Theory and Construction of Object-Oriented Query Languages. Polish-Japanese Institute of Information Technology Editors, Warsaw (2004)Google Scholar
  8. 8.
    Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. II, ch. 13. W H Freeman, New York (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Tomasz Pieciukiewicz
    • 1
  • Krzysztof Stencel
    • 2
  • Kazimierz Subieta
    • 1
    • 3
  1. 1.Polish-Japanese Institute of Information TechnologyWarsawPoland
  2. 2.Institute of InformaticsWarsaw UniversityWarsawPoland
  3. 3.Institute of Computer Science PASWarsawPoland

Personalised recommendations