I am trying to find information regarding creation of B-tree index in postgres for variable length character data (Char/varchar type). Specifically, what pagination policy is used, does it use prefix BTree, or any other form of compression (encoding)?
Regards, VJ Anand ---------------------------(end of broadcast)--------------------------- TIP 3: if posting/reading through Usenet, please send an appropriate subscribe-nomail command to [EMAIL PROTECTED] so that your message can get through to the mailing list cleanly