s.
Any other solutions are of cause welcome.
Many thanks,
- David
David M. Kidd
Research Associate
Center for Population Biology
Silwood Park Campus
Imperial College London
0207 594 2470
ect NEW.node_id, ancestor_id
from NEW left outer join ancestors on (NEW.parent_id =
ancestors.node_id);
return NEW;'
language 'plpgsql';
create trigger tr_i_nodes after insert
on nodes for each row
execute procedure pr_tr_i_nodes();
David M wrote:
> I am maintainin
I am maintaining a set of hierarchical data that looks a lot like a
tree. (And my SQL is very rusty. And I'm new to postgres.)
Questions:
-
1.) Is the following a reasonable solution? Is there a
postgres-specific way to handle this better? Is there a good generic
SQL way to handle
Hello!
Im using several views for the Usermanagment of a database.
My question is:
How does postgres keep the views consistent to the according tables( if
the original table has been changed)?
Is there a Rule? and how is the Rule invoked. With ON DELETE UPDATE
INSERT of the original table?
I d
Hi!
Thanks, to You!
Yes I have to do . Now I solved that problem with rename the original
table study to _study
then create the new right structured table study , Insert into study
(chilioid,...,...) SELECT * FROM _study;
Ok not elegant but it works.
Another questions:
Can I change the physic
Hello!
I want to restructure a table called study.
this table has the following structure:
Table "study"
Attribute| Type | Modifier
++--
chilioid | character varying(80)
Hallo Stephan!
Are there several versions of dbPG95GetIndex existing, or did you
mention postgres version 7.1.2?
With a little help I have killed the Problem!! Yeah,
But now I trying to improve the C-code. Do You have any experience with
optimizing C-Code. Are there some new miracle-like functio
to me? Why is the usertime increased and the
whole time is decreased?
#
Anyway ..
Thanks all a lot for Your effort.
I will now tune my radiology-database further...
Thankful Greetings
David
"David M. Richter" <[EMAIL PROTECTED]> writes:
> The query with the 3 tables is fast
ying(128) |
patientoid | character varying(80) |
The times of the processes are escape-eliminated by statistical methods.
I determined that the "compare" database is 8% times faster than the new
restructured "pacs" database.
How can I understand this? Whats
haracter varying(80) |
The times of the processes are escape-eliminated by statistical methods.
I determined that the "compare" database is 8% times faster than the new
restructured "pacs" database.
How can I understand this? Whats my mistake?
Anybody who can make some
10 matches
Mail list logo