Preliminary results on in-memory sqlite instead of array

[Dr. Hawkins]

I've partially written the code to use in-memory sqlite for my storage
instead of an array.  (I need to do fast sorts by parts of a
two-dimensional array--and sorts that are natural to sql).

Anyway, if a single database is opened in memory, it seems to be
blindingly fast.  Db creation, table creation, and query come back
before the milliseconds change.  A simple query ranges from 0 to 1 ms.

Open three or 4--with all but the last all but empty-- and it's
another story.  a few ms to create, and about 70 ms for a simple
query.

(There are something like 340 rows of nine columns in this.  The 340
line command is one of the fast/slow results).

I'm not sure that I'll get to the point of comparing query/sort across
the array--it would be ugly and mind-twisting to write (along with the
secondary arrays needed for indices); if this is fast enough, I'm
going to use it.



-- 
Dr. Richard E. Hawkins, Esq.
(702) 508-8462