Optimized Query Evaluation Using Cooperative Sorts

— 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.

• Type: Conference
• Year: 2010
• Where: ICDE
• Authors: Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-Lee Tan
• Keywords: Computer Science, Cooperative Sort, ICDE 2010, Multiple Sort Orders, Sort Operations