Re: Fwd: Test of Algorithm || Indexing Scheme

<p dir="ltr">Hi,<br /> Can you pls tel me how can achieve which sound pretty exotic to you. <p dir="ltr">Can u please
sharesome relevant documents.  I havw no clue from where to start. <p dir="ltr">Regards<br /> Rohit<div
class="gmail_quot<blockquoteclass=" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">On
11.11.201314:12, Rohit Goyal wrote:<br /><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc
solid;padding-left:1ex">Hi,<br /> Thanks for reply.<br /> I actually want to make some changes in all operations on
indexlike<br /> insert, update, delete.<br /> for example, i want store a new customized value for every key inserted
in<br/> b tree instead of storing Tuple Id as value.<br /></blockquote><br /> That sounds pretty exotic, I can't
imaginewhat good the index will do if it doesn't contain tuple IDs.<br /><br /><blockquote class="gmail_quote"
style="margin:00 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"> Can you also pls explain me more about appoach to
followto use my<br /> algorithm as GiST opclass. I dont have much knowledge abt this also?<br /></blockquote><br /> See
usermanual, and the examples in the server code and contrib.<br /><br /> - Heikki<br /></div>