i dont think there's a simple answer - it depends on the amount of data
you are dealing with, whether the database is indexed etc. i would say,
the more data to deal with, the more likely that a SQL call would be
quicker (and probably with a lower memory footprint).
to confuse matters, a third option would be to use workers to handle the
filtering in the background.
On 08/11/2013 18:30, Mark Fuqua wrote:
I have a mobile application which gets its data from a SQLite database.
Query results are really fast.
Right now, the application hits the database and converts the result into an
ArrayCollection. I need to allow for filtering the ArrayCollection.seems
like it might be just a quick to hit the database again with filtering
criteria rather than using the built-in filtering function of the
ArrayCollection. Is it substantially quicker to use a filter function
rather than hit the SQLite database again and loading the result into the
same ArrayCollection?
Mark Fuqua
[email protected]
2301 Mount Carmel Road
Parkton, MD 21120
(410) 215-7356
www.availdata.com
--
Lee Burrows
ActionScripter
