Efficient Implementation of Recursive Queries in Major Object Relational Mapping Systems

Szumowska, Aneta; Burza, Marta; ska,; Wi, Piotr; niewski,; Stencel, Krzysztof

doi:10.1007/978-3-642-27142-7_10

Cited by 7 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More information is given in our prequel papers, e.g. [12]. In that paper we have also shown a way to define this mapping using Java annotations.…”

Section: Recursive-conditionmentioning

confidence: 97%

“…Recursive queries on hierarchies and graphs constitute one of such features. Previous results consists in the integration recursive querying and ORM [10][11][12]. However, they cannot be used directly with databases like MySQL whose SQL dialects do not support recursion.…”

Section: Recursive Queries and Mysqlmentioning

confidence: 99%

“…Such an approach is though remarkably inefficient. In this paper we describe our research on the integration of programmer interfaces from [12] with unrolling methods from Section 3.…”

Section: Recursive Queries and Mysqlmentioning

confidence: 99%

“…The results of this research have been published in [10][11][12]. Listing 1.6 shows a sample configuration file for the mapping of a recursive query to the corporate hierarchy stored in the table emp.…”

Section: Integration Of Recursive Queries and Ormmentioning

confidence: 99%

“…We have developed designs and prepared prototype implementations of a number of novel features in ORMs. They are recursive queries [10][11][12], partial aggregation [13] and functional indices [14].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Unrolling SQL: 1999 Recursive Queries

Boniewicz

Stencel

Wiśniewski

2012

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

Abstract. Hierarchical and graph data structures are common in practical application development. In order to query such data, one can use SQL:1999 recursive queries based on Common Table Expressions. Nowadays, numerous relational database management systems implement them. However, some popular systems, e.g. MySQL, still lack this useful feature. In this paper we show three methods to circumvent this situation: (1) the direct loop, (2) horizontal unrolling and (3) vertical unrolling. We analyze them and present a report on tests of their efficiency. We also describe our implementation of these methods as a prototype extension to Hibernate, a major object-relational mapping system. This extension allows running SQL:1999 recursive queries directly from an application code, even when the underlying DBMS does not support them.

show abstract

“…More information is given in our prequel papers, e.g. [12]. In that paper we have also shown a way to define this mapping using Java annotations.…”

Section: Recursive-conditionmentioning

confidence: 97%

Section: Recursive Queries and Mysqlmentioning

confidence: 99%

“…Such an approach is though remarkably inefficient. In this paper we describe our research on the integration of programmer interfaces from [12] with unrolling methods from Section 3.…”

Section: Recursive Queries and Mysqlmentioning

confidence: 99%

Section: Integration Of Recursive Queries and Ormmentioning

confidence: 99%