[Info-ingres] btree primary index vs heap and secondary btree index

[nikosv]

what would be the difference between a table created with storage structure as  btree with unique keys and one that is created with storage structure as heap and with a secondary b-tree index on unique keys ? i.e would the retrieval speed vary and what are the pros and cons?