From: | "tjk(at)tksoft(dot)com" <tk(at)uno(dot)tksoft(dot)com> |
---|---|
To: | pgsql-sql(at)postgreSQL(dot)org |
Subject: | user defined function speeds |
Date: | 1999-07-16 22:24:05 |
Message-ID: | 199907162224.PAA14483@uno.tksoft.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers pgsql-sql |
> > Good plan. Although you could sort by a user-defined function result,
> > it's likely to be horribly slow (because user-defined functions are
> > slow:-().
What is the actual overhead from using a userdefined
function (a C function, say)?
Obviously there is an overhead involved in calling
any function. I would like to know what kind of issues
are involved when using results of a user defined function for
sorting.
Are the results calculated only once, as one would expect,
for example.
Thanks,
Troy
Troy Korjuslommi Tksoft OY, Inc.
tjk(at)tksoft(dot)com Software Development
Open Source Solutions
Hosting Services
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 1999-07-16 23:01:41 | Re: AW: [HACKERS] shared lib names |
Previous Message | Tom Lane | 1999-07-16 21:56:44 | Re: [SQL] Re: [HACKERS] Counting bool flags in a complex query |
From | Date | Subject | |
---|---|---|---|
Next Message | Wayne Piekarski | 1999-07-17 03:40:04 | Fix up for BTP_CHAIN problems |
Previous Message | Tom Lane | 1999-07-16 21:56:44 | Re: [SQL] Re: [HACKERS] Counting bool flags in a complex query |