Groups | Search | Server Info | Login | Register

Groups > comp.databases.ingres > #3851

btree primary index vs heap and secondary btree index

Show all headers | View raw

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?

Back to comp.databases.ingres | Previous | Next | Find similar

Thread

btree primary index vs heap and secondary btree index nikosv <nikos.vaggalis@gmail.com> - 2022-09-16 05:53 -0700

csiph-web