Advertisement
Guest User

Untitled

a guest
Jan 29th, 2020
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.23 KB | None | 0 0
  1. QUERY PLAN
  2. --------------------------------------------------------------------------------------------------------------------------------------------
  3. Sort (cost=717.34..717.59 rows=101 width=488) (actual time=7.761..7.774 rows=100 loops=1)
  4. Sort Key: t1.fivethous
  5. Sort Method: quicksort Memory: 77kB
  6. -> Hash Join (cost=230.47..713.98 rows=101 width=488) (actual time=0.711..7.427 rows=100 loops=1)
  7. Hash Cond: (t2.unique2 = t1.unique2)
  8. -> Seq Scan on tenk2 t2 (cost=0.00..445.00 rows=10000 width=244) (actual time=0.007..2.583 rows=10000 loops=1)
  9. -> Hash (cost=229.20..229.20 rows=101 width=244) (actual time=0.659..0.659 rows=100 loops=1)
  10. Buckets: 1024 Batches: 1 Memory Usage: 28kB
  11. -> Bitmap Heap Scan on tenk1 t1 (cost=5.07..229.20 rows=101 width=244) (actual time=0.080..0.526 rows=100 loops=1)
  12. Recheck Cond: (unique1 < 100)
  13. -> Bitmap Index Scan on tenk1_unique1 (cost=0.00..5.04 rows=101 width=0) (actual time=0.049..0.049 rows=100 loops=1)
  14. Index Cond: (unique1 < 100)
  15. Planning time: 0.194 ms
  16. Execution time: 8.008 ms
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement