Which sort orders are interesting?

Guravannavar, R and Sudarshan, S and Diwan, A A and Ch, Sobhan Babu (2012) Which sort orders are interesting? VLDB Journal, 21 (1). pp. 145-165. ISSN 1066-8888

Full text not available from this repository. (Request a copy)


Sort orders play an important role in query evaluation. Algorithms that rely on sorting are widely used to implement joins, grouping, duplicate elimination and other set operations. The notion of interesting orders has allowed query optimizers to consider plans that could be locally sub-optimal, but produce ordered output beneficial for other operators, and thus be part of a globally optimal plan. However, the number of interesting orders for most operators is factorial in the number of attributes involved. Optimizer implementations use heuristics to prune the number of interesting orders, but the quality of the heuristics is unclear. Increasingly complex decision support queries and increasing use of query-covering indices, which provide multiple alternative sort orders for relations, motivate us to better address the problem of choosing interesting orders. We show that even a simplified version of the problem is NP-hard and provide a 1/2-benefit approximation algorithm for a special case of the problem. We then present principled heuristics for the general case of choosing interesting orders. We have implemented the proposed techniques in a Volcano-style cost-based optimizer, and our performance study shows significant improvements in estimated cost. We also executed our plans on a widely used commercial database system, and on PostgreSQL, and found that actual execution times for our plans were significantly better than for plans generated by those systems in several cases.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Item Type: Article
Uncontrolled Keywords: Query optimization; Sort orders; Commercial database system; Complex decision; Duplicate elimination; Estimated costs; Execution time; NP-hard; Optimal plan; Optimizers; Performance study; PostgreSQL; Query evaluation; Query optimization; Set operation; Sort orders
Subjects: Computer science > Computer programming, programs, data
Divisions: Department of Computer Science & Engineering
Depositing User: Users 3 not found.
Date Deposited: 14 Oct 2014 08:01
Last Modified: 22 Feb 2016 05:55
URI: http://raiith.iith.ac.in/id/eprint/468
Publisher URL: http://dx.doi.org/10.1007/s00778-011-0240-z
OA policy: http://www.sherpa.ac.uk/romeo/issn/1066-8888/
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 468 Statistics for this ePrint Item