Object-oriented programming with recursive queries

Authors:
Tomasz Pieciukiewicz;Krzysztof Stencel;Kazimierz Subieta
Affiliations:
Polish-Japanese Institute of Information Technology, Warsaw, Poland;Institute of Informatics, Warsaw University, Warsaw, Poland;Polish-Japanese Institute of Information Technology, Warsaw, Poland and Institute of Computer Science PAS, Warsaw, Poland
Venue:
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
Year:
2006

Citing 3
Cited 0

Types and persistence in database programming languages

ACM Computing Surveys (CSUR)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Procedures in Object-Oriented Query Languages

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recursive queries are required in many object-oriented database applications. Among them we can mention Bill-Of-Material (BOM), stock market dependencies, 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 this paper we present recursive query processing capabilities for object-oriented environments. They are a part of the Stack-Based Query Language (SBQL). SBQL offers powerful and flexible recursive querying capabilities due to the fact that recursive processing operators are fully orthogonal to other capabilities of this language. This paper discusses novel SBQL constructs, such as transitive closures, fixed point equations and recursive procedures/views. They are implemented within the OODBMS ODRA devoted to Web and grid applications.