We did fulltext search using relevancy function implemented as SPI
postgres mechanism. We use coordinate information of words in text to
calculate weights. I'm harry right now, because is going to airport,
sorry, couldn't give any details.
Regards,
Oleg
On Tue, 12 Sep 20
Where can I find a tutorial on PL/SQL for postgres? Is there any
documentation focused on it on postgres' site?
Thank you
It took quite a bit of trial and error, but I finally got it!
SELECT emp,
SUM (CASE WHEN earncode IN ('R','C','X') THEN (hi_shift-lo_shift)
ELSE 0 END) AS reghrs,
SUM (CASE WHEN earncode IN ('R','C','X') THEN 0 ELSE
(hi_shift-lo_shift) END) AS ovrhrs
FROM timesheet
GROUP
Mr. Vincent,
> I emailed the list a while back about doing some weighted searching, asking
> if anyone had implemented any kind of weighted search in PostgreSQL.. I'm
> still wondering the same thing and if anyone has, I would greatly appreciate
> a private email, I'd like to discuss it in detail
Hi, there
I hava a very odd problem,
I have table named categories, it's been used for a long time,
nobody change anything on it, I have a script to read it out
every day, however, I got Permission deny, those script has been
used for a long time.
When I want to check the permission of the t
I'm not sure how fast it is, but something like this
would work, right?
WHERE
(CASE WHEN degree='MBA' THEN 10 ELSE 0 END +
CASE WHEN years_experience='5' THEN 10 ELSE 0 END _
CASE WHEN location_state='Arizona' THEN 10 ELSE 0 END)
>=20
Also, wouldn't you usually want to be searching where the
w
I emailed the list a while back about doing some weighted searching, asking
if anyone had implemented any kind of weighted search in PostgreSQL.. I'm
still wondering the same thing and if anyone has, I would greatly appreciate
a private email, I'd like to discuss it in detail.. I have several idea
On Mon, Sep 11, 2000 at 01:27:48PM +0100, Trewern, Ben wrote:
> Anybody know how to make a tree structure using related tables using
> Postgres. Something like a directory structure is what I'm aiming for. I'm
> sure there is an easy way but I'm having probs.
I am not quite sure whether this is
Title: RE: [SQL] Tree structure
Any details you can supply would be appreciated. I have got a table at the moment as:
id | group_name | parentid
---
1 | Main |
2 | Group |
3 | User |
4 | Group1 | 1
5 | Group2 | 1
Thanks for your offer, I'll be very interested to see how you did that. I
also found very interesting solution at
http://www.dbmsmag.com/9603d06.html
http://www.dbmsmag.com/9604d06.html
http://www.dbmsmag.com/9605d06.html
At 11:22 12.9.2000 , kovacsz wrote:
>We are using tree structures (and par
10 matches
Mail list logo