X-Original-To: pgsql-performance-postgresql.org@localhost.postgresql.org Received: from localhost (unknown [64.117.224.130]) by svr1.postgresql.org (Postfix) with ESMTP id CF9ADD1B51C for ; Mon, 29 Sep 2003 16:35:33 +0000 (GMT) Received: from svr1.postgresql.org ([64.117.224.193]) by localhost (neptune.hub.org [64.117.224.130]) (amavisd-new, port 10024) with ESMTP id 18639-06 for ; Mon, 29 Sep 2003 13:35:05 -0300 (ADT) Received: from sss.pgh.pa.us (unknown [192.204.191.242]) by svr1.postgresql.org (Postfix) with ESMTP id F275AD1B52A for ; Mon, 29 Sep 2003 13:35:04 -0300 (ADT) Received: from sss2.sss.pgh.pa.us (tgl@localhost [127.0.0.1]) by sss.pgh.pa.us (8.12.10/8.12.10) with ESMTP id h8TGXd6c025271; Mon, 29 Sep 2003 12:33:39 -0400 (EDT) To: Shridhar Daithankar Cc: Oleg Lebedev , Mary Edie Meredith , Jenny Zhang , pgsql-performance Subject: Re: TPC-R benchmarks In-reply-to: <3F784607.5020705@persistent.co.in> References: <993DBE5B4D02194382EC8DF8554A52731E782A@postoffice.waterford.org> <3F784607.5020705@persistent.co.in> Comments: In-reply-to Shridhar Daithankar message dated "Mon, 29 Sep 2003 20:17:35 +0530" Date: Mon, 29 Sep 2003 12:33:39 -0400 Message-ID: <25270.1064853219@sss.pgh.pa.us> From: Tom Lane X-Virus-Scanned: by amavisd-new at postgresql.org X-Archive-Number: 200309/367 X-Sequence-Number: 3733 Shridhar Daithankar writes: > Also if you have fast disk drives, you can reduce random page cost to 2 or 1.5. Note however that most of the people who have found smaller random_page_cost to be helpful are in situations where most of their data fits in RAM. Reducing the cost towards 1 simply reflects the fact that there's no sequential-fetch advantage when grabbing data that's already in RAM. When benchmarking with data sets considerably larger than available buffer cache, I rather doubt that small random_page_cost would be a good idea. Still, you might as well experiment to see. regards, tom lane