Rev as memory-resident database

Jay Madren JaysLists at triad.rr.com
Wed Aug 25 13:20:45 EDT 2004


That's not really a good benchmark, unless you report the time in ms.
Accessing a record by key value in any good database should always be < 1
second.  Using SQL Server running on my 733mhz PIII desktop with 256 MB ram
(not a server - they call it their Desktop Database), I can retrieve one
record from a 22 MB, 97K-record table by key value (index) in 10 ms.

Now, if you are _not_ talking about indexes when you say key value, then
that would be more impressive (versus a disk-based db).  But it still needs
to be quantified more precisely.

Jay Madren

-----Original Message-----
From: use-revolution-bounces at lists.runrev.com
[mailto:use-revolution-bounces at lists.runrev.com]On Behalf Of Rob Cozens
Sent: Wednesday, August 25, 2004 09:45
To: How to use Revolution
Subject: Re: Rev as memory-resident database


>Has anyone actually tested rev performance on a high memory machine?

Hi Alex,

Not on a particularly high memory machine: 768 MB G4 iMac supporting
a 45 MB, 43K-record SDB database stack.  Retrieval time for one
record by key value via binary search is < 1 second.
--

Rob Cozens
CCW, Serendipity Software Company

"And I, which was two fooles, do so grow three;
Who are a little wise, the best fooles bee."

from "The Triple Foole" by John Donne (1572-1631)
_______________________________________________
use-revolution mailing list
use-revolution at lists.runrev.com
http://lists.runrev.com/mailman/listinfo/use-revolution



More information about the Use-livecode mailing list