Primes generated with postgreSQL, unfortunately not very fast yet

primes.sql

WITH ps(v) as (
  WITH RECURSIVE t(v) as (
    SELECT 3::NUMERIC UNION ALL
    SELECT v+2 FROM t
  )
  SELECT v from t limit 1000
)
SELECT 2 UNION ALL
SELECT v as prime from ps as candidate
  WHERE NOT EXISTS (
    SELECT * FROM ps WHERE 
      (v*v) <= candidate.v AND
      candidate.v % v = 0
    )