Besides the suggestions from Dennis below, please search the archives
for emails by me on doing exactly this. I achieved fairly decent
performance on a database of 7.5 million rows doing lookups on 250k
rectangles. I was working on a quad-Xeon server with 4 Gb ram and Win
XP, using Perl to work on
David Thieme wrote:
Scott,
Yes, the SELECT is very simple, but slow. I have tens of thousands of
records and I need the data very fast (embedded realtime system). Some
databases natively support spatial searches, using KD-trees or R-Trees or
Quad-trees to improve the search speed. I found an a
st spatial search in
a database that doesn't natively support this feature.
Thanks in advance,
David
-Original Message-
From: Scott Baker [mailto:[EMAIL PROTECTED]
Sent: Thursday, August 23, 2007 10:52 AM
To: sqlite-users@sqlite.org
Subject: Re: [sqlite] Spatial searches
David Thiem
On Thu, 23 Aug 2007 10:03:00 -0700, David Thieme wrote:
>I've been looking for a WinCE embedded database that supports spatial
>searches. We are already using SQLite for a very small application; we're
>hoping that someone may have some tricks/hints on how to implement fast
>searches on spatial d
David Thieme wrote:
> I've been looking for a WinCE embedded database that supports spatial
> searches. We are already using SQLite for a very small application; we're
> hoping that someone may have some tricks/hints on how to implement fast
> searches on spatial data with SQLite. A typical searc
5 matches
Mail list logo
