I have two lists of queries. One returns the intersection of all the queries within itself.. the actual intersection being done by an external function (which I'd like to change if I can learn how), the other the union of all queries within itself.. again using an external function for the union.. and then an external function does a difference between the intersection and the union to get the final result.
Would it be even possible to code something like that as just a single query? Right now it is using something like 60 queries to get the result and that seems like I must be doing it wrong even though it responds quickly. "All the best people in life seem to like LINUX." --Steve Wozniak *^*^*^* Michael McGlothlin <[EMAIL PROTECTED]> http://mlug.missouri.edu/~mogmios/projects/ --------------------------------------------------------------------- Before posting, please check: http://www.mysql.com/manual.php (the manual) http://lists.mysql.com/ (the list archive) To request this thread, e-mail <[EMAIL PROTECTED]> To unsubscribe, e-mail <[EMAIL PROTECTED]> Trouble unsubscribing? Try: http://lists.mysql.com/php/unsubscribe.php
