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 |
---|---|
Other Authors: | Mahidol University |
Format: | Conference or Workshop Item |
Published: |
2018
|
Subjects: | |
Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/27486 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Mahidol University |
Similar Items
-
Exhaustive greedy algorithm for optimizing intermediate result sizes of join queries
by: Areerat Trongratsameethong, et al.
Published: (2012) -
Join order algorithm using predefined optimal join order
by: Areerat Trongratsameethong
Published: (2018) -
Olap application development for multiple versions query in multidimensional database systems
by: Jarernsri L. Mitrpanont, et al.
Published: (2018) -
Query processing algorithms for temporal intersection joins
by: Gunadhi, Himawan, et al.
Published: (2013) -
An algorithm for resolving the join component selection problem in parallel join optimization
by: Esquivel, J., et al.
Published: (2002)