Please use this identifier to cite or link to this item:
|Title:||On the optimality of strategies for multiple joins||Authors:||Tay, Y.C.||Issue Date:||Apr-1990||Citation:||Tay, Y.C. (1990-04). On the optimality of strategies for multiple joins. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2-4) : 124-131. ScholarBank@NUS Repository.||Abstract:||One heuristic that is common in the evaluation of multiple joins is the use of linear strategies. Another common heuristic is to avoid cartesian products; this is because cartesian products produce spurious tuples that have to be eliminated eventually. The purpose of the above heuristics is to restrict, for the sake of tractability, the query optimizer's search for a strategy to a small subspace of the entire strategy space. However, this restriction may also exclude the optimum strategy from the subspace. For example, experiments have shown that for large queries, the cheapest linear strategy could significantly more expensive than the cheapest possible (nonlinear) strategy. The following question thus arises naturally: Under what conditions would the cheapest strategy in a searched subspace be optimum among all strategies? This is a variation of an open problem and is the issue addressed by this paper.||Source Title:||Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/104664|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.