Speeding up SQL subqueries via decoupling of non-correlated predicate (extended version)
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914079595036672 |
|---|---|
| author | Radivonchik, Dmitrii Kuzin, Yakov Chizhov, Anton Shcheka, Dmitriy Firsov, Mikhail Smirnov, Kirill Chernishev, George |
| author_facet | Radivonchik, Dmitrii Kuzin, Yakov Chizhov, Anton Shcheka, Dmitriy Firsov, Mikhail Smirnov, Kirill Chernishev, George |
| contents | In this paper, we discuss a novel technique for processing correlated subqueries in SQL. The core idea is to isolate the non-correlated part of the predicate and use it to reduce the number of evaluations of the correlated part. We begin by providing an overview of several classes of queries that may benefit from this technique. For each class, we propose a potential rewrite and discuss the conditions under which it is advantageous. Next, we address the evaluation aspects of the proposed rewrites: 1) we describe our approach to adapting the block-based Volcano query processing model, and 2) we discuss the benefits of implementing that technique within a position-enabled column-store with late materialization support. Finally, we present a simple cost model that allows estimation of the benefits of said rewrites.
Our evaluation has a quantitative part and a qualitative part. The former focuses on studying the impact of non-correlated predicate selectivity on our technique. The latter identifies the limitations of our approach by comparing it with alternative approaches available in existing systems. Overall, experiments conducted using PosDB (a position-enabled column-store) and PostgreSQL demonstrated that, under suitable conditions, our technique can achieve a 5x improvement. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_05907 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Speeding up SQL subqueries via decoupling of non-correlated predicate (extended version) Radivonchik, Dmitrii Kuzin, Yakov Chizhov, Anton Shcheka, Dmitriy Firsov, Mikhail Smirnov, Kirill Chernishev, George Databases Performance Software Engineering H.2.4; E.1 In this paper, we discuss a novel technique for processing correlated subqueries in SQL. The core idea is to isolate the non-correlated part of the predicate and use it to reduce the number of evaluations of the correlated part. We begin by providing an overview of several classes of queries that may benefit from this technique. For each class, we propose a potential rewrite and discuss the conditions under which it is advantageous. Next, we address the evaluation aspects of the proposed rewrites: 1) we describe our approach to adapting the block-based Volcano query processing model, and 2) we discuss the benefits of implementing that technique within a position-enabled column-store with late materialization support. Finally, we present a simple cost model that allows estimation of the benefits of said rewrites. Our evaluation has a quantitative part and a qualitative part. The former focuses on studying the impact of non-correlated predicate selectivity on our technique. The latter identifies the limitations of our approach by comparing it with alternative approaches available in existing systems. Overall, experiments conducted using PosDB (a position-enabled column-store) and PostgreSQL demonstrated that, under suitable conditions, our technique can achieve a 5x improvement. |
| title | Speeding up SQL subqueries via decoupling of non-correlated predicate (extended version) |
| topic | Databases Performance Software Engineering H.2.4; E.1 |
| url | https://arxiv.org/abs/2510.05907 |