Paradox: filters versus queries

Hi all,

Is there a significant speed difference in filtering
a paradox table versus defining a query, using the BDE
and native paradox driver?

I'm wondering, as I have been using filtering extensively, but it really seems to start bogging down pretty quickly.

Any discussion appreciated.
Who is Participating?
simonetConnect With a Mentor Commented:
Yes... queries are always faster.

This is because Delphi has to create a query from the TTable component, and that itself is already some overhead to the application. Now, if there's a filter, then it's even more work.

If everything is already in a query, Delphi simply has to submit the query to the BDE and wait for the results. No overheads, no nothing.

depends if there is an index on the filtered field,
but usual a query is faster than a filter

meikl ;-)
Hi oneeye!

I agree with Alex and meikl, but there is another side of medal:

filtering works faster in case you open table once and then apply different filters few times. It similar to caching mechanizm, it works slow first time, but fast in further usage of the same data. So, it is depend from what you are going to do.

oneeyeAuthor Commented:

Less overhead is good, I'll try a few queries and see if I see a performance improvement. Now I just have to review SQL.
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

All Courses

From novice to tech pro — start learning today.