๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the 35th SIGMOD international conference - Providence, Rhode Island, USA (2009.06.29-2009.07.02)] Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09 - Query optimizers

โœ Scribed by Chaudhuri, Surajit


Book ID
125506961
Publisher
ACM Press
Year
2009
Weight
526 KB
Category
Article
ISBN
1605585513

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press the 35th SIGMOD international
โœ Neumann, Thomas ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› ACM Press โš– 492 KB

Join ordering is one of the most important, but also most challenging problems of query optimization. In general finding the optimal join order is NP-hard. Existing dynamic programming algorithms exhibit exponential runtime even for the restricted, but highly relevant class of star joins. Therefore,