From: | Samuel Vogel <s(at)muel-vogel(dot)de> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: Print b-tree tuples |
Date: | 2013-01-11 15:33:01 |
Message-ID: | 50F030AD.1080905@muel-vogel.de |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Am 04.01.13 21:26, schrieb Tom Lane:
> Samuel Vogel <s(at)muel-vogel(dot)de> writes:
>> I'm trying to print out the tuples in the b-tree nodes for analysis, but
>> when iterate over more than the first entry of the tuples (scanKey++), I
>> strangely get the error below on query execution:
>> ERROR: relation "simpletest" does not exist
>> LINE 1: SELECT * FROM simpletest WHERE id = 50;
> Is this patch the only thing you changed? The only obvious explanation
> for the above error (other than "you fat-fingered the query") seems to
> be that you caused index searches in pg_class to fail, but I don't see
> how this patch could be affecting the result of _bt_binsrch.
Yes, I've switched to a clean master and only applied this patch. If I
put the the break, the query works, so it's fine as well.
BTW: I just had a discussion if it would make sense, to recreate my test
table with a different order, as a b-tree is always dependent on
insertion order. But as the b-tree index is newly created in memory
after each restart, two different insertion orders (same values) would
give me the same b-tree at least after a restart, right?
Regards,
Samuel
From | Date | Subject | |
---|---|---|---|
Next Message | Pavel Stehule | 2013-01-11 15:42:03 | Re: ToDo: log plans of cancelled queries |
Previous Message | Tom Lane | 2013-01-11 15:31:24 | Re: ToDo: log plans of cancelled queries |