Thanks. This confirms my results.
There is also a better
db(...).select(cache=(cache.rame,3600))
It should be much faster than before.
On Monday, 27 August 2012 09:55:49 UTC-5, Daniel Haag wrote:
>
>
> WE NEED INDEPENDENT BENCHMARKS AGAINST 1.99.7. Here is the code to
>> benchmark:
>>
>> -------------
>> import time
>> db=DAL()
>> db.define_table('person',Field('name'))
>> db.test.insert(name='one')
>>
>
> db.person.insert(name='one')
>
> n = 100000
>>
>> t0 = time.time()
>> for k in range(n):
>> y = db.person.name
>> print (time.time()-t0)/n
>>
>> row = db(db.person).select().first()
>>
>> t0 = time.time()
>> for k in range(n):
>> y = row.name
>> print (time.time()-t0)/n
>> ----------
>>
>>
> gcc version 4.5.3 (Gentoo 4.5.3-r2 p1.1, pie-0.4.7)
> Python 2.7.3
>
> Version 1.99.7 (2012-03-04 22:12:08) stable:
> 7.47010946274e-06
> 5.64429044724e-06
>
> Version 2.00.0 (2012-08-27 07:41:29) dev:
> 4.28411960602e-07
> 2.50899791718e-07
>
> Daniel
>
--
