2011
DOI: 10.1007/s00778-011-0251-9
|View full text |Cite
|
Sign up to set email alerts
|

Sort-sharing-aware query processing

Abstract: Many database applications require sorting a table (or relation) over multiple sort orders. Some examples include creation of multiple indices on a relation, generation of multiple reports from a table, evaluation of a complex query that involves multiple instances of a relation, and batch processing of a set of queries. In this paper, we study how to optimize multiple sortings of a table. We investigate the correlation between sort orders and exploit sort-sharing techniques of reusing the (partial) work done … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 26 publications
0
2
0
Order By: Relevance
“…And they proved that it is an NP-hard problem to find the optimal sequence to avoid repeated sorting for multiple window functions in one query and provided a heuristic method. Other earlier studies, such as [9,17,18] and [19], made a lot of contributions with regard to the ORDER BY clause and GROUP BY clause and they proposed optimization algorithms based on either the function dependencies or the reuse of the intermediate results.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…And they proved that it is an NP-hard problem to find the optimal sequence to avoid repeated sorting for multiple window functions in one query and provided a heuristic method. Other earlier studies, such as [9,17,18] and [19], made a lot of contributions with regard to the ORDER BY clause and GROUP BY clause and they proposed optimization algorithms based on either the function dependencies or the reuse of the intermediate results.…”
Section: Related Workmentioning
confidence: 99%
“…While some pioneering works are focusing on improving the time efficiency of executing window functions [7][8][9][10][11], the speed improvements cannot keep up with the evergrowing data size generated by modern applications, and none of them can meet the requirement of real-time processing which is vital to online services.…”
Section: Introductionmentioning
confidence: 99%