Is there a Way to Optimize a MySQL Query that Runs a Function on Every Row?

I've got a MySQL query that pulls lat longs from a database based on a criterion, tests whether these points are within a polygon, and returns the points that are within the polygon.

Everything works fine. The problem is that the query takes approx. 20 seconds to return a result. Is there a way to optimize this query so that query speed is faster?

SELECT latitude, longitude
FROM myTable
WHERE offense = 'green' AND myWithin(
POINTFROMTEXT( CONCAT( 'POINT(', latitude, ' ', longitude, ')' ) ) , POLYFROMTEXT( 'POLYGON(( ...bunch of lat longs...))' )
) = 1;

I ran an EXPLAIN SELECT... which produced

id | select_type | table | type | possibl开发者_JAVA百科e_keys | key | key_len | ref | rows | Extra

1 SIMPLE myTable ALL NULL NULL NULL NULL 137003 Using where

Is there a way to optimize a query that is run on every latitude and longitude in the db or is this as good as it gets?

I'm thinking about doing a select into another table and then querying the results table, but I was hoping that there would be a way to improve the performance of this query.

If anyone has any suggestions or ideas, I'd love to hear them.

Thanks,

Laxmidi

---

How big are the polygons? You could define a "bounding rectangle" around the whole polygon and then do:

SELECT latitude, longitude
FROM myTable
WHERE
  offense = 'green' AND
  latitude BETWEEN rect_left AND rect_right AND
  longitude BETWEEN rect_top AND rect_bottom AND
  myWithin(
    POINTFROMTEXT( CONCAT( 'POINT(', latitude, ' ', longitude, ')' ) ),
    POLYFROMTEXT( 'POLYGON(( ...bunch of lat longs...))' )) = 1;

That way, it could use an index on latitude and longitude to narrow down the number of points that it has to run the complex stuff on.

---

I see two obvious avenues for optimization:

• Reduce the result set more before you run your function O(n) times. Right now you're running the function 137003 times - there's little way to avoid that if you can't filter the result set any further.

• Make the function faster, such that you're still running it 137k times, but each invocation takes less time, thus reducing your total runtime.

Right now your function is taking 0.1459 milliseconds per row to run, which really isn't bad. You probably want to try to find some way to further reduce the number of rows you have to run it on. Reducing the result set through clever use of WHERE also has the side benefit of allowing your database to do some optimization for you, which is how you want to be using it.