explain.depesz.com

A tool for finding a real cause for slow queries.

Result: pXQ : Q1

options
# exclusive inclusive rows x rows loops node
1. 0.000 0.000 ↓ 0.0
→

HashAggregate (cost=7209.77..7209.80 rows=1 width=335) (actual time=.. rows= loops=)

  • Filter: ((sum(serv.imps_served) >= 0::numeric) AND (sum(serv.click_served) >= 0::numeric) AND (sum(serv.views_served) >= 0::numeric))
2. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7209.66 rows=1 width=335) (actual time=.. rows= loops=)

  • Join Filter: (os.os_id = serv.os)
3. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7207.40 rows=1 width=333) (actual time=.. rows= loops=)

  • Join Filter: (o.customer_id = serv.customer_id)
4. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7199.11 rows=1 width=337) (actual time=.. rows= loops=)

5. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7190.83 rows=1 width=331) (actual time=.. rows= loops=)

6. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7182.55 rows=1 width=325) (actual time=.. rows= loops=)

7. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7174.27 rows=1 width=319) (actual time=.. rows= loops=)

8. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7165.98 rows=1 width=313) (actual time=.. rows= loops=)

9. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7157.70 rows=1 width=307) (actual time=.. rows= loops=)

10. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7149.42 rows=1 width=301) (actual time=.. rows= loops=)

11. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7141.14 rows=1 width=295) (actual time=.. rows= loops=)

  • Join Filter: (fl.customer_id = serv.customer_id)
12. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=7117.32..7132.85 rows=1 width=291) (actual time=.. rows= loops=)

  • Join Filter: (adt.customer_id = serv.customer_id)
13. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=7117.32..7124.57 rows=1 width=245) (actual time=.. rows= loops=)

  • Hash Cond: (brw.browser_id = serv.browser)
14. 0.000 0.000 ↓ 0.0
→

Seq Scan on browser brw (cost=0.00..6.08 rows=308 width=15) (actual time=.. rows= loops=)

15. 0.000 0.000 ↓ 0.0
→

Hash (cost=7117.31..7117.31 rows=1 width=238) (actual time=.. rows= loops=)

16. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=7111.92..7117.31 rows=1 width=238) (actual time=.. rows= loops=)

  • Hash Cond: ((adsz.customer_id = serv.customer_id) AND (adsz.adsize_id = ads.adsize_id))
17. 0.000 0.000 ↓ 0.0
→

Seq Scan on adsizes adsz (cost=0.00..5.06 rows=43 width=31) (actual time=.. rows= loops=)

  • Filter: (customer_id = 11)
18. 0.000 0.000 ↓ 0.0
→

Hash (cost=7111.90..7111.90 rows=1 width=219) (actual time=.. rows= loops=)

19. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=7109.69..7111.90 rows=1 width=219) (actual time=.. rows= loops=)

  • Hash Cond: ((l0.customer_id = serv.customer_id) AND (m.mediapoint_id = serv.mediapoint_id))
20. 0.000 0.000 ↓ 0.0
→

HashAggregate (cost=7082.14..7082.94 rows=80 width=40) (actual time=.. rows= loops=)

21. 0.000 0.000 ↓ 0.0
→

Append (cost=8.28..7080.14 rows=80 width=40) (actual time=.. rows= loops=)

22. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=8.28..884.92 rows=10 width=40) (actual time=.. rows= loops=)

23. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..305.11 rows=1 width=36) (actual time=.. rows= loops=)

24. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..272.87 rows=1 width=32) (actual time=.. rows= loops=)

25. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..240.62 rows=1 width=28) (actual time=.. rows= loops=)

26. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..208.37 rows=1 width=24) (actual time=.. rows= loops=)

27. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..176.13 rows=1 width=20) (actual time=.. rows= loops=)

28. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..143.88 rows=1 width=16) (actual time=.. rows= loops=)

29. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=8.28..111.64 rows=1 width=12) (actual time=.. rows= loops=)

  • Hash Cond: (l1.parent_node_id = l0.node_id)
30. 0.000 0.000 ↓ 0.0
→

Seq Scan on nodes l1 (cost=0.00..87.43 rows=4243 width=8) (actual time=.. rows= loops=)

31. 0.000 0.000 ↓ 0.0
→

Hash (cost=8.27..8.27 rows=1 width=8) (actual time=.. rows= loops=)

32. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l0 (cost=0.00..8.27 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: ((customer_id = 11) AND (parent_node_id IS NULL))
33. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l2 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l1.node_id = parent_node_id)
34. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l3 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l2.node_id = parent_node_id)
35. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l4 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l3.node_id = parent_node_id)
36. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l5 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l4.node_id = parent_node_id)
37. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l6 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l5.node_id = parent_node_id)
38. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l7 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l6.node_id = parent_node_id)
39. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_mpoints_pid on mediapoints m (cost=0.00..579.68 rows=10 width=8) (actual time=.. rows= loops=)

  • Index Cond: (parent_node_id = COALESCE(l0.node_id, (-1)))
40. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=8.28..884.92 rows=10 width=40) (actual time=.. rows= loops=)

41. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..305.11 rows=1 width=36) (actual time=.. rows= loops=)

42. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..272.87 rows=1 width=32) (actual time=.. rows= loops=)

43. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..240.62 rows=1 width=28) (actual time=.. rows= loops=)

44. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..208.37 rows=1 width=24) (actual time=.. rows= loops=)

45. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..176.13 rows=1 width=20) (actual time=.. rows= loops=)

46. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..143.88 rows=1 width=16) (actual time=.. rows= loops=)

47. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=8.28..111.64 rows=1 width=12) (actual time=.. rows= loops=)

  • Hash Cond: (l1.parent_node_id = l0.node_id)
48. 0.000 0.000 ↓ 0.0
→

Seq Scan on nodes l1 (cost=0.00..87.43 rows=4243 width=8) (actual time=.. rows= loops=)

49. 0.000 0.000 ↓ 0.0
→

Hash (cost=8.27..8.27 rows=1 width=8) (actual time=.. rows= loops=)

50. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l0 (cost=0.00..8.27 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: ((customer_id = 11) AND (parent_node_id IS NULL))
51. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l2 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l1.node_id = parent_node_id)
52. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l3 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l2.node_id = parent_node_id)
53. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l4 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l3.node_id = parent_node_id)
54. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l5 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l4.node_id = parent_node_id)
55. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l6 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l5.node_id = parent_node_id)
56. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l7 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l6.node_id = parent_node_id)
57. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_mpoints_pid on mediapoints m (cost=0.00..579.68 rows=10 width=8) (actual time=.. rows= loops=)

  • Index Cond: (parent_node_id = COALESCE(l1.node_id, (-1)))
58. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=8.28..884.92 rows=10 width=40) (actual time=.. rows= loops=)

59. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..305.11 rows=1 width=36) (actual time=.. rows= loops=)

60. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..272.87 rows=1 width=32) (actual time=.. rows= loops=)

61. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..240.62 rows=1 width=28) (actual time=.. rows= loops=)

62. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..208.37 rows=1 width=24) (actual time=.. rows= loops=)

63. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..176.13 rows=1 width=20) (actual time=.. rows= loops=)

64. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..143.88 rows=1 width=16) (actual time=.. rows= loops=)

65. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=8.28..111.64 rows=1 width=12) (actual time=.. rows= loops=)

  • Hash Cond: (l1.parent_node_id = l0.node_id)
66. 0.000 0.000 ↓ 0.0
→

Seq Scan on nodes l1 (cost=0.00..87.43 rows=4243 width=8) (actual time=.. rows= loops=)

67. 0.000 0.000 ↓ 0.0
→

Hash (cost=8.27..8.27 rows=1 width=8) (actual time=.. rows= loops=)

68. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l0 (cost=0.00..8.27 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: ((customer_id = 11) AND (parent_node_id IS NULL))
69. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l2 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l1.node_id = parent_node_id)
70. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l3 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l2.node_id = parent_node_id)
71. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l4 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l3.node_id = parent_node_id)
72. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l5 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l4.node_id = parent_node_id)
73. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l6 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l5.node_id = parent_node_id)
74. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l7 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l6.node_id = parent_node_id)
75. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_mpoints_pid on mediapoints m (cost=0.00..579.68 rows=10 width=8) (actual time=.. rows= loops=)

  • Index Cond: (parent_node_id = COALESCE(l2.node_id, (-1)))
76. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=8.28..884.92 rows=10 width=40) (actual time=.. rows= loops=)

77. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..305.11 rows=1 width=36) (actual time=.. rows= loops=)

78. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..272.87 rows=1 width=32) (actual time=.. rows= loops=)

79. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..240.62 rows=1 width=28) (actual time=.. rows= loops=)

80. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..208.37 rows=1 width=24) (actual time=.. rows= loops=)

81. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..176.13 rows=1 width=20) (actual time=.. rows= loops=)

82. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..143.88 rows=1 width=16) (actual time=.. rows= loops=)

83. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=8.28..111.64 rows=1 width=12) (actual time=.. rows= loops=)

  • Hash Cond: (l1.parent_node_id = l0.node_id)
84. 0.000 0.000 ↓ 0.0
→

Seq Scan on nodes l1 (cost=0.00..87.43 rows=4243 width=8) (actual time=.. rows= loops=)

85. 0.000 0.000 ↓ 0.0
→

Hash (cost=8.27..8.27 rows=1 width=8) (actual time=.. rows= loops=)

86. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l0 (cost=0.00..8.27 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: ((customer_id = 11) AND (parent_node_id IS NULL))
87. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l2 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l1.node_id = parent_node_id)
88. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l3 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l2.node_id = parent_node_id)
89. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l4 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l3.node_id = parent_node_id)
90. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l5 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l4.node_id = parent_node_id)
91. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l6 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l5.node_id = parent_node_id)
92. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l7 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l6.node_id = parent_node_id)
93. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_mpoints_pid on mediapoints m (cost=0.00..579.68 rows=10 width=8) (actual time=.. rows= loops=)

  • Index Cond: (parent_node_id = COALESCE(l3.node_id, (-1)))
94. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=8.28..884.92 rows=10 width=40) (actual time=.. rows= loops=)

95. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..305.11 rows=1 width=36) (actual time=.. rows= loops=)

96. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..272.87 rows=1 width=32) (actual time=.. rows= loops=)

97. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..240.62 rows=1 width=28) (actual time=.. rows= loops=)

98. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..208.37 rows=1 width=24) (actual time=.. rows= loops=)

99. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..176.13 rows=1 width=20) (actual time=.. rows= loops=)

100. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..143.88 rows=1 width=16) (actual time=.. rows= loops=)

101. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=8.28..111.64 rows=1 width=12) (actual time=.. rows= loops=)

  • Hash Cond: (l1.parent_node_id = l0.node_id)
102. 0.000 0.000 ↓ 0.0
→

Seq Scan on nodes l1 (cost=0.00..87.43 rows=4243 width=8) (actual time=.. rows= loops=)

103. 0.000 0.000 ↓ 0.0
→

Hash (cost=8.27..8.27 rows=1 width=8) (actual time=.. rows= loops=)

104. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l0 (cost=0.00..8.27 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: ((customer_id = 11) AND (parent_node_id IS NULL))
105. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l2 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l1.node_id = parent_node_id)
106. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l3 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l2.node_id = parent_node_id)
107. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l4 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l3.node_id = parent_node_id)
108. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l5 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l4.node_id = parent_node_id)
109. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l6 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l5.node_id = parent_node_id)
110. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l7 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l6.node_id = parent_node_id)
111. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_mpoints_pid on mediapoints m (cost=0.00..579.68 rows=10 width=8) (actual time=.. rows= loops=)

  • Index Cond: (parent_node_id = COALESCE(l4.node_id, (-1)))
112. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=8.28..884.92 rows=10 width=40) (actual time=.. rows= loops=)

113. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..305.11 rows=1 width=36) (actual time=.. rows= loops=)

114. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..272.87 rows=1 width=32) (actual time=.. rows= loops=)

115. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..240.62 rows=1 width=28) (actual time=.. rows= loops=)

116. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..208.37 rows=1 width=24) (actual time=.. rows= loops=)

117. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..176.13 rows=1 width=20) (actual time=.. rows= loops=)

118. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..143.88 rows=1 width=16) (actual time=.. rows= loops=)

119. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=8.28..111.64 rows=1 width=12) (actual time=.. rows= loops=)

  • Hash Cond: (l1.parent_node_id = l0.node_id)
120. 0.000 0.000 ↓ 0.0
→

Seq Scan on nodes l1 (cost=0.00..87.43 rows=4243 width=8) (actual time=.. rows= loops=)

121. 0.000 0.000 ↓ 0.0
→

Hash (cost=8.27..8.27 rows=1 width=8) (actual time=.. rows= loops=)

122. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l0 (cost=0.00..8.27 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: ((customer_id = 11) AND (parent_node_id IS NULL))
123. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l2 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l1.node_id = parent_node_id)
124. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l3 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l2.node_id = parent_node_id)
125. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l4 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l3.node_id = parent_node_id)
126. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l5 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l4.node_id = parent_node_id)
127. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l6 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l5.node_id = parent_node_id)
128. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l7 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l6.node_id = parent_node_id)
129. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_mpoints_pid on mediapoints m (cost=0.00..579.68 rows=10 width=8) (actual time=.. rows= loops=)

  • Index Cond: (parent_node_id = COALESCE(l5.node_id, (-1)))
130. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=8.28..884.92 rows=10 width=40) (actual time=.. rows= loops=)

131. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..305.11 rows=1 width=36) (actual time=.. rows= loops=)

132. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..272.87 rows=1 width=32) (actual time=.. rows= loops=)

133. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..240.62 rows=1 width=28) (actual time=.. rows= loops=)

134. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..208.37 rows=1 width=24) (actual time=.. rows= loops=)

135. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..176.13 rows=1 width=20) (actual time=.. rows= loops=)

136. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..143.88 rows=1 width=16) (actual time=.. rows= loops=)

137. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=8.28..111.64 rows=1 width=12) (actual time=.. rows= loops=)

  • Hash Cond: (l1.parent_node_id = l0.node_id)
138. 0.000 0.000 ↓ 0.0
→

Seq Scan on nodes l1 (cost=0.00..87.43 rows=4243 width=8) (actual time=.. rows= loops=)

139. 0.000 0.000 ↓ 0.0
→

Hash (cost=8.27..8.27 rows=1 width=8) (actual time=.. rows= loops=)

140. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l0 (cost=0.00..8.27 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: ((customer_id = 11) AND (parent_node_id IS NULL))
141. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l2 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l1.node_id = parent_node_id)
142. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l3 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l2.node_id = parent_node_id)
143. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l4 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l3.node_id = parent_node_id)
144. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l5 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l4.node_id = parent_node_id)
145. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l6 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l5.node_id = parent_node_id)
146. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l7 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l6.node_id = parent_node_id)
147. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_mpoints_pid on mediapoints m (cost=0.00..579.68 rows=10 width=8) (actual time=.. rows= loops=)

  • Index Cond: (parent_node_id = COALESCE(l6.node_id, (-1)))
148. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=8.28..884.92 rows=10 width=40) (actual time=.. rows= loops=)

149. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..305.11 rows=1 width=36) (actual time=.. rows= loops=)

150. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..272.87 rows=1 width=32) (actual time=.. rows= loops=)

151. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..240.62 rows=1 width=28) (actual time=.. rows= loops=)

152. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..208.37 rows=1 width=24) (actual time=.. rows= loops=)

153. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..176.13 rows=1 width=20) (actual time=.. rows= loops=)

154. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=8.28..143.88 rows=1 width=16) (actual time=.. rows= loops=)

155. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=8.28..111.64 rows=1 width=12) (actual time=.. rows= loops=)

  • Hash Cond: (l1.parent_node_id = l0.node_id)
156. 0.000 0.000 ↓ 0.0
→

Seq Scan on nodes l1 (cost=0.00..87.43 rows=4243 width=8) (actual time=.. rows= loops=)

157. 0.000 0.000 ↓ 0.0
→

Hash (cost=8.27..8.27 rows=1 width=8) (actual time=.. rows= loops=)

158. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l0 (cost=0.00..8.27 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: ((customer_id = 11) AND (parent_node_id IS NULL))
159. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l2 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l1.node_id = parent_node_id)
160. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l3 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l2.node_id = parent_node_id)
161. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l4 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l3.node_id = parent_node_id)
162. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l5 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l4.node_id = parent_node_id)
163. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l6 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l5.node_id = parent_node_id)
164. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_nodes_pid on nodes l7 (cost=0.00..32.20 rows=4 width=8) (actual time=.. rows= loops=)

  • Index Cond: (l6.node_id = parent_node_id)
165. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_mpoints_pid on mediapoints m (cost=0.00..579.68 rows=10 width=8) (actual time=.. rows= loops=)

  • Index Cond: (parent_node_id = COALESCE(l7.node_id, (-1)))
166. 0.000 0.000 ↓ 0.0
→

Hash (cost=27.53..27.53 rows=1 width=195) (actual time=.. rows= loops=)

167. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=0.00..27.53 rows=1 width=195) (actual time=.. rows= loops=)

  • Join Filter: (ads.customer_id = serv.customer_id)
168. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=0.00..19.25 rows=1 width=152) (actual time=.. rows= loops=)

  • Join Filter: (sf.customer_id = serv.customer_id)
169. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_servdfh_cid on served_full_h serv (cost=0.00..10.96 rows=1 width=63) (actual time=.. rows= loops=)

  • Index Cond: (customer_id = 11)
  • Filter: ((date >= '2012-02-01'::date) AND (date <= '2012-03-20'::date))
170. 0.000 0.000 ↓ 0.0
→

Index Scan using subflights_pkey on subflights sf (cost=0.00..8.27 rows=1 width=97) (actual time=.. rows= loops=)

  • Index Cond: (subflight_id = serv.subflight_id)
  • Filter: (customer_id = 11)
171. 0.000 0.000 ↓ 0.0
→

Index Scan using ads_pkey on ads (cost=0.00..8.27 rows=1 width=51) (actual time=.. rows= loops=)

  • Index Cond: (ad_id = serv.ad_id)
  • Filter: (customer_id = 11)
172. 0.000 0.000 ↓ 0.0
→

Index Scan using adtpl_pkey on adtpls adt (cost=0.00..8.27 rows=1 width=58) (actual time=.. rows= loops=)

  • Index Cond: (ads.adtpl_id = adtpl_id)
  • Filter: (customer_id = 11)
173. 0.000 0.000 ↓ 0.0
→

Index Scan using flights_pkey on flights fl (cost=0.00..8.27 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: (flight_id = sf.subflight_id)
  • Filter: (customer_id = 11)
174. 0.000 0.000 ↓ 0.0
→

Index Scan using nodes_pkey on nodes n1 (cost=0.00..8.27 rows=1 width=14) (actual time=.. rows= loops=)

  • Index Cond: (node_id = (min((COALESCE(l0.node_id, (-1))))))
175. 0.000 0.000 ↓ 0.0
→

Index Scan using nodes_pkey on nodes n2 (cost=0.00..8.27 rows=1 width=14) (actual time=.. rows= loops=)

  • Index Cond: (node_id = (min((COALESCE(l1.node_id, (-1))))))
176. 0.000 0.000 ↓ 0.0
→

Index Scan using nodes_pkey on nodes n3 (cost=0.00..8.27 rows=1 width=14) (actual time=.. rows= loops=)

  • Index Cond: (node_id = (min((COALESCE(l2.node_id, (-1))))))
177. 0.000 0.000 ↓ 0.0
→

Index Scan using nodes_pkey on nodes n4 (cost=0.00..8.27 rows=1 width=14) (actual time=.. rows= loops=)

  • Index Cond: (node_id = (min((COALESCE(l3.node_id, (-1))))))
178. 0.000 0.000 ↓ 0.0
→

Index Scan using nodes_pkey on nodes n5 (cost=0.00..8.27 rows=1 width=14) (actual time=.. rows= loops=)

  • Index Cond: (node_id = (min((COALESCE(l4.node_id, (-1))))))
179. 0.000 0.000 ↓ 0.0
→

Index Scan using nodes_pkey on nodes n6 (cost=0.00..8.27 rows=1 width=14) (actual time=.. rows= loops=)

  • Index Cond: (node_id = (min((COALESCE(l5.node_id, (-1))))))
180. 0.000 0.000 ↓ 0.0
→

Index Scan using nodes_pkey on nodes n7 (cost=0.00..8.27 rows=1 width=14) (actual time=.. rows= loops=)

  • Index Cond: (node_id = (min((COALESCE(l6.node_id, (-1))))))
181. 0.000 0.000 ↓ 0.0
→

Index Scan using orders_pkey on orders o (cost=0.00..8.27 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: (id = sf.order_id)
  • Filter: (customer_id = 11)
182. 0.000 0.000 ↓ 0.0
→

Seq Scan on os (cost=0.00..1.56 rows=56 width=10) (actual time=.. rows= loops=)