Hello,
I am interested in the theoretical time / space complexity of SQL queries
on indexed / non-indexed data.
I think I read somewhere that a JOIN on an indexed column is something
like O[mn*log(mn)] (m rows joined to n).
I assume without an index it is just O[m*n]
Specifically I want to
Dan Bolser wrote:
Hello,
I am interested in the theoretical time / space complexity of SQL queries
on indexed / non-indexed data.
I think I read somewhere that a JOIN on an indexed column is something
like O[mn*log(mn)] (m rows joined to n).
I assume without an index it is just
On 6/21/05, Dan Bolser wrote:
I am interested in the theoretical time / space complexity of SQL queries
on indexed / non-indexed data.
I doubt this is the right list for theory.
Specifically I want to know the complexity of a query that does a
'cross tabulation'
SELECT
X,
Dan Bolser [EMAIL PROTECTED] wrote on 06/21/2005 09:51:06 AM:
Hello,
I am interested in the theoretical time / space complexity of SQL
queries
on indexed / non-indexed data.
I think I read somewhere that a JOIN on an indexed column is something
like O[mn*log(mn)] (m rows joined to n).
I
It's a Big O of N.
DVP
Dathan Vance Pattishall http://www.friendster.com
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
Sent: Tuesday, June 21, 2005 9:39 AM
To: Dan Bolser
Cc: mysql@lists.mysql.com
Subject: Re: Query Complexity (big 'O')
Dan
