Exhaustive greedy algorithm for optimizing intermediate result sizes of join queries
The size of the intermediate results produced while executing queries has a direct impact on query optimizers. Larger size of intermediate results requires more memory usage and more computational power to evaluate their join predicates. Furthermore, if memory size is not big enough, secondary stora...
Saved in:
Main Authors: | Areerat Trongratsameethong, Jarernsri L. Mitrpanont |
---|---|
其他作者: | Mahidol University |
格式: | Conference or Workshop Item |
出版: |
2018
|
主題: | |
在線閱讀: | https://repository.li.mahidol.ac.th/handle/123456789/27486 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Mahidol University |
相似書籍
-
Exhaustive greedy algorithm for optimizing intermediate result sizes of join queries
由: Areerat Trongratsameethong, et al.
出版: (2012) -
Join order algorithm using predefined optimal join order
由: Areerat Trongratsameethong
出版: (2018) -
Olap application development for multiple versions query in multidimensional database systems
由: Jarernsri L. Mitrpanont, et al.
出版: (2018) -
Query processing algorithms for temporal intersection joins
由: Gunadhi, Himawan, et al.
出版: (2013) -
An algorithm for resolving the join component selection problem in parallel join optimization
由: Esquivel, J., et al.
出版: (2002)