AW: Berkeley DB...

Поиск
Список
Период
Сортировка
От Zeugswetter Andreas SB
Тема AW: Berkeley DB...
Дата
Msg-id 219F68D65015D011A8E000006F8590C604AF7DA3@sdexcsrv1.f000.d0188.sd.spardat.at
обсуждение исходный текст
Список pgsql-hackers
> Frankly, based on my experience with Berkeley DB, I'd bet on mine.
> I can do 2300 tuple fetches per CPU per second, with linear scale-
> up to at least four processors (that's what we had on the box we
> used).  That's 9200 fetches a second.  Performance isn't going
> to be the deciding issue.

Wow, that sounds darn slow. Speed of a seq scan on one CPU, 
one disk should give you more like 19000 rows/s with a small record size.
Of course you are probably talking about random fetch order here,
but we need fast seq scans too.

(10 Mb/s disk, 111 b/row, no cpu bottleneck, nothing cached , 
Informix db, select count(*) ... where notindexedfield != 'notpresentvalue';
Table pages interleaved with index pages, tabsize 337 Mb 
(table with lots of insert + update + delete history) )

Andreas


В списке pgsql-hackers по дате отправления:

Предыдущее
От: Louis-David Mitterrand
Дата:
Сообщение: Re: understanding Datum -> char * -> Datum conversions
Следующее
От: Hannu Krosing
Дата:
Сообщение: Re: AW: AW: SQL3 UNDER