Indexes for Memory-Optimized Tables

Indexes for Memory-Optimized Tables

A hash index is preferable over a nonclustered index when:

  • Queries test the indexed columns by use of a WHERE clause with an exact equality on all index key columns

 

in_memory_indexes

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s