Page 1 of 1
something like O(n) thingy.
Posted: Fri Jan 02, 2009 11:22 pm
by koguee
Concerning the time a query is being evaluated, I wonder if I do a query on a table with very large number of rows, does php traverse all those rows to find the answer to match the query? Is it alright to do that or other faster ways to do that?
Re: something like O(n) thingy.
Posted: Sat Jan 03, 2009 8:07 am
by sergio-pro
You question is incomplete.
In general, if you are making a right query, all the job makes the DBMS - which is faster than PHP,
If the table is indexed - it will be more faster.
Re: something like O(n) thingy.
Posted: Sun Jan 04, 2009 10:08 am
by josh
Its called O notation, and if you're concerned about speed create an index.