On Sun, Sep 14, 2014 at 5:18 AM, Rohit Goyal <rhtgyl...@gmail.com> wrote: > Thanks for reply. But, I think i confused you. I am talking about access > using indexes. So, I assume that B+ tree store key-value pair where rohit is > the key and all the versions are its value. > > Another way to think is I have a secondary index on emp. name and there are > 4 rohit exist in DB. So, now B+ tree gives me 4 different tuple pointer for > each Rohit. I want to know the code portion for this where i can see all 4 > tuple pointer before each one have I/O access to fetch its tuple.
You may want to look at index_getnext(), index_getnext_tid(), and/or heap_hot_search_buffer(). -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
