Received: from spider.pilosoft.com (p55-222.acedsl.com [160.79.55.222]) by postgresql.org (8.11.3/8.11.1) with ESMTP id f54KlhE17705 for ; Mon, 4 Jun 2001 16:47:43 -0400 (EDT) (envelope-from alex@pilosoft.com) Received: from localhost (alexmail@localhost) by spider.pilosoft.com (8.9.3/8.9.3) with ESMTP id QAA01621; Mon, 4 Jun 2001 16:56:34 -0400 (EDT) Date: Mon, 4 Jun 2001 16:56:34 -0400 (EDT) From: Alex Pilosov To: Josh Berkus cc: pgsql-sql@postgresql.org Subject: Re: SQL Date Challenge In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Archive-Number: 200106/26 X-Sequence-Number: 3229 On Mon, 4 Jun 2001, Josh Berkus wrote: > > This doesn't solve my problem, as the suggestion above presupposes that > I have a temp table of all possible dates in the range, or Yes, you must have such a table, or you have to iterate over existing table. > misunderstands that I am trying to find all Wednesdays in column x. > > I am trying to list all Wednesdays that are *not* in column x. > > This requires me to build a list of all possible Wednesdays (within a > date range), preferably *without* first having a table of all dates in > existance! Some sort of manipulation of the date processor should be > possible, shouldn't it? No. Same reason why you cannot write a select returning all values from 1 to 1000. You must have table to iterate over. When stored procedures are able to return sets (they do, but halfway: C ones can, but no other language supports that), you may have it a bit easier...