<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
	<id>tag:old.nabble.com,2006:forum-763</id>
	<title>Nabble - PostgreSQL - benchmarks</title>
	<updated>2007-04-27T09:40:19Z</updated>
	<link rel="self" type="application/atom+xml" href="http://old.nabble.com/PostgreSQL---benchmarks-f763.xml" />
	<link rel="alternate" type="text/html" href="http://old.nabble.com/PostgreSQL---benchmarks-f763.html" />
	<subtitle type="html"></subtitle>
	
<entry>
	<id>tag:old.nabble.com,2006:post-10221581</id>
	<title>Re: Benchmarking tools for the Postgres, EDB and Oracle Database</title>
	<published>2007-04-27T09:40:19Z</published>
	<updated>2007-04-27T09:40:19Z</updated>
	<author>
		<name>Decibel!</name>
	</author>
	<content type="html">On Apr 12, 2007, at 2:04 PM, Ranjan Sahoo wrote:
&lt;br&gt;&amp;gt; &amp;nbsp; &amp;nbsp;I am working on a project for testing the performance of Oracle, &amp;nbsp;
&lt;br&gt;&amp;gt; EDB, and postgres and looking for a OLTP benchmarking tool which &amp;nbsp;
&lt;br&gt;&amp;gt; can do the benchmarking on all these databases. Can anyone please &amp;nbsp;
&lt;br&gt;&amp;gt; help me on this?
&lt;br&gt;&lt;br&gt;Take a look at &lt;a href=&quot;http://sourceforge.net/projects/benchmarksql&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://sourceforge.net/projects/benchmarksql&lt;/a&gt;&lt;br&gt;--
&lt;br&gt;Jim Nasby &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=10221581&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;jim@...&lt;/a&gt;
&lt;br&gt;EnterpriseDB &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://enterprisedb.com&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://enterprisedb.com&lt;/a&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; 512.569.9461 (cell)
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;---------------------------(end of broadcast)---------------------------
&lt;br&gt;TIP 5: don't forget to increase your free space map settings
&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Benchmarking-tools-for-the-Postgres%2C-EDB-and-Oracle-Database-tp9959127p10221581.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-9959127</id>
	<title>Benchmarking tools for the Postgres, EDB and Oracle Database</title>
	<published>2007-04-12T07:04:35Z</published>
	<updated>2007-04-12T07:04:35Z</updated>
	<author>
		<name>Ranjan Sahoo</name>
	</author>
	<content type="html">&lt;div class=MsoNormal&gt;&lt;FONT face=&quot;Bookman Old Style&quot; color=blue size=2&gt;&lt;SPAN style=&quot;FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: 'Bookman Old Style'&quot;&gt;Hi All&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face=Wingdings color=blue size=2&gt;&lt;SPAN style=&quot;FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: Wingdings&quot;&gt;J&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face=&quot;Bookman Old Style&quot; color=blue size=2&gt;&lt;SPAN style=&quot;FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: 'Bookman Old Style'&quot;&gt;&lt;?xml:namespace prefix = o ns = &quot;urn:schemas-microsoft-com:office:office&quot; /&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/div&gt;  &lt;div class=MsoNormal&gt;&lt;FONT face=&quot;Bookman Old Style&quot; color=blue size=2&gt;&lt;SPAN style=&quot;FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: 'Bookman Old Style'&quot;&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/div&gt;  &lt;div class=MsoNormal&gt;&lt;FONT face=&quot;Bookman Old Style&quot; color=blue size=2&gt;&lt;SPAN style=&quot;FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: 'Bookman Old Style'&quot;&gt;&amp;nbsp;&amp;nbsp; I am working on a project for testing the performance of Oracle, EDB, and postgres and looking for a OLTP benchmarking
 tool which can do the benchmarking on all these databases. Can anyone please help me on this? &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/div&gt;  &lt;div class=MsoNormal&gt;&lt;FONT face=&quot;Bookman Old Style&quot; color=blue size=2&gt;&lt;SPAN style=&quot;FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: 'Bookman Old Style'&quot;&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/div&gt;  &lt;div class=MsoNormal&gt;&lt;FONT face=&quot;Bookman Old Style&quot; color=blue size=2&gt;&lt;SPAN style=&quot;FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: 'Bookman Old Style'&quot;&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp; Thanks in advance to all for you kind co-operation. &lt;/SPAN&gt;&lt;/FONT&gt;&lt;/div&gt;  &lt;div class=MsoNormal&gt;&lt;FONT face=&quot;Bookman Old Style&quot; color=blue size=2&gt;&lt;SPAN style=&quot;FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: 'Bookman Old Style'&quot;&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&amp;nbsp;&lt;/div&gt;  &lt;div class=MsoNormal&gt;&lt;FONT face=&quot;Bookman Old Style&quot; color=blue size=2&gt;&lt;SPAN style=&quot;FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: 'Bookman Old Style'&quot;&gt;Regards&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/div&gt;  &lt;div class=MsoNormal&gt;&lt;FONT face=&quot;Bookman Old Style&quot; color=blue size=2&gt;&lt;SPAN style=&quot;FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: 'Bookman Old Style'&quot;&gt;Ranjan&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/div&gt;&lt;p&gt;&amp;#32;
      &lt;hr size=1&gt;Expecting? Get great news right away with &lt;a href=&quot;http://us.rd.yahoo.com/evt=49982/*http://advision.webevents.yahoo.com/mailbeta/newmail_tools.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;email Auto-Check.&lt;/a&gt;&lt;br&gt;Try the &lt;a href=&quot;http://us.rd.yahoo.com/evt=49982/*http://advision.webevents.yahoo.com/mailbeta/newmail_tools.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Yahoo! Mail Beta.&lt;/a&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Benchmarking-tools-for-the-Postgres%2C-EDB-and-Oracle-Database-tp9959127p9959127.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-6170698</id>
	<title>Re: testing</title>
	<published>2006-09-06T06:41:55Z</published>
	<updated>2006-09-06T06:41:55Z</updated>
	<author>
		<name>Rafaqat Ali</name>
	</author>
	<content type="html">....&lt;br&gt;&lt;br&gt;&lt;div&gt;&lt;span class=&quot;gmail_quote&quot;&gt;On 9/6/06, &lt;b class=&quot;gmail_sendername&quot;&gt;Rafaqat Ali&lt;/b&gt; &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=6170698&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;smoken0@...&lt;/a&gt;&amp;gt; wrote:&lt;/span&gt;&lt;blockquote class=&quot;gmail_quote&quot; style=&quot;border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;&quot;&gt;
&lt;div&gt;Please ignore this email.&lt;br&gt;This is just to test is it working. &lt;br&gt;

&lt;/div&gt;&lt;/blockquote&gt;&lt;/div&gt;&lt;br&gt;
</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/testing-tp6166067p6170698.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-6166067</id>
	<title>testing</title>
	<published>2006-09-06T01:19:24Z</published>
	<updated>2006-09-06T01:19:24Z</updated>
	<author>
		<name>Rafaqat Ali</name>
	</author>
	<content type="html">Please ignore this email.&lt;br&gt;This is just to test is it working. &lt;br&gt;
</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/testing-tp6166067p6166067.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-5506007</id>
	<title>Re: postgis</title>
	<published>2006-07-26T09:59:33Z</published>
	<updated>2006-07-26T09:59:33Z</updated>
	<author>
		<name>Jim C. Nasby</name>
	</author>
	<content type="html">Please fix your caps-lock.
&lt;br&gt;&lt;br&gt;If you look on the PostGIS site, you'll find that they have their own &amp;nbsp;
&lt;br&gt;mailing lists. You should ask for help there.
&lt;br&gt;&lt;br&gt;On Jul 25, 2006, at 3:26 PM, ASTRO wrote:
&lt;div class='shrinkable-quote'&gt;&lt;br&gt;&amp;gt; HI
&lt;br&gt;&amp;gt; I APOLOGISE FOR MY BAD ENGLISH
&lt;br&gt;&amp;gt; I USE POSTGRESQL WHIT POSTGIS
&lt;br&gt;&amp;gt; I HAVE A PROBLEM WITH THE GROMETRY COLLECTION DATA TYPE
&lt;br&gt;&amp;gt; I WOULD ASK IF THERE AREN'T A FUNCTION TO CONVERT A GEOMETRY &amp;nbsp;
&lt;br&gt;&amp;gt; COLLECTION (AS MULTIPOINT FOR EXEMPLE) IN GEOMETRY TYPE
&lt;br&gt;&amp;gt; I TRY TO USE THE FUNCTION AsText BUT IT'S NOT POSSIBLE TO SEE THE &amp;nbsp;
&lt;br&gt;&amp;gt; POINT OF THE COLLECTION
&lt;br&gt;&amp;gt; THANKS
&lt;br&gt;&amp;gt; ASTRO
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; PS:I TRY AGAIN TO FIND A SOLUTION AND IF I'LL FIND IT I'LL SEND YOU &amp;nbsp;
&lt;br&gt;&amp;gt; A MAIL WITH THE SOLUTION
&lt;/div&gt;&lt;br&gt;--
&lt;br&gt;Jim C. Nasby, Sr. Engineering Consultant &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=5506007&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;jnasby@...&lt;/a&gt;
&lt;br&gt;Pervasive Software &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://pervasive.com&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://pervasive.com&lt;/a&gt;&amp;nbsp; &amp;nbsp; work: 512-231-6117
&lt;br&gt;vcard: &lt;a href=&quot;http://jim.nasby.net/pervasive.vcf&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://jim.nasby.net/pervasive.vcf&lt;/a&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;cell: 512-569-9461
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;---------------------------(end of broadcast)---------------------------
&lt;br&gt;TIP 9: In versions below 8.0, the planner will ignore your desire to
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;choose an index scan if your joining column's datatypes do not
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;match
&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/postgis-tp5492638p5506007.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-5492638</id>
	<title>postgis</title>
	<published>2006-07-25T14:26:01Z</published>
	<updated>2006-07-25T14:26:01Z</updated>
	<author>
		<name>ASTRO-3</name>
	</author>
	<content type="html">HI&lt;br&gt;I APOLOGISE FOR MY BAD ENGLISH&lt;br&gt;I USE POSTGRESQL WHIT POSTGIS&lt;br&gt;I HAVE A PROBLEM WITH THE GROMETRY COLLECTION DATA TYPE&lt;br&gt;I WOULD ASK IF THERE AREN'T A FUNCTION TO CONVERT A GEOMETRY COLLECTION (AS MULTIPOINT FOR EXEMPLE) IN GEOMETRY TYPE
&lt;br&gt;I TRY TO USE THE FUNCTION AsText BUT IT'S NOT POSSIBLE TO SEE THE POINT OF THE COLLECTION&lt;br&gt;THANKS &lt;br&gt;ASTRO&lt;br&gt;


&lt;br&gt;&lt;br&gt;PS:I TRY AGAIN TO FIND A SOLUTION AND IF I'LL FIND IT I'LL SEND YOU A MAIL WITH THE SOLUTION &lt;br&gt;
</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/postgis-tp5492638p5492638.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-4634358</id>
	<title>PROBLEMAS CON POSTGRES EN MAQUINAS MULTIPROCESADORES</title>
	<published>2006-05-24T10:03:28Z</published>
	<updated>2006-05-24T10:03:28Z</updated>
	<author>
		<name>Jimmy Salazar</name>
	</author>
	<content type="html">&lt;br&gt;&lt;br /&gt;lists
&lt;br&gt;&lt;br&gt;Saludos,
&lt;br&gt;&lt;br&gt;Resulta que el tiempo de ejecución obtenido en una maquina HP DL380 con
&lt;br&gt;2 procesadores Xeon de 3.6 Gh y 4G de memoria con el siguiente comando 
&lt;br&gt;&amp;quot;cat nombrearchivo.gz | gunzip | psql nombrebd -f -&amp;quot; es de 4 horas...
&lt;br&gt;&lt;br&gt;este mismo Proceso en una maquina de DL580 con 4 procesadores de 3.0 Gh
&lt;br&gt;y 8G de memoria su tiempo de ejecución es de 5 horas y media.
&lt;br&gt;&lt;br&gt;Las anteriores pruebas se ejecutaron utilizando POSTGRES 8.03 en un
&lt;br&gt;sistema operativo REDHAT 4.2 de 64.
&lt;br&gt;&lt;br&gt;La inquietud es si POSTGRES a presentado problemas en maquinas de 64b
&lt;br&gt;con múltiples procesadores.. lo decimos con base en los tiempos de
&lt;br&gt;ejecución expuestos anteriormente..
&lt;br&gt;&lt;br&gt;Otra prueba realizada fue en la maquina de 64b se realizo el mismo
&lt;br&gt;proceso pero no utilizando SMP y el tiempo de respuesta fue de 3horas y
&lt;br&gt;media (pareciera que postgres tiene problemas con varios procesadore) &amp;nbsp;
&lt;br&gt;&lt;br&gt;Existe alguna solución? o algún ajuste posible?, alguna recomendación?
&lt;br&gt;&amp;nbsp; 
&lt;br&gt;-- 
&lt;br&gt;__________________________
&lt;br&gt;Juan Jimmy Salazar Ramirez
&lt;br&gt;Ingeniero Informatico
&lt;br&gt;Analista Programador
&lt;br&gt;Solati Ltda.
&lt;br&gt;Medellin - &amp;nbsp;Colombia
&lt;br&gt;Tel. 268-75-51
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;gt;&amp;gt;&amp;gt;&amp;gt;end
&lt;br&gt;&lt;br /&gt;Saludos,
&lt;br&gt;&lt;br&gt;Resulta que el tiempo de ejecución obtenido en una maquina HP DL380 con
&lt;br&gt;2 procesadores Xeon de 3.6 Gh y 4G de memoria con el siguiente comando 
&lt;br&gt;&amp;quot;cat nombrearchivo.gz | gunzip | psql nombrebd -f -&amp;quot; es de 4 horas...
&lt;br&gt;&lt;br&gt;este mismo Proceso en una maquina de DL580 con 4 procesadores de 3.0 Gh
&lt;br&gt;y 8G de memoria su tiempo de ejecución es de 5 horas y media.
&lt;br&gt;&lt;br&gt;Las anteriores pruebas se ejecutaron utilizando POSTGRES 8.03 en un
&lt;br&gt;sistema operativo REDHAT 4.2 de 64.
&lt;br&gt;&lt;br&gt;La inquietud es si POSTGRES a presentado problemas en maquinas de 64b
&lt;br&gt;con múltiples procesadores.. lo decimos con base en los tiempos de
&lt;br&gt;ejecución expuestos anteriormente..
&lt;br&gt;&lt;br&gt;Otra prueba realizada fue en la maquina de 64b se realizo el mismo
&lt;br&gt;proceso pero no utilizando SMP y el tiempo de respuesta fue de 3horas y
&lt;br&gt;media (pareciera que postgres tiene problemas con varios procesadore) &amp;nbsp;
&lt;br&gt;&lt;br&gt;Existe alguna solución? o algún ajuste posible?, alguna recomendación?
&lt;br&gt;&amp;nbsp; 
&lt;br&gt;-- 
&lt;br&gt;__________________________
&lt;br&gt;Juan Jimmy Salazar Ramirez
&lt;br&gt;Ingeniero Informatico
&lt;br&gt;Analista Programador
&lt;br&gt;Solati Ltda.
&lt;br&gt;Medellin - &amp;nbsp;Colombia
&lt;br&gt;Tel. 268-75-51
&lt;br&gt;&lt;br&gt;&lt;br /&gt;&lt;br&gt;---------------------------(end of broadcast)---------------------------
&lt;br&gt;TIP 2: Don't 'kill -9' the postmaster
&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/PROBLEMAS-CON-POSTGRES-EN-MAQUINAS-MULTIPROCESADORES-tp4634358p4634358.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-1918350</id>
	<title>Re: [DOCS] [HACKERS] Please Help: PostgreSQL Query Optimizer</title>
	<published>2005-12-12T22:46:51Z</published>
	<updated>2005-12-12T22:46:51Z</updated>
	<author>
		<name>Josh Berkus</name>
	</author>
	<content type="html">Anjan,
&lt;br&gt;&lt;br&gt;&amp;gt; But, in PostgreSQL &amp;nbsp;all costs are &amp;nbsp;scaled relative to a page fetch. If we
&lt;br&gt;&amp;gt; make both sequential_page_fetch_cost and random_page_cost to &amp;quot;1&amp;quot;, then &amp;nbsp;we
&lt;br&gt;&amp;gt; need to increase the various cpu_* paramters by multiplying the default
&lt;br&gt;&amp;gt; values with appropriate &amp;nbsp;Scaling Factor. &amp;nbsp;Now, we need to determine this
&lt;br&gt;&amp;gt; Scaling Factor.
&lt;br&gt;&lt;br&gt;I see, so you're saying that because the real cost of a page fetch has 
&lt;br&gt;decreased, the CPU_* costs should increase proportionally because relative to 
&lt;br&gt;the real costs of a page fetch they should be higher? &amp;nbsp;That makes a sort of 
&lt;br&gt;sense.
&lt;br&gt;&lt;br&gt;The problem that you're going to run into is that currently we have no 
&lt;br&gt;particularly reason to believe that the various cpu_* costs are more than 
&lt;br&gt;very approximately correct as rules of thumb. &amp;nbsp;So I think you'd be a lot 
&lt;br&gt;better off trying to come up with some means of computing the real cpu costs 
&lt;br&gt;of each operation, rather than trying to calculate a multiple of numbers 
&lt;br&gt;which may be wrong in the first place.
&lt;br&gt;&lt;br&gt;I know that someone on this list was working on a tool to digest EXPLAIN 
&lt;br&gt;ANALYZE results and run statistics on them. &amp;nbsp; Can't remember who, though.
&lt;br&gt;&lt;br&gt;Also, I'm still curious on how you're handling shared_mem, work_mem and 
&lt;br&gt;maintenance_mem. &amp;nbsp;You didn't answer last time.
&lt;br&gt;&lt;br&gt;-- 
&lt;br&gt;Josh Berkus
&lt;br&gt;Aglio Database Solutions
&lt;br&gt;San Francisco
&lt;br&gt;&lt;br&gt;---------------------------(end of broadcast)---------------------------
&lt;br&gt;TIP 6: explain analyze is your friend
&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/-pgsql-chat--Please-Help%3A-PostgreSQL-Query-Optimizer-tp1890062p1918350.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-1896789</id>
	<title>Re: [DOCS] [HACKERS] Please Help: PostgreSQL Query Optimizer</title>
	<published>2005-12-11T14:06:01Z</published>
	<updated>2005-12-11T14:06:01Z</updated>
	<author>
		<name>Anjan Kumar. A.</name>
	</author>
	<content type="html">&lt;br&gt;&lt;br&gt;Since sequential access is not significantly faster than random access in a MMDB, random_page_cost will be approximately same as sequential page fetch cost.
&lt;br&gt;&lt;br&gt;As every thing is present in Main Memory, we need to give approximately same cost to read/write to Main Memory and CPU Related operations.
&lt;br&gt;&lt;br&gt;&lt;br&gt;But, in PostgreSQL &amp;nbsp;all costs are &amp;nbsp;scaled relative to a page fetch. If we make both sequential_page_fetch_cost and random_page_cost to &amp;quot;1&amp;quot;, then &amp;nbsp;we need to increase the various cpu_* paramters by multiplying the default values with appropriate &amp;nbsp;Scaling Factor. &amp;nbsp;Now, we need to determine this Scaling Factor.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Still, i want to confirm whether this approach is the correct one.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;On Sun, 11 Dec 2005, Josh Berkus wrote:
&lt;br&gt;&lt;div class='shrinkable-quote'&gt;&lt;br&gt;&amp;gt; Anjan,
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; In our case we are reading pages from Main Memory File System, but not from
&lt;br&gt;&amp;gt;&amp;gt; Disk. Will it be sufficient, if we change the &amp;nbsp;default values of above
&lt;br&gt;&amp;gt;&amp;gt; paramters in &amp;quot;src/include/optimizer/cost.h and
&lt;br&gt;&amp;gt;&amp;gt; src/backend/utils/misc/postgresql.conf.sample&amp;quot; as follows:
&lt;br&gt;&amp;gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;random_page_cost = 4;
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; This should be dramatically lowered. &amp;nbsp;It's supposed to represent the ratio of
&lt;br&gt;&amp;gt; seek-fetches to seq scans on disk. &amp;nbsp;Since there's no disk, it should be a
&lt;br&gt;&amp;gt; flat 1.0. &amp;nbsp; However, we are aware that there are flaws in our calculations
&lt;br&gt;&amp;gt; involving random_page_cost, such that the actual number for a system where
&lt;br&gt;&amp;gt; there is no disk cost would be lower than 1.0. &amp;nbsp; Your research will hopefully
&lt;br&gt;&amp;gt; help us find these flaws.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt;&amp;gt; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;cpu_tuple_cost = 2;
&lt;br&gt;&amp;gt;&amp;gt; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;cpu_index_tuple_cost = 0.2;
&lt;br&gt;&amp;gt;&amp;gt; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;cpu_operator_cost = 0.05;
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; I don't see why you're increasing the various cpu_* costs. &amp;nbsp;CPU costs would be
&lt;br&gt;&amp;gt; unaffected by the database being in memory. &amp;nbsp; In general, I lower these by a
&lt;br&gt;&amp;gt; divisor based on the cpu speed; for example, on a dual-opteron system I lower
&lt;br&gt;&amp;gt; the defaults by /6. &amp;nbsp; However, that's completely unrelated to using an MMDB.
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; So, other than random_page_cost, I don't know of other existing GUCs that
&lt;br&gt;&amp;gt; would be directly related to using a disk/not using a disk. &amp;nbsp;How are you
&lt;br&gt;&amp;gt; handling shared memory and work memory?
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; I look forward to hearing more about your test!
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt;
&lt;/div&gt;&lt;br&gt;-- 
&lt;br&gt;Regards.
&lt;br&gt;&lt;br&gt;Anjan Kumar A.
&lt;br&gt;MTech2, &amp;nbsp;Comp Sci.,
&lt;br&gt;www.cse.iitb.ac.in/~anjankumar
&lt;br&gt;______________________________________________________________
&lt;br&gt;Do not handicap your children by making their lives easy.
&lt;br&gt;&amp;nbsp;		-- Robert Heinlein
&lt;br&gt;&lt;br&gt;---------------------------(end of broadcast)---------------------------
&lt;br&gt;TIP 9: In versions below 8.0, the planner will ignore your desire to
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;choose an index scan if your joining column's datatypes do not
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;match
&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/-pgsql-chat--Please-Help%3A-PostgreSQL-Query-Optimizer-tp1890062p1896789.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-1895242</id>
	<title>Re: [DOCS] [HACKERS] Please Help: PostgreSQL Query Optimizer</title>
	<published>2005-12-11T12:41:36Z</published>
	<updated>2005-12-11T12:41:36Z</updated>
	<author>
		<name>Tom Lane-2</name>
	</author>
	<content type="html">Josh Berkus &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=1895242&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;josh@...&lt;/a&gt;&amp;gt; writes:
&lt;br&gt;&amp;gt; I don't see why you're increasing the various cpu_* costs.
&lt;br&gt;&lt;br&gt;You missed the point Josh --- these numbers are relative to the cost of
&lt;br&gt;a page fetch, so if page fetch is measured in microseconds instead of
&lt;br&gt;milliseconds, then you *do* want to bump the CPU costs up.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; regards, tom lane
&lt;br&gt;&lt;br&gt;---------------------------(end of broadcast)---------------------------
&lt;br&gt;TIP 4: Have you searched our list archives?
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://archives.postgresql.org&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://archives.postgresql.org&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/-pgsql-chat--Please-Help%3A-PostgreSQL-Query-Optimizer-tp1890062p1895242.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-1894064</id>
	<title>Re: [DOCS] [HACKERS] Please Help: PostgreSQL Query Optimizer</title>
	<published>2005-12-11T11:25:46Z</published>
	<updated>2005-12-11T11:25:46Z</updated>
	<author>
		<name>Josh Berkus</name>
	</author>
	<content type="html">Anjan,
&lt;br&gt;&lt;br&gt;&amp;gt; In our case we are reading pages from Main Memory File System, but not from
&lt;br&gt;&amp;gt; Disk. Will it be sufficient, if we change the &amp;nbsp;default values of above
&lt;br&gt;&amp;gt; paramters in &amp;quot;src/include/optimizer/cost.h and 
&lt;br&gt;&amp;gt; src/backend/utils/misc/postgresql.conf.sample&amp;quot; as follows:
&lt;br&gt;&amp;gt;
&lt;br&gt;&amp;gt; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;random_page_cost = 4;
&lt;br&gt;&lt;br&gt;This should be dramatically lowered. &amp;nbsp;It's supposed to represent the ratio of 
&lt;br&gt;seek-fetches to seq scans on disk. &amp;nbsp;Since there's no disk, it should be a 
&lt;br&gt;flat 1.0. &amp;nbsp; However, we are aware that there are flaws in our calculations 
&lt;br&gt;involving random_page_cost, such that the actual number for a system where 
&lt;br&gt;there is no disk cost would be lower than 1.0. &amp;nbsp; Your research will hopefully 
&lt;br&gt;help us find these flaws.
&lt;br&gt;&lt;br&gt;&amp;gt; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;cpu_tuple_cost = 2;
&lt;br&gt;&amp;gt; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;cpu_index_tuple_cost = 0.2;
&lt;br&gt;&amp;gt; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;cpu_operator_cost = 0.05;
&lt;br&gt;&lt;br&gt;I don't see why you're increasing the various cpu_* costs. &amp;nbsp;CPU costs would be 
&lt;br&gt;unaffected by the database being in memory. &amp;nbsp; In general, I lower these by a 
&lt;br&gt;divisor based on the cpu speed; for example, on a dual-opteron system I lower 
&lt;br&gt;the defaults by /6. &amp;nbsp; However, that's completely unrelated to using an MMDB.
&lt;br&gt;&lt;br&gt;So, other than random_page_cost, I don't know of other existing GUCs that 
&lt;br&gt;would be directly related to using a disk/not using a disk. &amp;nbsp;How are you 
&lt;br&gt;handling shared memory and work memory?
&lt;br&gt;&lt;br&gt;I look forward to hearing more about your test!
&lt;br&gt;&lt;br&gt;-- 
&lt;br&gt;Josh Berkus
&lt;br&gt;Aglio Database Solutions
&lt;br&gt;San Francisco
&lt;br&gt;&lt;br&gt;---------------------------(end of broadcast)---------------------------
&lt;br&gt;TIP 3: Have you checked our extensive FAQ?
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://www.postgresql.org/docs/faq&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.postgresql.org/docs/faq&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/-pgsql-chat--Please-Help%3A-PostgreSQL-Query-Optimizer-tp1890062p1894064.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-1890062</id>
	<title>[pgsql-chat] Please Help: PostgreSQL Query Optimizer</title>
	<published>2005-12-11T02:45:26Z</published>
	<updated>2005-12-11T02:45:26Z</updated>
	<author>
		<name>Anjan Kumar. A.</name>
	</author>
	<content type="html">&lt;br&gt;&lt;br&gt;I'm working on a project, whose implementation deals with PostgreSQL. A brief description of the project is given &amp;nbsp;below.
&lt;br&gt;&lt;br&gt;&amp;nbsp; Project Description:
&lt;br&gt;&amp;nbsp; --------------------
&lt;br&gt;&amp;nbsp; &amp;nbsp; In Main Memory DataBase(MMDB) entire database on the disk is loaded &amp;nbsp;on to the main memory during initial startup of the system. &amp;nbsp;There after all the references are made to database on the main memory. &amp;nbsp;When the system is going to shutdown, we will write back the database on &amp;nbsp;the main memory to disk. &amp;nbsp;Here, for the sake of recovery we are writing log records on to the disk &amp;nbsp;during the transaction execution.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; We want to implement MMDB by modifying PostgreSQL. We implemented &amp;nbsp;our own Main Memory File System to store the primary copy of the database in main memory, and Modified the PostgreSQL to access the data in the Main Memory File System.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; Now, in our implementation Disk access is completely avoided during normal transaction execution. So, we need to modify the Query Optimizer of PostgreSQL so that it wont &amp;nbsp;consider disk related costs during calculation of Query Costs. Query Optimizer should try to minimize the Processing Cost. The criteria for cost can be taken as the number of tuples that have to read/write from main memory, number of comparisons, etc.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; Can any one tell me the modifications needs to be incorporated to PostgreSQL, &amp;nbsp;so that it considers only Processing Costs during optimization of the Query.
&lt;br&gt;&lt;br&gt;In PostgreSQL, Path costs are measured in units of disk accesses. One sequential page fetch has cost 1. I think, in PostgreSQL following paramters are used in calculating the cost of the Query Path :
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;#random_page_cost = 4 &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; # units are one sequential page fetch cost
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;#cpu_tuple_cost = 0.01 &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;# (same)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;#cpu_index_tuple_cost = 0.001 &amp;nbsp; # (same)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;#cpu_operator_cost = 0.0025 &amp;nbsp; &amp;nbsp; # (same)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;#effective_cache_size = 1000 &amp;nbsp; &amp;nbsp;# typically 8KB each
&lt;br&gt;&lt;br&gt;&lt;br&gt;In our case we are reading pages from Main Memory File System, but not from Disk. Will it be sufficient, if we change the &amp;nbsp;default values of above paramters in &amp;quot;src/include/optimizer/cost.h and &amp;nbsp;src/backend/utils/misc/postgresql.conf.sample&amp;quot; as follows:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;random_page_cost = 4;
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;cpu_tuple_cost = 2;
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;cpu_index_tuple_cost = 0.2;
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;cpu_operator_cost = 0.05;
&lt;br&gt;&lt;br&gt;&lt;br&gt;Please help us in this regard. I request all of you to give comments/suggestions on this. Waiting for your kind help.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;-- 
&lt;br&gt;Thanks.
&lt;br&gt;&lt;br&gt;Anjan Kumar A.
&lt;br&gt;MTech2, &amp;nbsp;Comp Sci.,
&lt;br&gt;www.cse.iitb.ac.in/~anjankumar
&lt;br&gt;______________________________________________________________
&lt;br&gt;May's Law:
&lt;br&gt;&amp;nbsp;	The quality of correlation is inversly proportional to the density
&lt;br&gt;&amp;nbsp;	of control. &amp;nbsp;(The fewer the data points, the smoother the curves.)
&lt;br&gt;&lt;br&gt;---------------------------(end of broadcast)---------------------------
&lt;br&gt;TIP 4: Have you searched our list archives?
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://archives.postgresql.org&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://archives.postgresql.org&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/-pgsql-chat--Please-Help%3A-PostgreSQL-Query-Optimizer-tp1890062p1890062.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-61651</id>
	<title>Re: Error when try installing pgbench ?</title>
	<published>2005-05-21T01:42:00Z</published>
	<updated>2005-05-21T01:42:00Z</updated>
	<author>
		<name>Tomaz Borstnar</name>
	</author>
	<content type="html">you need to use gmake perhaps?
&lt;br&gt;&lt;br&gt;---------------------------(end of broadcast)---------------------------
&lt;br&gt;TIP 1: subscribe and unsubscribe commands go to &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=61651&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;majordomo@...&lt;/a&gt;
&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Re%3A-Error-when-try-installing-pgbench---tp61651p61651.html" />
</entry>

</feed>
