Update showplan-logical-and-physical-operators-reference.md

Author: pmasl

docs/relational-databases/showplan-logical-and-physical-operators-reference.md

@@ -188,7 +188,6 @@ monikerRange: "=azuresqldb-current||>=sql-server-2016||=sqlallproducts-allversio
 |![Bitmap operator icon](../relational-databases/media/bitmap-32x.gif "Bitmap operator icon")|**Bitmap Create**|The **Bitmap Create** operator appears in the Showplan output where bitmaps are built. **Bitmap Create** is a logical operator.| 
 |![Bitmap operator icon](../relational-databases/media/bitmap-32x.gif "Bitmap operator icon")|**Bitmap**|[!INCLUDE[ssNoVersion](../includes/ssnoversion-md.md)] uses the **Bitmap** operator to implement bitmap filtering in parallel query plans. Bitmap filtering speeds up query execution by eliminating rows with key values that cannot produce any join records before passing rows through another operator such as the **Parallelism** operator. A bitmap filter uses a compact representation of a set of values from a table in one part of the operator tree to filter rows from a second table in another part of the tree. By removing unnecessary rows early in the query, subsequent operators have fewer rows to work with, and the overall performance of the query improves. The optimizer determines when a bitmap is selective enough to be useful and in which operators to apply the filter. **Bitmap** is a physical operator.| 
 |![Bookmark lookup operator icon](../relational-databases/media/bookmark-lookup-32x.gif "Bookmark lookup operator icon")|**Bookmark Lookup**|The **Bookmark Lookup** operator uses a bookmark (row ID or clustering key) to look up the corresponding row in the table or clustered index. The **Argument** column contains the bookmark label used to look up the row in the table or clustered index. The **Argument** column also contains the name of the table or clustered index in which the row is looked up. If the WITH PREFETCH clause appears in the **Argument** column, the query processor has determined that it is optimal to use asynchronous prefetching (read-ahead) when looking up bookmarks in the table or clustered index.<br /><br /> **Bookmark Lookup** is not used in [!INCLUDE[ssCurrent](../includes/sscurrent-md.md)]. Instead, **Clustered Index Seek** and **RID Lookup** provide bookmark lookup functionality. The **Key Lookup** operator also provides this functionality.| 
-|![Bookmark lookup operator icon](../relational-databases/media/bookmark-lookup-32x.gif "Bookmark lookup operator icon")|**Key Lookup**|The **Key Lookup** operator is a bookmark lookup on a table with a clustered index. The **Argument** column contains the name of the clustered index and the clustering key used to look up the row in the clustered index. **Key Lookup** is always accompanied by a **Nested Loops** operator. If the WITH PREFETCH clause appears in the **Argument** column, the query processor has determined that it is optimal to use asynchronous prefetching (read-ahead) when looking up bookmarks in the clustered index.<br /><br /> The use of a **Key Lookup** operator in a query plan indicates that the query might benefit from performance tuning. For example, query performance might be improved by adding a covering index.| 
 |None|**Branch Repartition**|In a parallel query plan, sometimes there are conceptual regions of iterators. All of the iterators within such a region can be executed by parallel threads. The regions themselves must be executed serially. Some of the **Parallelism** iterators within an individual region are called **Branch Repartition**. The **Parallelism** iterator at the boundary of two such regions is called **Segment Repartition**. **Branch Repartition** and **Segment Repartition** are logical operators.| 
 |None|**Broadcast**|**Broadcast** has one child node and *n* parent nodes. **Broadcast** sends its input rows to multiple consumers on demand. Each consumer gets all of the rows. For example, if all of the consumers are build sides of a hash join, then *n* copies of the hash tables will be built.| 
 |![Build hash operator icon](../relational-databases/media/build-hash.gif "Build hash operator icon")|**Build Hash**|Indicates the build of a batch hash table for an xVelocity memory optimized columnstore index.| 
@@ -229,6 +228,7 @@ monikerRange: "=azuresqldb-current||>=sql-server-2016||=sqlallproducts-allversio
 |![Inserted scan operator icon](../relational-databases/media/inserted-scan-32x.gif "Inserted scan operator icon")|**Inserted Scan**|The **Inserted Scan** operator scans the **inserted** table. **Inserted Scan** is a logical and physical operator.| 
 |![Intrinsic language element icon](../relational-databases/media/intrinsic-32x.gif "Intrinsic language element icon")|**Intrinsic**|The **Intrinsic** operator invokes an internal [!INCLUDE[tsql](../includes/tsql-md.md)] function. **Intrinsic** is a language element.| 
 |![Iterator catchall operator icon](../relational-databases/media/iterator-catch-all.gif "Iterator catchall operator icon")|**Iterator**|The **Iterator** catchall icon is displayed when a suitable icon for the iterator cannot be found by the logic that produces graphical Showplans. The catchall icon does not necessarily indicate an error condition. There are three catchall icons: blue (for iterators), orange (for cursors), and green (for [!INCLUDE[tsql](../includes/tsql-md.md)] language constructs).| 
+|![Bookmark lookup operator icon](../relational-databases/media/bookmark-lookup-32x.gif "Bookmark lookup operator icon")|**Key Lookup**|The **Key Lookup** operator is a bookmark lookup on a table with a clustered index. The **Argument** column contains the name of the clustered index and the clustering key used to look up the row in the clustered index. **Key Lookup** is always accompanied by a **Nested Loops** operator. If the WITH PREFETCH clause appears in the **Argument** column, the query processor has determined that it is optimal to use asynchronous prefetching (read-ahead) when looking up bookmarks in the clustered index.<br /><br /> The use of a **Key Lookup** operator in a query plan indicates that the query might benefit from performance tuning. For example, query performance might be improved by adding a covering index.| 
 |![Keyset cursor operator icon](../relational-databases/media/keyset-32x.gif "Keyset cursor operator icon")|**Keyset**|The **Keyset** operator uses a cursor that can see updates, but not inserts made by others.| 
 |![Language element catchall icon](../relational-databases/media/language-construct-catch-all.gif "Language element catchall icon")|**Language Element**|The **Language Element** catchall icon is displayed when a suitable icon for the iterator cannot be found by the logic that produces graphical Showplans. The catchall icon does not necessarily indicate an error condition. There are three catchall icons: blue (for iterators), orange (for cursors), and green (for [!INCLUDE[tsql](../includes/tsql-md.md)] language constructs).| 
 |None|**Left Anti Semi Join**|The **Left Anti Semi Join** operator returns each row from the first (top) input when there is no matching row in the second (bottom) input. If no join predicate exists in the **Argument** column, each row is a matching row. **Left Anti Semi Join** is a logical operator.|