> does The mySQL command: > "Select x from table where id=2130" > uses linear time complexity while finding 2130th > element? Do we need to create an algorithm like binary > search to do this operation more efficiently ?
afaik mysql indexes are optimized and organized in a b-tree. Lookup http://dev.mysql.com/doc/mysql/en/ Community email addresses: Post message: [email protected] Subscribe: [EMAIL PROTECTED] Unsubscribe: [EMAIL PROTECTED] List owner: [EMAIL PROTECTED] Shortcut URL to this page: http://groups.yahoo.com/group/php-list Yahoo! Groups Links <*> To visit your group on the web, go to: http://groups.yahoo.com/group/php-list/ <*> To unsubscribe from this group, send an email to: [EMAIL PROTECTED] <*> Your use of Yahoo! Groups is subject to: http://docs.yahoo.com/info/terms/
