Date:         Thu, 29 May 2003 15:39:49 -0400
Reply-To:     "Z39.50 Next-Generation Initiative" <[log in to unmask]>
Sender:       "Z39.50 Next-Generation Initiative" <[log in to unmask]>
From:         Ray Denenberg <[log in to unmask]>
Organization: Library Of Congress
Subject:      Re: CQL Range Search Syntax
Comments: To: "Z39.50 Next-Generation Initiative" <[log in to unmask]>
Content-Type: text/plain; charset=us-ascii

I've listed this at:
http://lcweb.loc.gov/z3950/agency/zing/srw/srw1-1-proposals.html
I listed Rob for this one, though it could be Ralph instead.  Rob had written up a note about possible
relations 'within' and 'encloses'
[log in to unmask]&P=3343>http://listserv.loc.gov/cgi-bin/wa?A2=ind0301&L=zng&F=&S=&X=499A0A17B318735D41&[log in to unmask]&P=3343

I don't have a capsule summary yet. Is this limited to a linear range search, as Ralph was inquiring
about, or are we looking for a more general solution, that might require us to collaborate with our Geo
friends?  And for the latter, is it a bounding polygon problem or something more complicated?
I don't think Rob's Great-Lakes/(partial)Enclosing-Countries example can be solved by  bounding
polygons.

--Ray