Discover published sets by community

A non-clustered index does not affect the physical order but creates a separate object within the table. Multiple non-clustered indexes can exist. Pros: Do not interrupt physical order. More indexes possible. Cons: Can consume more space. Potentially slower updates.

A clustered index determines the physical order of data in a table and is generally on the primary key. One per table. Pros: Quick data retrieval. Cons: Only one possible per table. Insertion can be slow.

A secondary index, unlike primary index, can reference non-unique fields. It provides alternative search paths. Pros: Allows additional search options. Cons: Requires more space. Slower write operations.

Hash indexes use a hash function to compute the location of data. Pros: Fast data retrieval for equality searches. Cons: Doesn't support range queries. Hash collisions.

An index that uses bitmaps and is best suited for columns with a small number of distinct values. Pros: Very space-efficient for low-cardinality columns. Fast for read queries. Cons: Not suitable for high-cardinality columns. Slow updates.

A balanced tree structure that keeps data sorted and allows searches, insertions, deletions, and sequential access in logarithmic time. Pros: Versatile and performant. Cons: Maintenance overhead. Can become unbalanced.

A primary index is an ordered file fixed-length entries that act as a map to a file sorted on a key field. Pros: Fast access to data. Unique index for every record. Cons: Requires additional storage. Slower insert and delete operations.

A covering index is one that includes all of the columns retrieved by a query. Pros: Eliminates the need to read the table or cluster. Fast retrieval. Cons: Larger index size. Less efficient for write operations.