Skip site navigation (1) Skip section navigation (2)

AW: Berkeley DB...

From: Zeugswetter Andreas SB <ZeugswetterA(at)wien(dot)spardat(dot)at>
To: "'Matthias Urlichs'" <smurf(at)noris(dot)de>
Cc: "'pgsql-hackers(at)postgreSQL(dot)org'" <pgsql-hackers(at)postgreSQL(dot)org>
Subject: AW: Berkeley DB...
Date: 2000-05-25 15:47:52
Message-ID: 219F68D65015D011A8E000006F8590C604AF7DA5@sdexcsrv1.f000.d0188.sd.spardat.at (view raw or flat)
Thread:
Lists: pgsql-hackers
> ... that being said (and I took a quick test with 10000 
> randomly-inserted
> records and fetched them in index order) if the data's in the 
> cache, the
> speed difference is insignificant. 

As long as everything fits into the system cache and is 
already in there, this test is moot.

> I did this:
> 
> create table foo (a int not null,b char(100));
> create index foo_a on foo(a);
> for(i=0; i<10000; i++) {
>     insert into foo(a,b) values( `((i*3467)%10000)` , 'fusli');
> }

here you need to reboot the machine or make sure nothing is cached. 
then time the following and make sure it uses the index afterwards.

> select a from foo order by a; 

Andreas

pgsql-hackers by date

Next:From: Zeugswetter Andreas SBDate: 2000-05-25 15:51:13
Subject: AW: More Performance
Previous:From: Tom LaneDate: 2000-05-25 15:46:31
Subject: Re: gram.y PROBLEM with UNDER

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group