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

Author: pmasl

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

@@ -187,7 +187,7 @@ monikerRange: "=azuresqldb-current||>=sql-server-2016||=sqlallproducts-allversio
 |![Assign language element icon](../relational-databases/media/assign-32.gif "Assign language element icon")|**Assign**|The **Assign** operator assigns the value of an expression or a constant to a variable. **Assign** is a language element.| 
 |![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 /> Starting with [!INCLUDE[ssVersion2005](../includes/ssversion2005-md.md)], **Bookmark Lookup** is not used. Instead, **Clustered Index Seek**, **Key Lookup**, and **RID Lookup** provide bookmark lookup functionality.| 
+|![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 /> Starting with [!INCLUDE[ssVersion2005](../includes/ssversion2005-md.md)], **Bookmark Lookup** is not used. Instead, **Key Lookup** and **RID Lookup** provide bookmark lookup functionality.| 
 |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.|