Pushing Predicates into Recursive SQL Common Table Expressions

Burzańska, Marta; Stencel, Krzysztof; Wiśniewski, Piotr

doi:10.1007/978-3-642-03973-7_15

Cited by 10 publications

(5 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such a solution means a better flexibility at the cost of reduced efficiency of queries. Execution and optimisation of recursive queries is a topic of ongoing research [3,4]. Direct features to pose recursive queries were introduced into SQL yet in 1999.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

On Materializing Paths for Faster Recursive Querying

Boniewicz

Wiśniewski

Stencel

2014

Advances in Intelligent Systems and Computing

Self Cite

View full text Add to dashboard Cite

Abstract. Recursive data structures are often used in business applications. They store data on e.g. corporate hierarchies, product categories and bill-of-material. Therefore, recursive queries as introduced by SQL:1999 or formerly implemented by Oracle constitute a useful facility for application programmers. Unfortunately, recursive queries are not implemented by a number of database systems with MySQL as the most profound example. If an application has such a database as the backend storage, recursive queries will be usually hard-coded at the client side. This is not efficient. In this paper we propose using redundant data structures to answer recursive queries quicker. Such structures must be synchronized in response to updates of data. This means a significant processing overhead for updates. We present experimental evaluation to show loses and gains caused by our solution for various usage scenarios. They prove the feasibility of our proposal. We show our proof-of-concept implementation as a part of the Hibernate framework. Thus, application programmers are separated from all internals of necessary database objects and triggers. These are created automatically by Hibernate generators.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Another paradigm was voted into SQL:1999 based on recursive Common Table Expressions. It has been implemented in numerous database systems [2], while the academia worked on optimization methods for such queries [3,4,5]. However, there are still database systems whose SQL dialect does not include any recursion in queries.…”

Section: Introductionmentioning

confidence: 99%

On Materializing Paths for Faster Recursive Querying

Boniewicz

Wiśniewski

Stencel

2014

Advances in Intelligent Systems and Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Such queries have already been implemented in a significant number of database systems, both commercial and open-source [2]. Researchers developed optimization methods for recursive queries [3][4][5]. However, there are still database management systems that do not implement SQL:1999 recursive queries, e.g.…”

Section: Introductionmentioning

confidence: 98%

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

“…Later, Aho and Ulman [2] increased the expressive power of relational query languages by introducing least fix-point operator for recursive queries. Various proposals focussing on optimization of recursive queries can be found in [1,4,5,19,20].…”

Section: Introductionmentioning

confidence: 99%