The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering (ICDE) (2010)
Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
ISBN: 978-1-4244-5445-7
pp: 601-612
Yu Cao , Department of Computer Science, National University of Singapore
Kian-Lee Tan , Department of Computer Science, National University of Singapore
Chee-Yong Chan , Department of Computer Science, National University of Singapore
Ramadhana Bramandia , Department of Computer Science, National University of Singapore
ABSTRACT
Many applications require sorting a table over multiple sort orders: 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 multiple sortings of a table can be efficiently performed. We introduce a new evaluation technique, called cooperative sort, that exploits the relationships among the input set of sort orders to minimize I/O operations for the collection of sort operations. To demonstrate the efficiency of the proposed scheme, we implemented it in PostgreSQL and evaluated its performance using both TPC-DS benchmark and synthetic data. Our experimental results show significant performance improvement over the traditional non-cooperative sorting scheme.
INDEX TERMS
CITATION
Yu Cao, Kian-Lee Tan, Chee-Yong Chan, Ramadhana Bramandia, "Optimized query evaluation using cooperative sorts", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 601-612, 2010, doi:10.1109/ICDE.2010.5447894
112 ms
(Ver )