I was hoping to avoid that, the queries are a little complex and I'm
by no means an SQL expert. Looking at the SQL generated it looks like
it tried to optimize it some, the Or'd query is only about 1/3 longer
than one of the single ones. Unfortunately the code's at the office
so I can't provide much more in details until Monday. I was just
hoping someone had run into this before and new of an easy fix. My
current plan is to just do the two queries separately and then do an
in memory sort. I actually lucked out on discovering this since I had
another fetch I was doing that returned much larger data sets and I
hadn't noticed it was missing a few objects.
On Sep 21, 2007, at 7:28 PM, Ray Ackland wrote:
Eric,
What result sets do you get if you construct the SQL manually for
the different queries?
r
On 22/09/2007, at 15:18, [EMAIL PROTECTED] wrote:
Is there anything that could cause an EOOrQualifier to behave like
this or is it a bug? Object's a, b, and c are all from the same
table. The qualifiers A and B do have a contains selector for a
many to many. This is with mysql v. 5.0.37.
_______________________________________________
Do not post admin requests to the list. They will be ignored.
Webobjects-dev mailing list ([email protected])
Help/Unsubscribe/Update your Subscription:
http://lists.apple.com/mailman/options/webobjects-dev/archive%40mail-archive.com
This email sent to [EMAIL PROTECTED]
