... if the query analyzer does its job, it choose the best way to get the result. best way could depend on index design, balance of the table, number of records, etc.

if you have "a /very /heavy performance burden", first step would be to analyze and to understand why the database engine is needing so much time (database monitor is your friend) before trying to optimize. mostly modifying statements doesn't help too much. ceating a missing index or changing your access logic or changes to database design could bring better results!

D*B

<Alan>
SQL references gives an example of EXISTS:

EXISTS (SELECT *
FROM EMPLOYEE WHERE SALARY > 60000)

I would assume that the search in file EMPLOYEE stops when it finds the
first instance of a row that matches.

Is that so?

I'm asking because I'm modifying a program that has a /very/ /heavy/
performance burden, and I have to squeeze milliseconds out of it
anywhere I can get it.
</Alan>

As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.