[PERFORM] "Mysterious" - Dynamic Programming X GEQO

Hi!!! I'm evaluating the performance of algorithms for optimization of queries. I am comparing results between the algorithm of Dynamic Programming and GEQO algorithm. I use the base and queries provided by the benchmark OSDL DBT3 with scale factor = 1. The queries were submitted randomly, I did

[PERFORM] Explain Analyze - Total runtime very differentes

Hello friends ... I'm evaluating the performance of algorithms for optimization of queries. I am comparing results between the algorithm of Dynamic Programming and an implementation of Kruskal's algorithm. When submitting a query that makes reference to only 2 tables of my base, logically the same

[PERFORM] Difference between "Explain analyze" and "\timing"

Hello friends The commands "\timing" and "EXPLAIN ANALYZE" return values related to the time of execution of the instruction. These values are "Time:" and "Total runtime:" respectively. What is the difference between these values, and the specific use of each command in queries? If someone can he

[PERFORM] GEQO Benchmark

Hi all, I'm using the TPC-H Benchmark for testing of performance in PostgreSQL. But it is composed of only 8 tables, which is not enough to call the GEQO algorithm. I don't want to change any of the 22 queries provided by the TPC-H to call the GEQO, and not lose the credibility of the TPC's tool.