树形查询的优化(三)
5 - filter("B"."TDL_OPERATION"<>2)
11 - filter("T"."TDL_OPERATION"<>2 AND EXISTS (SELECT 0 FROM (SELECT /*+ CACHE_TEMP_TABLE ("T1") */ "C0" "TDL_DN"
FROM "SYS"."SYS_TEMP_0FD9D6664_D65E0" "T1") "A" WHERE "A"."TDL_DN"=:B1))
12 - access("T"."TDL_A_DN"=PRIOR "T"."TDL_Z_DN")
13 - access("T"."TDL_A_DN"="B"."TDL_DN")
18 - access("connect$_by$_pump$_011"."prior t.tdl_z_dn "="T"."TDL_A_DN")
22 - filter("A"."TDL_DN"=:B1)
42 rows selected.
优化完毕之后，这些SQL，前3个能在 5分钟内跑完，最后一个能在10分钟内跑完， 最终一共耗时 25分钟左右，之前是2个班小时，他终于能给 澳大利亚鸟人交差了 嘎嘎。