something like O(n) thingy.
Moderator: General Moderators
something like O(n) thingy.
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?
- sergio-pro
- Forum Commoner
- Posts: 88
- Joined: Sat Dec 27, 2008 12:26 pm
Re: something like O(n) thingy.
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.
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.
Its called O notation, and if you're concerned about speed create an index.