Post reply

NONCLUSTERED HASH index on memory optimized table

  • June 13, 2017 at 9:00 am

    #402172

    Indexes in memory optimized tables can be defined as NONCLUSTERED, HASH or NONCLUSTERED HASH.  NONCLUSTERED indexes are B-tress good for non-equality filter options, while HASH indexes are good for equality filter options.

    How about indexes that are both nonclustered and hash?  Does it mean that both a B-tree and hash are built for the index?

  • June 13, 2017 at 9:08 am

    #1946569

    No, it's a hash index. The indexes you have for in-memory tables are either hash indexes or range.
    Specifying HASH or NONCLUSTERED HASH gets you a hash index, specifying NONCLUSTERED only, or leaving out both of the keywords gets you a range index.
    Essentially, NONCLUSTERED is an optional keyword. The only place you need it in an in-memory table is when creating a primary key

    Gail Shaw
    Microsoft Certified Master: SQL Server, MVP, M.Sc (Comp Sci)
    SQL In The Wild: Discussions on DB performance with occasional diversions into recoverability

    We walk in the dark places no others will enter
    We stand on the bridge and no one may pass

Viewing 2 posts - 1 through 1 (of 1 total)

You must be logged in to reply to this topic. Login to reply