I wrote some records to a database to do some testing, which worked:
AutoDRS=# insert into job_classification
(dealer_id,date_changed,time_changed,jo
b_id) VALUES ('F65','1-Jul-2007','00:00',generate_series(1,100));
INSERT 0 100
AutoDRS=# insert into job_classification
(dealer_id,date_
On Thu, 2007-12-06 at 23:06 -0500, Rodrigo De León wrote:
> On Dec 6, 2007 10:44 PM, Ow Mun Heng <[EMAIL PROTECTED]> wrote:
> > I've got a desired output which looks something like this..
> >
> > vdt| count
> > +---
> > 1 | 514
> > 2 |27
> >
On Dec 6, 2007 10:44 PM, Ow Mun Heng <[EMAIL PROTECTED]> wrote:
> I've got a desired output which looks something like this..
>
> vdt| count
> +---
> 1 | 514
> 2 |27
> 3 |15
> 4 |
> 5 |12
> 6 |1
I've got a desired output which looks something like this..
vdt| count
+---
1 | 514
2 |27
3 |15
4 |
5 |12
6 |15
the query in psql is something like this..
select vdt, count(*) from footable
"Weber, Geoffrey M." <[EMAIL PROTECTED]> writes:
> My problems really are with performance consistency. I have tweaked the
> execution so that everything should run with sub-second execution times, but
> even after everything is running well, I can get at most a week or two of
> steady running bef
"Chris Velevitch" <[EMAIL PROTECTED]> writes:
> On Dec 7, 2007 2:39 AM, Tom Lane <[EMAIL PROTECTED]> wrote:
>> Is it worth the trouble? You didn't mention the statistics involved,
>> but ordinarily I'd think a non-equal condition is too nonselective
>> to justify the cost of maintaining an extra i
On Dec 7, 2007 2:39 AM, Tom Lane <[EMAIL PROTECTED]> wrote:
> "Chris Velevitch" <[EMAIL PROTECTED]> writes:
> > I have a query on a table:-
> > X between k1 and k2 or X < k1 and Y <> k3
>
> > where k1, k2, k3 are constants.
>
> > How would this query work, if I created an index on X and a part
On Dec 6, 2007, at 5:10 PM, Gregory Stark wrote:
It needs to store the number of bits present as well. Otherwise it
wouldn't be
able to tell apart B'1' and B'01' ... B'0001'
...
Only in the sense that numeric also has to store some meta data as
well like
the weight and display precision
On Dec 6, 2007, at 5:19 PM, Vyacheslav Kalinin wrote:
> It needs to store the number of bits present as well
Couldn't that be reduced to 1 byte that'd say how many bits count
in the last byte?
> Only in the sense that numeric also has to store some meta data
as well like
the weight and di
On Dec 7, 2007 2:39 AM, Scott Marlowe <[EMAIL PROTECTED]> wrote:
> On Dec 6, 2007 1:44 AM, Chris Velevitch <[EMAIL PROTECTED]> wrote:
> > I have a query on a table:-
> >
> > X between k1 and k2 or X < k1 and Y <> k3
> >
> > where k1, k2, k3 are constants.
> >
> > How would this query work, if
"Decibel!" <[EMAIL PROTECTED]> writes:
> On Dec 5, 2007, at 7:23 PM, Michael Glaesemann wrote:
>> On Dec 5, 2007, at 14:19 , Alex Mayrhofer wrote:
>>> i'm trying to find out the storage size for bit(n) data. My initial
>>> assumption would be that for any 8 bits, one byte of storage is required.
Glyn Astill wrote:
> How did that happen? The subject is totally different, so is the
> body.
It has an "In-Reply-To:" and possibly "References:" header which relates
it to the other thread.
The solution is simple. Don't reply to an existing message when you
want to post a new thread. Compose a
After some investigation into Open LDAP I discovered that a post that
states:
"A bind with a DN but with an empty password is equivalent to an
anonymous
bind, while a bind with a DN and with a wrong password is not;"
So could this cause a blank password to allow access to the database
as the LDAP
[posted again as it found it's way into another thread]
Hi people,
I intend to set up two slave servers, one using WAL shipping and one
using Slony I.
Are there any good tools, or scripts that'll help us check that both
replication methods are working?
I know theres Nagios - but what does this
How did that happen? The subject is totally different, so is the
body.
This is shit.
--- Gregory Stark <[EMAIL PROTECTED]> wrote:
> "Glyn Astill" <[EMAIL PROTECTED]> writes:
>
> > Hi people,
> >
> > I intend to set up two slave servers, one using WAL shipping and
> one
> > using Slony I.
>
> T
On Dec 5, 2007, at 7:23 PM, Michael Glaesemann wrote:
On Dec 5, 2007, at 14:19 , Alex Mayrhofer wrote:
i'm trying to find out the storage size for bit(n) data. My
initial assumption would be that for any 8 bits, one byte of
storage is required.
select pg_column_size(B'1') as "1bit",
On 12/6/07, Gregory Stark <[EMAIL PROTECTED]> wrote:
> "John Wells" <[EMAIL PROTECTED]> writes:
>
> > I see that BLOCK_SIZE can be set at compile time, but is there a way
> > to determine what block size is in use in a running system? I've been
> > searching but have been unsuccessful so far.
>
> p
"John Wells" <[EMAIL PROTECTED]> writes:
> I see that BLOCK_SIZE can be set at compile time, but is there a way
> to determine what block size is in use in a running system? I've been
> searching but have been unsuccessful so far.
postgres=# show block_size;
block_size
8192
(1 row
"Glyn Astill" <[EMAIL PROTECTED]> writes:
> Hi people,
>
> I intend to set up two slave servers, one using WAL shipping and one
> using Slony I.
This has nothing to do with "aggregate and ordering" the subject of the
message to which you're replying. You're more likely to see responses if you
pos
On Nov 26, 2007, at 6:09 PM, Simon Riggs wrote:
On Mon, 2007-11-26 at 16:01 -0800, Alex Vinogradovs wrote:
I've got a data warehouse with pretty high rate of insert into
partitioned tables. What I've noticed, is that rule-based
partitioning
seems to be somewhat slower than insertions made dir
On Nov 20, 2007, at 6:14 PM, Ow Mun Heng wrote:
On Mon, 2007-11-19 at 08:24 -0500, Bill Moran wrote:
In response to Ow Mun Heng <[EMAIL PROTECTED]>:
Even with the regular vacuuming and even a vacuum full ( on my
test DB)
I still see that perhaps something is wrong (from the below)
(I got t
On Dec 6, 2007, at 2:36 PM, Ted Byers wrote:
IS there such a thing? I can be the first to consider
this.
What I am aiming for is a solution with a couple
coupled tables, one of which represents state through
time and the other represents transactions or deltas
on the state. With one field
I see that BLOCK_SIZE can be set at compile time, but is there a way
to determine what block size is in use in a running system? I've been
searching but have been unsuccessful so far.
Thanks!
John
---(end of broadcast)---
TIP 6: explain analyze is y
Gauthier, Dave wrote:
> Future Enhancement?
> If the column's new value can fit in the space already being used by the
> existing value, just change the column value in place and leave the
> record alone. Would reduce the need for vacuum in many cases.
That's in 8.3. Not exactly like that (becau
--- Ted Byers <[EMAIL PROTECTED]> wrote:
> IS there such a thing? I can be the first to
> consider
> this.
>
OOPS. The mind is faster than the fingers. That
should have been "I can NOT be the first to consider
this.
Ted
---(end of broadcast)--
Hi people,
I intend to set up two slave servers, one using WAL shipping and one
using Slony I.
Are there any good tools, or scripts that'll help us check that both
replication methods are working?
I know theres Nagios - but what does this actually allow us to
monitor?
Also if I want to make bac
"Matthew Dennis" <[EMAIL PROTECTED]> writes:
> So, my question is if I can have PostgreSQL honor order by clauses such as:
>
> select trip_id, avg_vel(position, pos_time)
> from (select position, pos_time, trip_id from data order by pos_time)
> sorted_data
>
> Would this in fact guarantee that
IS there such a thing? I can be the first to consider
this.
What I am aiming for is a solution with a couple
coupled tables, one of which represents state through
time and the other represents transactions or deltas
on the state. With one field (a floating point
number) in the state table (or sh
Sometimes breaking the query down using nested cursors can help,
especially if the query has many joins. It usually makes behavior more
predicatable anyway.
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Merlin Moncure
Sent: Thursday, December 06, 2007 2
On Dec 6, 2007, at 2:22 PM, Weber, Geoffrey M. wrote:
I've been trying for quite a while to get Postgresql tuned for use
as an OLTP system. I have several PL/pgSQL functions that handle
inserts and updates to the main table and several near-real-time
daemons written that access the data a
Future Enhancement?
If the column's new value can fit in the space already being used by the
existing value, just change the column value in place and leave the
record alone. Would reduce the need for vacuum in many cases.
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTE
On Dec 6, 2007, at 1:22 PM, Weber, Geoffrey M. wrote:
I've been trying for quite a while to get Postgresql tuned for use
as an OLTP system. I have several PL/pgSQL functions that handle
inserts and updates to the main table and several near-real-time
daemons written that access the data a
On 12/6/07, Martijn van Oosterhout <[EMAIL PROTECTED]> wrote:
> On Thu, Dec 06, 2007 at 02:35:42PM -0500, John Wells wrote:
> > A bit beyond me I'm afriad, at least at my current level with
> > postgresql. Does anyone offer a commercial tool to do this? Or, would
> > anyone be interested in doing i
I want to create an aggregate that will give the average velocity (sum of
distance traveled / sum of elapsed time) from position and timestamps.
example:
create table data(position integer, pos_time timestamp, trip_id integer);
insert into data values(1, "time x", 1);
insert into data values(2,
On Thu, Dec 06, 2007 at 02:35:42PM -0500, John Wells wrote:
> A bit beyond me I'm afriad, at least at my current level with
> postgresql. Does anyone offer a commercial tool to do this? Or, would
> anyone be interested in doing it for a fee?
There was a tool pgfsck which could dump table data, but
On Dec 6, 2007 2:22 PM, Weber, Geoffrey M. <[EMAIL PROTECTED]> wrote:
> In my efforts to correct these consistency in execution problems, I have
> gone from vacuuming (with analyze) twice a day to every 30 minutes (how long
> it takes a vacuum analyze to run - another seeming problem because it
> s
On 12/5/07, Alvaro Herrera <[EMAIL PROTECTED]> wrote:
> Not that I know of.
>
> I think the simplest thing to get your tuples back is:
>
> 1. mark the transaction that deleted them as aborted in pg_clog
> 2. reset the hint bits in the deleted tuples, or hack your postgres copy
> to ignore hint bits
Henrik wrote:
> I think I have a clue why its so off. We update a value in that table about
> 2 - 3 million times per night and as update creates a new row it becomes
> bloated pretty fast. The table hade a size of 765 MB including indexes and
> after vacuum full and reindex it went down to 80k
I've been trying for quite a while to get Postgresql tuned for use as an
OLTP system. I have several PL/pgSQL functions that handle inserts and
updates to the main table and several near-real-time daemons written that
access the data and can take automated actions on it (email/page concerned
peopl
6 dec 2007 kl. 18.12 skrev Tom Lane:
Henrik Zagerholm <[EMAIL PROTECTED]> writes:
5 dec 2007 kl. 16.25 skrev Tom Lane:
Henrik Zagerholm <[EMAIL PROTECTED]> writes:
-> Bitmap Index Scan on tbl_archive_idx1
(cost=0.00..1150.47 rows=8 width=0) (actual time=1505.456..1505.456
rows=86053 loops=1
Both work (to_char and casting to numeric)
Thanks !
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Andreas
Kretschmer
Sent: Thursday, December 06, 2007 1:46 PM
To: pgsql-general@postgresql.org
Subject: Re: [GENERAL] reformatting floats ?
Gauthier, Dave
Gauthier, Dave <[EMAIL PROTECTED]> schrieb:
>
>
> Hi:
>
> if...
> create table coords (id int, x float, y float);
> then...
> insert into coords (id,x,y) values (1,1.000,2.001)
> and then...
> select * from coords
> i get...
> 1,1,2.001
> i want...
> 1.1.
Thanks
> Have anyone implemented or tried record-based log shipping?
> If so is there any other materials in the web other than the
> documentation (it has very few details about this)
>
>>I don't know exactly what you mean by "record-based log shipping", but
>>perhaps you're looking for somethin
On Thu, Dec 06, 2007 at 01:22:55PM -0500, Gauthier, Dave wrote:
> i get...
>
> 1,1,2.001
>
> i want...
>
> 1.1.000,2.001
>
> while retaining the numeric nature of the x,y data (for math ops in
> other operations).
I imagine you want to_char().
Have a nice day,
--
Mart
Hi:
if...
create table coords (id int, x float, y float);
then...
insert into coords (id,x,y) values (1,1.000,2.001)
and then...
select * from coords
i get...
1,1,2.001
i want...
1.1.000,2.001
while retaining the numeric nature of the x,y data
On Thu, 2007-12-06 at 09:30 -0800, SHARMILA JOTHIRAJAH wrote:
> Hi,
> Have anyone implemented or tried record-based log shipping?
> If so is there any other materials in the web other than the
> documentation (it has very few details about this)
> Thanks
> sharmila
>
I don't know exactly what yo
[EMAIL PROTECTED] (Marco Curtolo) writes:
> Hi, my question is this: it is possible to query, using SQL, an LDAP
> server and put these data to a table of a Postgres database (under
> linux) ???
Unfortunately, the LDAP model is more or less a "network model," which
doesn't fit terribly elegantly o
Hi,
Have anyone implemented or tried record-based log shipping?
If so is there any other materials in the web other than the documentation (it
has very few details about this)
Thanks
sharmila
Be a bett
On Wed, Dec 05, 2007 at 11:32:59AM +0200, Andrus wrote:
> I do'nt have this index.
> dok.kuupaev||dok.kellaaeg conditon should applied after index search is
> performed.
> It filters out only a small number of rows additionally to the plain kuupaev
> filter.
> So adding index on dok.kuupaev||dok.
Henrik Zagerholm <[EMAIL PROTECTED]> writes:
> 5 dec 2007 kl. 16.25 skrev Tom Lane:
>> Henrik Zagerholm <[EMAIL PROTECTED]> writes:
>>> -> Bitmap Index Scan on tbl_archive_idx1
>>> (cost=0.00..1150.47 rows=8 width=0) (actual time=1505.456..1505.456
>>> rows=86053 loops=16)
>>> Index Cond: (tbl_sha
6 dec 2007 kl. 15.25 skrev Bill Moran:
Henrik <[EMAIL PROTECTED]> wrote:
Hello list,
I have a table with 135 rows and it still takes up about 360MB with
only small columns. Details below.
db=# vacuum full tbl_archive;
VACUUM
db=# select * from
pg_size_pretty(pg_total_relation_size('tbl_arch
Brian Wipf <[EMAIL PROTECTED]> writes:
> Nearly 100% of the CPU is going into pmap_remove_range. The stack
> trace for pmap_remove_range, viewable within Shark, is:
> -> pmap_remove_range
> --> pmap_remove
> ---> vm_map_simplify
> > vm_map_remove
> -> task_terminate_internal
> --> exi
On Dec 6, 2007, at 9:58 AM, Bryan Murphy wrote:
On Dec 5, 2007 9:49 PM, Tom Lane <[EMAIL PROTECTED]> wrote:
Only access-share locks, but that could still be an issue if
anything in
your system likes to take exclusive locks. Have you looked into
pg_locks to see if anything's getting blocked?
On Dec 6, 2007 10:09 AM, Tom Lane <[EMAIL PROTECTED]> wrote:
> Why dump such a table at all? It evidently doesn't contain any
> data you need to preserve ...
>
> I forget which version you are running, but 8.2 pg_dump has an
> --exclude-table switch which'd work peachy for this.
I did not know ab
"Bryan Murphy" <[EMAIL PROTECTED]> writes:
> It does appear to be lock contention. I took a closer look this
> morning, and I noticed our web site was consistently locking up on a
> particular table, and there were a number of exclusive locks. I
> started eliminating various jobs, and found the o
On Dec 5, 2007 9:49 PM, Tom Lane <[EMAIL PROTECTED]> wrote:
> Only access-share locks, but that could still be an issue if anything in
> your system likes to take exclusive locks. Have you looked into
> pg_locks to see if anything's getting blocked?
>
> pg_dump is entirely capable of causing an un
On Dec 6, 2007 1:44 AM, Chris Velevitch <[EMAIL PROTECTED]> wrote:
> I have a query on a table:-
>
> X between k1 and k2 or X < k1 and Y <> k3
>
> where k1, k2, k3 are constants.
>
> How would this query work, if I created an index on X and a partial
> index on X where Y <> k3?
Ummm. Using A
I would like the code below to accept the returned value from t2.
How do I do it?
Thanks
Danny
===
err := dblink_connect('C',cname);
begin
execute dblink('C','SELECT t2()');
exception
when others then null;
end;
err :=
"Chris Velevitch" <[EMAIL PROTECTED]> writes:
> I have a query on a table:-
> X between k1 and k2 or X < k1 and Y <> k3
> where k1, k2, k3 are constants.
> How would this query work, if I created an index on X and a partial
> index on X where Y <> k3?
Is it worth the trouble? You didn't me
You could use a COALESCE instead of a case statement for simple case
like this. The below will treat a NULL as false and then when you do
not it becomes true. So NULLS will be set to true
UPDATE boolean_column SET boolean_column = NOT COALESCE(boolean_column,
false)
hope that helps,
Regina
On Thu, 06 Dec 2007 14:53:13 +0100
Cedric Boudin <[EMAIL PROTECTED]> wrote:
> > What if boolean_column is NULL?
> >
> > btw set bolean_column= not bolean_column works "as expected".
> >
> > template1=# select (not 't'::boolean),(not 'f'::boolean),(not
> > NULL::boolean);
> >
> > ?column? | ?column
Henrik <[EMAIL PROTECTED]> wrote:
>
> Hello list,
>
> I have a table with 135 rows and it still takes up about 360MB with
> only small columns. Details below.
>
> db=# vacuum full tbl_archive;
> VACUUM
> db=# select * from
> pg_size_pretty(pg_total_relation_size('tbl_archive'));
> pg_size_p
Hello list,
I have a table with 135 rows and it still takes up about 360MB with
only small columns. Details below.
db=# vacuum full tbl_archive;
VACUUM
db=# select * from
pg_size_pretty(pg_total_relation_size('tbl_archive'));
pg_size_pretty
360 MB
(1 row)
db=# select *
Charles.Hou wrote:
> this is the pg_log...
> after 2007-12-04 10:40:37 CST 15533 , it always autovacuum "template0"
> not mydatabase...
Is there an ERROR in the log? My guess is that template0 is in danger
of Xid wraparound and autovacuum wants to process it, but it can't for
some reason.
My sec
Ivan Sergio Borgonovo wrote:
> On Thu, 06 Dec 2007 13:38:31 +0100
> Cedric Boudin <[EMAIL PROTECTED]> wrote:
>
>
>> It was indeed a forest problem.
>> both:
>>
>> set bolean_column= not bolean_column
>> and
>> set bolean_column= case when bolean_column then 'f'::bool else
>> 't'::bool end;
>>
>>
am Thu, dem 06.12.2007, um 4:16:14 -0800 mailte Yancho folgendes:
> I am trying to create a function, which takes the nearest 3 hospitals
> to a point making use of a PostGIS function), and then check each
> hospital for the exact distance on roads (by making use of a pgRouting
> function).
>
>
am Tue, dem 04.12.2007, um 20:19:29 -0800 mailte pc folgendes:
> Hi,
>
> How to redirect the output of an sql command to a file?
> Thanks in advance
within psql you can use \o , from the shell you can use this:
[EMAIL PROTECTED]:~$ echo "select now()" | psql test > now.txt
[EMAIL PROTECTED]:~$
On Dec 5, 2007 9:19 AM, pc <[EMAIL PROTECTED]> wrote:
> Hi,
>
> How to redirect the output of an sql command to a file?
> Thanks in advance
if you are using psql
postgres=# \o ~/sql.out
postgres=# select * from foo;
the output will be directed to a file, when you need to stop doing it
postgre
Thank you very much for quick reply.
> can you please give us the types of dok.kuupaev and dok.kellaaeg? I
> think a simple fix is possible here.
dok.kuupaev type is DATE
dok.kellaaeg type is character(5) NOT NULL DEFAULT ''
and is used to represent dokument time in format hh mm
Databas
I am trying to create a function, which takes the nearest 3 hospitals
to a point making use of a PostGIS function), and then check each
hospital for the exact distance on roads (by making use of a pgRouting
function).
Below please find a copy of my function, and u can also find it
highlighted here
On 5 Des, 05:00, [EMAIL PROTECTED] (Tom Lane) wrote:
>
> Yeah, this is a problem. The SELECT will acquire AccessShareLock
> on R and P, and subsequently try to acquire AccessShareLock on all
> the inheritance children of P (and I don't think the order in which
> these locks are acquired is very cl
> I'm not sure what that comment is supposed to mean.
>
> PG is using the index for the condition
> dok.kuupaev BETWEEN '2007-11-01' AND '2007-12-04'
>
> but there is no index that matches the expression
> dok.kuupaev||dok.kellaaeg BETWEEN '2007-11-01' AND '2007-12-0423 59'
>
> If you look at your
Hi,
How to redirect the output of an sql command to a file?
Thanks in advance
---(end of broadcast)---
TIP 6: explain analyze is your friend
SHARMILA JOTHIRAJAH wrote:
> How do you install pg_standby. I get the following error when i try the
> Makefile
>
> [EMAIL PROTECTED]:~/postgres8.3/pgsql>
> /export/home/sj/postgresql-8.3beta3/contrib/pg_standby/Makefile
The Makefile is not a shell script. Run just "make" and then "make
insta
Yes, the write access is fine. I think I have a problem with syntax. I don't
know if there is a command switch on psql to redirect standard output to a
logfile. THere is one for any query results, but that does not happen to
contain the output of vacuum.
On 12/4/07, Martin Gainty <[EMAIL PROTECTED
this is the pg_log...
after 2007-12-04 10:40:37 CST 15533 , it always autovacuum "template0"
not mydatabase...
why?
i didn't change any configuration...
2007-12-04 10:14:55 CST 23858 LOG: autovacuum: processing database
"mydatabase"
2007-12-04 10:23:15 CST 31601 LOG: autovacuum: processing datab
> just small correction here...expressions like that in the create index
> need an extra set of parens (but I agree with your sentiment):
> CREATE INDEX dokindex ON dok ((kuupaeve||kellaaeg))
I tried
CREATE INDEX dok_kuupaev_kellaaeg_idx ON dok ((kuupaev||kellaaeg));
but got error
ERROR: functi
Thank you very much for your help Greg ...
I'll do as you say and install version 7.3 from rpm on a new Centos4.5
system and try to import the dump file.
If I'm sucsessful in getting it working on version 7.3 can you suggest the
next version I should upgrade to after that?
Very grateful
Ed
Hi, Tom:
>Whichever one manages to get to the index page first will go through.
>The second one will block waiting to see if the first one commits,
>and will error out if so --- or proceed, if it aborts.
I see, this makes sense. What if the two transactions insert rows
that don't violate the con
On Thu, 06 Dec 2007 13:38:31 +0100
Cedric Boudin <[EMAIL PROTECTED]> wrote:
> It was indeed a forest problem.
> both:
>
> set bolean_column= not bolean_column
> and
> set bolean_column= case when bolean_column then 'f'::bool else
> 't'::bool end;
>
> do work perfectly.
What if boolean_column is
>The main thing that's improved in 8.3 is the integration of pg_standby
as
>a more rugged restore_command than most people were coding on their
own:
>http://www.postgresql.org/docs/8.3/static/pgstandby.html
>You should use it instead of the example restore.sh included in the
>message I refe
Cedric Boudin wrote:
> Most honourable members of the list,
>
> this is a simple one, but I can't find the solution ( probably a
> forest/tree problem).
>
> update table set bolean_column = set_it_to_its_inverse where fk =
> some_value;
>
> or join me in the dark forest
>
> cedric
>
>
> ---
On Dec 6, 2007 8:03 AM, Efraín López <[EMAIL PROTECTED]> wrote:
> Thank you for your reply
>
> but I got the error 'LC_MESSAGES' : undeclared identifier
>
> locale.h only defines LC_COLLATE, LC_CTYPE, LC_MONETARY, LC_NUMERIC,
> LC_TIME
>
> I tried to set a system variable LC_MESSAGES, but didn't w
Marco Curtolo write:
> Hi, my question is this: it is possible to query, using SQL,
> an LDAP server and put these data to a table of a Postgres
> database (under linux) ???
Yes, by writing a function in C that uses the LDAP API.
Yours,
Laurenz Albe
---(end of broadcast
Cedric Boudin wrote:
>
> Most honourable members of the list,
>
> this is a simple one, but I can't find the solution (
> probably a forest/tree problem).
>
> update table set bolean_column = set_it_to_its_inverse where
> fk = some_value;
>
I am usually a newbie around here, but this is one
CON TODOMONDO: occasioni speciali a prezzi straordinari, fino al 50%
di sconto su voli e viaggi!
Clicca qui: http://adv.email.it/cgi-bin/foclick.cgi?mid=7277&d=20071206
---(end of broadcast)---
TIP 4: Have you searched our list a
On Thu, 6 Dec 2007, A. Kretschmer wrote:
update table set bolean_column = set_it_to_its_inverse where fk =
some_value;
I've used:
update table set bolean_column = not boolean_column where fk =
some_value;
which has worked for me well.
Daniel
---(end of broadcast)---
am Thu, dem 06.12.2007, um 10:25:26 +0100 mailte Cedric Boudin folgendes:
> Most honourable members of the list,
>
> this is a simple one, but I can't find the solution ( probably a
> forest/tree problem).
>
> update table set bolean_column = set_it_to_its_inverse where fk =
> some_value;
test=
Most honourable members of the list,
this is a simple one, but I can't find the solution ( probably a
forest/tree problem).
update table set bolean_column = set_it_to_its_inverse where fk =
some_value;
or join me in the dark forest
cedric
---(end of broadcast)-
On Thu, Dec 06, 2007 at 09:42:19AM +0100, Marco Curtolo wrote:
>
> Hi, my question is this: it is possible to query, using SQL, an LDAP server
> and put these data to a table of a Postgres database (under linux) ???
Depending on exactly what you nede to do, check out dblink-ldap
(http://pgfoundr
On 12/6/07, Marco Curtolo <[EMAIL PROTECTED]> wrote:
> Hi, my question is this: it is possible to query, using SQL, an LDAP server
> and put these data to a table of a Postgres database (under linux) ???
I don't know of any LDAP server implementations that can
be queried via SQL, and getting LDAP
Hi, my question is this: it is possible to query, using SQL, an LDAP server and
put these data to a table of a Postgres database (under linux) ???
Thanks to all.
_
Scarica GRATIS 30 emoticon per Messenger!
http://www.emoticons-livem
92 matches
Mail list logo
