explain.depesz.com

PostgreSQL's explain analyze made readable

Result: YPIb

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

Limit (cost=11,889,061.33..11,889,062.27 rows=5 width=768) (actual rows= loops=)

2. 0.000 0.000 ↓ 0.0

Group (cost=11,889,061.33..15,476,471.21 rows=18,970,564 width=768) (actual rows= loops=)

  • Group Key: (date(considerations2."createdAt")), considerations2._id, considerations2."candidateName", considerations2.company, considerations2."emailsString", considerations2."phonesString", considerations2.location, considerations2."linksString", considerations2."ownerName", considerations2."candidateOwnerEmail", considerations2.origin, considerations2.sources, considerations2.tags, considerations2."referrerName", (CASE WHEN considerations2."isSocialReferral" THEN 'Yes'::text ELSE 'No'::text END), (CASE WHEN considerations2."hasManualReferral" THEN 'Yes'::text ELSE 'No'::text END), (CASE WHEN considerations2."hasEmployeeReferral" THEN 'Yes'::text ELSE 'No'::text END), considerations2."employeeReferrerUserId", (date(considerations2."profileCreatedDate")), (date(offers."applicationCreatedDate")), considerations2."applicationId", considerations2."postingId", considerations2."postingText", considerations2."postingOwnerName", considerations2."postingOwnerId", considerations2."postingHiringManager
3. 0.000 0.000 ↓ 0.0

Gather Merge (cost=11,889,061.33..14,306,619.72 rows=15,808,804 width=768) (actual rows= loops=)

  • Workers Planned: 2
4. 0.000 0.000 ↓ 0.0

Group (cost=11,888,061.30..12,480,891.45 rows=7,904,402 width=768) (actual rows= loops=)

  • Group Key: (date(considerations2."createdAt")), considerations2._id, considerations2."candidateName", considerations2.company, considerations2."emailsString", considerations2."phonesString", considerations2.location, considerations2."linksString", considerations2."ownerName", considerations2."candidateOwnerEmail", considerations2.origin, considerations2.sources, considerations2.tags, considerations2."referrerName", (CASE WHEN considerations2."isSocialReferral" THEN 'Yes'::text ELSE 'No'::text END), (CASE WHEN considerations2."hasManualReferral" THEN 'Yes'::text ELSE 'No'::text END), (CASE WHEN considerations2."hasEmployeeReferral" THEN 'Yes'::text ELSE 'No'::text END), considerations2."employeeReferrerUserId", (date(considerations2."profileCreatedDate")), (date(offers."applicationCreatedDate")), considerations2."applicationId", considerations2."postingId", considerations2."postingText", considerations2."postingOwnerName", considerations2."postingOwnerId", considerations2."postingHiringManager
5. 0.000 0.000 ↓ 0.0

Sort (cost=11,888,061.30..11,907,822.31 rows=7,904,402 width=768) (actual rows= loops=)

  • Sort Key: (date(considerations2."createdAt")) DESC, considerations2._id, considerations2."candidateName", considerations2.company, considerations2."emailsString", considerations2."phonesString", considerations2.location, considerations2."linksString", considerations2."ownerName", considerations2."candidateOwnerEmail", considerations2.origin, considerations2.sources, considerations2.tags, considerations2."referrerName", (CASE WHEN considerations2."isSocialReferral" THEN 'Yes'::text ELSE 'No'::text END), (CASE WHEN considerations2."hasManualReferral" THEN 'Yes'::text ELSE 'No'::text END), (CASE WHEN considerations2."hasEmployeeReferral" THEN 'Yes'::text ELSE 'No'::text END), considerations2."employeeReferrerUserId", (date(considerations2."profileCreatedDate")), (date(offers."applicationCreatedDate")), considerations2."applicationId", considerations2."postingId", considerations2."postingText", considerations2."postingOwnerName", considerations2."postingOwnerId", considerations2."postingHiringManager
6. 0.000 0.000 ↓ 0.0

Parallel Hash Left Join (cost=8,909.55..2,958,387.08 rows=7,904,402 width=768) (actual rows= loops=)

  • Hash Cond: ((considerations2."applicationId")::text = (offers."applicationId")::text)
7. 0.000 0.000 ↓ 0.0

Parallel Seq Scan on considerations2 (cost=0.00..2,860,434.02 rows=7,904,402 width=679) (actual rows= loops=)

8. 0.000 0.000 ↓ 0.0

Parallel Hash (cost=8,552.58..8,552.58 rows=28,558 width=45) (actual rows= loops=)

9. 0.000 0.000 ↓ 0.0

Parallel Seq Scan on offers (cost=0.00..8,552.58 rows=28,558 width=45) (actual rows= loops=)