Hi Guys,

Im trying to lower the CPU time on some of my querys.

Currently if i want to select the age of the last person in my table ( table rows assigned auto incremented unique id's ) i would do this:

SELECT age FROM table ORDER BY id desc LIMIT 1;

Now,
While this works fine, I can see that it takes almost 3 seconds for it complete this query ( it says "sorting result" )

Is there a better way to do this?
All i find on google is the above result i came up with, However i fear this isnt the best way.

Ive got index's also, However it still takes a while. ( well, Not fast enough for me )

I was hoping there was some kind of
SELECT age WHERE row_is_last;

or something like that..

I fear the "ordering" part is eating up resources where its just not needed.
Thanks
G

Are you sure that your indexes are proper.

Also have you tried running

EXPLAIN SELECT age FROM table ORDER BY id desc LIMIT 1;

This will tell you what exactly mysql is doing to return the data and if all of the indexes are returned

Is your id field an integer ?
Is it the primary key ? If not, is there an index (composite or not) on that field.
And how many rows do you have in the table.
If you use mysql, which engine is used? Innodb, myisam ?

Hello friend, as you mention the code
SELECT age FROM table ORDER BY id desc LIMIT 1;
I think so, but you need more appropriate as compared that, still I'll my best but unable to provide an appropriate solution to you,Be patience

well, in another recent post, you mentioned having about "10000's" of database tables.

Perhaps that could be the reason it's taking so long to process your queries?