bash <[EMAIL PROTECTED]> wrote:
> 
> Oh... so this is implementation limitation.
> Im currently thinking about this table:
> 
> CREATE TABLE map (
>       x int,
>       y int,
>       name char
> );
> CREATE INDEX map_x ON map(x);
> CREATE INDEX map_y ON map(y);
> 
> And query for it will be something like this (circle):
> SELECT name
>   FROM map
>   WHERE (point_x - x)^2 + (point_y -y)^2 < R^2;
> 
> How SQLite will works? Is there any benefit in indexes?
> 

You need an R-Tree index to do something like this.  The
public-domain version of SQLite only supports B-Tree indices.
So, no, indices are not going to help you here.

--
D. Richard Hipp <[EMAIL PROTECTED]>


-----------------------------------------------------------------------------
To unsubscribe, send email to [EMAIL PROTECTED]
-----------------------------------------------------------------------------

Reply via email to