explain.depesz.com

A tool for finding a real cause for slow queries.

Result: Y0E

options
Did it help? Consider supporting us - Bitcoin address: 12v2hUztAk2LgzQ9H9LMwuU32urHMjZQnq
# exclusive inclusive rows x rows loops node
1. 0.000 0.000 ↓ 0.0

Aggregate (cost=7317.98..7317.99 rows=1 width=220) (actual time=.. rows= loops=)

2. 0.000 0.000 ↓ 0.0

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

  • Join Filter: (d.docid = qdr.docid)
3. 0.000 0.000 ↓ 0.0

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

  • Join Filter: (d.docid = dm.docid)
4. 0.000 0.000 ↓ 0.0

Index Scan using pk_documents on documents d (cost=0.00..33.26 rows=1 width=186) (actual time=.. rows= loops=)

  • Index Cond: (docid = 137956215)
5. 0.000 0.000 ↓ 0.0

Index Scan using metadocid_idx on documentmetadata dm (cost=0.00..12.07 rows=1 width=38) (actual time=.. rows= loops=)

  • Index Cond: (docid = 137956215)
  • Filter: (type = 'product_name'::text)
6. 0.000 0.000 ↓ 0.0

Seq Scan on querydocumentrelevance qdr (cost=0.00..2.92 rows=1 width=12) (actual time=.. rows= loops=)

  • Filter: ((docid = 137956215) AND (queryid = 2303))
7.          

SubPlan (forAggregate)

8. 0.000 0.000 ↓ 0.0

Result (cost=7269.68..7269.69 rows=1 width=0) (actual time=.. rows= loops=)

9.          

Initplan (forResult)

10. 0.000 0.000 ↓ 0.0

Aggregate (cost=4817.66..4817.67 rows=1 width=121) (actual time=.. rows= loops=)

11. 0.000 0.000 ↓ 0.0

HashAggregate (cost=4817.55..4817.59 rows=4 width=105) (actual time=.. rows= loops=)

12. 0.000 0.000 ↓ 0.0

Append (cost=941.37..4817.48 rows=4 width=105) (actual time=.. rows= loops=)

13. 0.000 0.000 ↓ 0.0

Nested Loop (cost=941.37..1966.01 rows=2 width=118) (actual time=.. rows= loops=)

14. 0.000 0.000 ↓ 0.0

Subquery Scan on "ANY_subquery" (cost=941.37..1833.81 rows=2 width=8) (actual time=.. rows= loops=)

15. 0.000 0.000 ↓ 0.0

HashSetOp Except (cost=941.37..1833.79 rows=2 width=8) (actual time=.. rows= loops=)

16. 0.000 0.000 ↓ 0.0

Append (cost=941.37..1833.78 rows=3 width=8) (actual time=.. rows= loops=)

17. 0.000 0.000 ↓ 0.0

Subquery Scan on "*SELECT* 1" (cost=941.37..981.63 rows=2 width=8) (actual time=.. rows= loops=)

18. 0.000 0.000 ↓ 0.0

Bitmap Heap Scan on sentences (cost=941.37..981.61 rows=2 width=8) (actual time=.. rows= loops=)

  • Recheck Cond: (sentenceid = ANY ($6))
  • Filter: ((polarityconfidence >= 0::double precision) AND (objectivityconfidence >= 0::double precision))
19.          

Initplan (forBitmap Heap Scan)

20. 0.000 0.000 ↓ 0.0

Index Scan using sentdocs on sentences (cost=0.00..840.96 rows=259 width=8) (actual time=.. rows= loops=)

  • Index Cond: (docid = d.docid)
21. 0.000 0.000 ↓ 0.0

Bitmap Index Scan on pk_sentences (cost=0.00..100.41 rows=10 width=0) (actual time=.. rows= loops=)

  • Index Cond: (sentenceid = ANY ($6))
22. 0.000 0.000 ↓ 0.0

Subquery Scan on "*SELECT* 2" (cost=840.96..852.15 rows=1 width=8) (actual time=.. rows= loops=)

23. 0.000 0.000 ↓ 0.0

Index Scan using idx_qspoqid on querysentencepolarityoverride (cost=840.96..852.14 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: (queryid = 2303)
  • Filter: (sentenceid = ANY ($7))
24.          

Initplan (forIndex Scan)

25. 0.000 0.000 ↓ 0.0

Index Scan using sentdocs on sentences (cost=0.00..840.96 rows=259 width=8) (actual time=.. rows= loops=)

  • Index Cond: (docid = d.docid)
26. 0.000 0.000 ↓ 0.0

Index Scan using pk_sentences on sentences (cost=0.00..66.09 rows=1 width=118) (actual time=.. rows= loops=)

  • Index Cond: (sentenceid = "ANY_subquery".sentenceid)
27. 0.000 0.000 ↓ 0.0

Subquery Scan on "*SELECT* 2" (cost=941.37..1899.90 rows=1 width=84) (actual time=.. rows= loops=)

28. 0.000 0.000 ↓ 0.0

Nested Loop (cost=941.37..1899.89 rows=1 width=84) (actual time=.. rows= loops=)

29. 0.000 0.000 ↓ 0.0

Subquery Scan on "ANY_subquery" (cost=941.37..1833.79 rows=1 width=8) (actual time=.. rows= loops=)

30. 0.000 0.000 ↓ 0.0

HashSetOp Except (cost=941.37..1833.78 rows=1 width=8) (actual time=.. rows= loops=)

31. 0.000 0.000 ↓ 0.0

Append (cost=941.37..1833.77 rows=2 width=8) (actual time=.. rows= loops=)

32. 0.000 0.000 ↓ 0.0

Subquery Scan on "*SELECT* 1" (cost=941.37..981.62 rows=1 width=8) (actual time=.. rows= loops=)

33. 0.000 0.000 ↓ 0.0

Bitmap Heap Scan on sentences (cost=941.37..981.61 rows=1 width=8) (actual time=.. rows= loops=)

  • Recheck Cond: (sentenceid = ANY ($3))
  • Filter: ((polarityconfidence < 0::double precision) OR (objectivityconfidence < 0::double precision))
34.          

Initplan (forBitmap Heap Scan)

35. 0.000 0.000 ↓ 0.0

Index Scan using sentdocs on sentences (cost=0.00..840.96 rows=259 width=8) (actual time=.. rows= loops=)

  • Index Cond: (docid = d.docid)
36. 0.000 0.000 ↓ 0.0

Bitmap Index Scan on pk_sentences (cost=0.00..100.41 rows=10 width=0) (actual time=.. rows= loops=)

  • Index Cond: (sentenceid = ANY ($3))
37. 0.000 0.000 ↓ 0.0

Subquery Scan on "*SELECT* 2" (cost=840.96..852.15 rows=1 width=8) (actual time=.. rows= loops=)

38. 0.000 0.000 ↓ 0.0

Index Scan using idx_qspoqid on querysentencepolarityoverride (cost=840.96..852.14 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: (queryid = 2303)
  • Filter: (sentenceid = ANY ($4))
39.          

Initplan (forIndex Scan)

40. 0.000 0.000 ↓ 0.0

Index Scan using sentdocs on sentences (cost=0.00..840.96 rows=259 width=8) (actual time=.. rows= loops=)

  • Index Cond: (docid = d.docid)
41. 0.000 0.000 ↓ 0.0

Index Scan using pk_sentences on sentences (cost=0.00..66.09 rows=1 width=84) (actual time=.. rows= loops=)

  • Index Cond: (sentenceid = "ANY_subquery".sentenceid)
42. 0.000 0.000 ↓ 0.0

Subquery Scan on "*SELECT* 3" (cost=918.27..951.55 rows=1 width=100) (actual time=.. rows= loops=)

43. 0.000 0.000 ↓ 0.0

Hash Join (cost=918.27..951.54 rows=1 width=100) (actual time=.. rows= loops=)

  • Hash Cond: (qspo.sentenceid = s.sentenceid)
44.          

Initplan (forHash Join)

45. 0.000 0.000 ↓ 0.0

Index Scan using sentdocs on sentences (cost=0.00..840.96 rows=259 width=8) (actual time=.. rows= loops=)

  • Index Cond: (docid = d.docid)
46. 0.000 0.000 ↓ 0.0

Seq Scan on querysentencepolarityoverride qspo (cost=0.00..29.10 rows=1110 width=24) (actual time=.. rows= loops=)

47. 0.000 0.000 ↓ 0.0

Hash (cost=77.29..77.29 rows=1 width=92) (actual time=.. rows= loops=)

48. 0.000 0.000 ↓ 0.0

Nested Loop (cost=11.18..77.29 rows=1 width=92) (actual time=.. rows= loops=)

49. 0.000 0.000 ↓ 0.0

HashAggregate (cost=11.18..11.19 rows=1 width=8) (actual time=.. rows= loops=)

50. 0.000 0.000 ↓ 0.0

Index Scan using idx_qspoqid on querysentencepolarityoverride (cost=0.00..11.18 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: (queryid = 2303)
  • Filter: (sentenceid = ANY ($1))
51. 0.000 0.000 ↓ 0.0

Index Scan using pk_sentences on sentences s (cost=0.00..66.09 rows=1 width=84) (actual time=.. rows= loops=)

  • Index Cond: (sentenceid = public.querysentencepolarityoverride.sentenceid)
52. 0.000 0.000 ↓ 0.0

Result (cost=2452.00..2452.01 rows=1 width=0) (actual time=.. rows= loops=)

53.          

Initplan (forResult)

54. 0.000 0.000 ↓ 0.0

Aggregate (cost=2451.99..2452.00 rows=1 width=19) (actual time=.. rows= loops=)

55. 0.000 0.000 ↓ 0.0

Nested Loop (cost=0.00..2451.99 rows=3 width=19) (actual time=.. rows= loops=)

56. 0.000 0.000 ↓ 0.0

Index Scan using catexecdoci_idx on queryexecutioncategorydocuments qecd (cost=0.00..632.26 rows=215 width=8) (actual time=.. rows= loops=)

  • Index Cond: (docid = d.docid)
  • Filter: (NOT invisible)
57. 0.000 0.000 ↓ 0.0

Index Scan using pk_queryexecutioncategories on queryexecutioncategories qec (cost=0.00..8.45 rows=1 width=27) (actual time=.. rows= loops=)

  • Index Cond: (queryexecutioncategoryid = qecd.queryexecutioncategoryid)
  • Filter: (queryexecutionid = 2029)