DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=yahoo.com;
	h=X-YMail-OSG:Received:X-Mailer:Message-ID:Date:From:Reply-To:Subject:To:MIME-Version:Content-Type;
	b=AjVL5l5AEGIUq8L01T3+n4/KBSiNZdpY2r0laFjp4CudLGMMAHq/K5cj4PuwYMwNQfR70hzECjgQuLfjAW4DPccKA+DenGsdVLVcnC+wHZAlkKad9woye1C6f7e6nwebOBXWFyS6Kv4eXbLp8zSR1/ubw9IpZKA0vr1IkpjZIi4=;
Message-ID: <1335379923.47084.YahooMailNeo@web184514.mail.ne1.yahoo.com>
Date: Wed, 25 Apr 2012 11:52:03 -0700 (PDT)
From: Venki Ramachandran <venki_ramachandran@yahoo.com>
Reply-To: Venki Ramachandran <venki_ramachandran@yahoo.com>
Subject: Parallel Scaling of a pgplsql problem
To: "pgsql-performance@postgresql.org" <pgsql-performance@postgresql.org>
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="-986170028-289403806-1335379923=:47084"

---986170028-289403806-1335379923=:47084
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: quoted-printable

Hi all:=0ACan someone please guide me as to how to solve this problem? If t=
his is the wrong forum, please let me know which one to post this one in. I=
 am new to Postgres (about 3 months into it)=0A=0AI have PostGres 9.0 datab=
ase in a AWS server (x-large) and a pgplsql program that does some computat=
ion. It takes in a date range and for one pair of personnel (two employees =
in a company) it calculates some values over the time period. It takes abou=
t 40ms (milli seconds) to complete and give me the answer. All good so far.=
=0A=0ANow I have to run the same pgplsql on all possible combinations of em=
ployees and with 542 employees that is about say 300,000 unique pairs.=0A=
=0ASo (300000 * 40)/(1000 * 60 * 60) =3D 3.33 hours and I have to rank them=
 and show it on a screen. No user wants to wait for 3 hours, =A0they can pr=
obably wait for 10 minutes (even that is too much for a UI application). Ho=
w do I solve this scaling problem? Can I have multiple parellel sessions an=
d each session have multiple/processes that do a pair each at 40 ms and the=
n collate the results. Does PostGres or pgplsql have any parallel computing=
 capability.=0A=0AThanks, Venki
---986170028-289403806-1335379923=:47084
Content-Type: text/html; charset=iso-8859-1
Content-Transfer-Encoding: quoted-printable

<html><body><div style=3D"color:#000; background-color:#fff; font-family:ta=
homa, new york, times, serif;font-size:10pt"><div>Hi all:</div><div>Can som=
eone please guide me as to how to solve this problem? If this is the wrong =
forum, please let me know which one to post this one in. I am new to Postgr=
es (about 3 months into it)</div><div><br></div><div>I have PostGres 9.0 da=
tabase in a AWS server (x-large) and a pgplsql program that does some compu=
tation. It takes in a date range and for one pair of personnel (two employe=
es in a company) it calculates some values over the time period. It takes a=
bout 40ms (milli seconds) to complete and give me the answer. All good so f=
ar.</div><div><br></div><div>Now I have to run the same pgplsql on all poss=
ible combinations of employees and with 542 employees that is about say 300=
,000 unique pairs.</div><div><br></div><div>So (300000 * 40)/(1000 * 60 * 6=
0) =3D 3.33 hours and I have to rank them and show it on a screen. No
 user wants to wait for 3 hours, &nbsp;they can probably wait for 10 minute=
s (even that is too much for a UI application). How do I solve this scaling=
 problem? Can I have multiple parellel sessions and each session have multi=
ple/processes that do a pair each at 40 ms and then collate the results. Do=
es PostGres or pgplsql have any parallel computing capability.</div><div><b=
r></div><div>Thanks, Venki</div></div></body></html>
---986170028-289403806-1335379923=:47084--