Unrolling SQL: 1999 Recursive queries

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Boniewicz, A., Stencel, K., & Wiśniewski, P. (2012). Unrolling SQL: 1999 Recursive queries. In Communications in Computer and Information Science (Vol. 352 CCIS, pp. 345–354). https://doi.org/10.1007/978-3-642-35603-2_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free