: about 200 MB.
* Disk is 4 MB. I guess it must be about what, 4500 RPM?
* fsync is disabled.
I don't know what other info to provide...
Thanks in advance.
--
Octavio Alvarez Piza.
E-mail: [EMAIL PROTECTED]
---(end of broadcast)---
TIP 5: Have you
loops=1)
Index Cond: (period = $0)
Total runtime: 131.95 msec
(6 rows)
pgdb=# select version();
version
-
PostgreSQL 7.3.4 on i386-redhat-linux-gnu, compiled by GCC 2.96
(1 row)
--
Octavio
Tomasz Myrta said:
Dnia 2004-02-06 08:19, U¿ytkownik Octavio Alvarez napisa³:
In each couple, the first one has a WHERE field = function()
condition, just like the second one, but in the form WHERE field =
(SELECT function()). In my opinion, both should have the same execution
plan
(cygming special)
(1 row)
--
Octavio Alvarez.
E-mail: [EMAIL PROTECTED]
Agradezco que sus correos sean enviados siempre a esta dirección.
--
Octavio Alvarez.
E-mail: [EMAIL PROTECTED]
Agradezco que sus correos sean enviados siempre a esta dirección.
---(end of broadcast
I'm aware you already know that information_schema is slow [1] [2], so I
just want to expose/document another case and tests I did.
I'm using the following view to check what tables depend on what other
tables.
CREATE VIEW raw_relation_tree AS
SELECT
tc_p.table_catalog AS parent_catalog,
On Sat, 2009-02-14 at 15:02 -0500, Tom Lane wrote:
Octavio Alvarez alvar...@alvarezp.ods.org writes:
The result, on the above view: ~80ms. Fair enough. But if I apply a
condition:
SELECT * FROM ___pgnui_relation_tree.raw_relation_tree WHERE
parent_schema child_schema;
it takes ~2
Hello.
I have a tree-like table with a three-field PK (name, date, id) and one
parent field.
It has 5k to 6k records as of now, but it will hold about 1 million
records.
I am trying the following WITH RECURSIVE query:
WITH RECURSIVE t AS (
SELECT par.id AS tid, par.name,
