btree primary index vs heap and secondary btree index
From nikosv@21:1/5 to All on Fri Sep 16 05:53:08 2022
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?