Am 04.01.13 21:26, schrieb Tom Lane:
Samuel Vogel 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
Hello,
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
letest WHERE id = 50;
Any help with reviewing my my small attached patch would be greatly
appreciated!
Regards,
Samuel Vogel
diff --git src/backend/access/nbtree/nbtsearch.c
src/backend/access/nbtree/nbtsearch.c
index
ac98589477b876cfc8470ea03fb39fa43d5ea9c5..e07ae925332a923da73eb2bb28809e79f
ue like "17: 16396", binary
search should also find 12 first, right?
Regards,
Samuel Vogel
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-hackers
Am 18.07.12 23:56, schrieb Tom Lane:
Samuel Vogel writes:
How would the b-tree know exactly that a value is only a reference? And
even in that case you say that it could get the bits, but make no use of
it, since it does not know what they represent, right?
It has access to the data type&#
Am 17.07.12 19:38, schrieb Tom Lane:
btree knows nothing about the datatypes it's working on except that
they have comparison functions. Converting the values to some sort of
numeric scale that you can interpolate on seems logically dubious and
fraught with practical difficulties. Now, we do ha
Am 17.07.12 05:21, schrieb Tom Lane:
Samuel Vogel writes:
I'm currently on a university research project if performance could be
increased by substituting different inter-node search algorithms instead
of the currently used binary search.
Hm, what have you got in mind exactly?
At fi
sed commonly for many things that it's hard
to find the interesting bits for me.
I would like to know how the b-tree and column indexes interact. The
readmes for the b-tree seem really implementation centric and I'm not
getting a hold the whole picture.
Regards,
Samuel Vogel
--
Se
