Please use this identifier to cite or link to this item:
|Title:||Optimized query evaluation using cooperative sorts|
|Source:||Cao, Y., Bramandia, R., Chan, C.-Y., Tan, K.-L. (2010). Optimized query evaluation using cooperative sorts. Proceedings - International Conference on Data Engineering : 601-612. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2010.5447894|
|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. © 2010 IEEE.|
|Source Title:||Proceedings - International Conference on Data Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 6, 2017
WEB OF SCIENCETM
checked on Nov 19, 2017
checked on Dec 10, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.