> -----Original Message----- > From: D. Richard Hipp [mailto:[EMAIL PROTECTED] > Sent: Wednesday, January 14, 2004 9:22 AM > To: Williams, Ken > Cc: [EMAIL PROTECTED] > Subject: Re: [sqlite] Optimizing a query > > > Williams, Ken wrote: > > > > So, no way to make it O(N)? If the two indexes could be > iterated together, > > as in the following pseudocode, it would seem to be an O(N) > operation. > > > > Retrieving a single record from a BTree is an O(logN) operation. > Doing so N times gives O(NlogN).
Oh, I thought it was also possible to step straight through an index, but I guess I was mistaken. -Ken --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
