Amazing! Thanks Guys! This query working best! The runtime difference between LOCAL execution and execution in LAN environment is still absolutely a show stopper! The old algorithm (get all polygon data from Polygon table) and search for the neighbors in C++ is faster in LAN, then RTree concept.
LOCAL: RTREE 8x faster then my OLD implementation NET: OLD is 2x faster then RTREE Can I use some special caching concepts? How can I improve the run-time in the NETWORK environment? Thanks, S -------- Original-Nachricht -------- > Datum: Thu, 22 Jan 2009 08:58:21 -0500 > Von: "Igor Tandetnik" <[email protected]> > An: [email protected] > Betreff: Re: [sqlite] Effective way to use RTree to find the neighborhood ??? > "Sergej Schwarz" <[email protected]> wrote in > message news:[email protected] > > unfortunately, this does not work, the RTree documentation by SQLite > > leads to misunderstanding of the concept... The query would results > > in an empty set. > > > > //your query > > select * from demo where x1>=3 and x2<=19 and y1>=2 and y2<=15; > > That's not at all similar to Dan's query. Try this: > > select * from demo where x1<=19 and x2>=3 and y1<=15 and y2>=2; > > Igor Tandetnik > > > > _______________________________________________ > sqlite-users mailing list > [email protected] > http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users -- NUR NOCH BIS 31.01.! GMX FreeDSL - Telefonanschluss + DSL für nur 16,37 EURO/mtl.!* http://dsl.gmx.de/?ac=OM.AD.PD003K11308T4569a _______________________________________________ sqlite-users mailing list [email protected] http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
