Muenchian grouping (or Muenchian method, named after Steve Muench) is an algorithm for grouping of data used in XSL Transformations v1 that identifies keys in the results and then queries all nodes with that key. This improves the traditional alternative for grouping, whereby each node is checked against previous (or following) nodes to determine if the key is unique (if it is, this would indicate a new group).[1] In both cases the key can take the form of an attribute, element, or computed value.
Basic elements and process flow of XSLT
The unique identifier is referred to as a key because of the use of the 'key' function to identify and track the group variable.
The technique is not necessary in XSLT 2.0+, which introduces the new for-each-group tag.
General aspect of the transformedit
The method took advantage of XSLT's ability to index documents using a key. The trick involves using the index to efficiently figure out the set of unique grouping keys and then using this set to process all nodes in the group:[2]
<xsl:keyname="products-by-category"match="product"use="@category"/><xsl:templatematch="/"><xsl:for-eachselect="//product[count(. | key('products-by-category', @category)[1]) = 1]"><xsl:variablename="current-grouping-key"select="@category"/><xsl:variablename="current-group"select="key('products-by-category', $current-grouping-key)"/><xsl:for-eachselect="$current-group"><!-- processing for elements in group --><!-- you can use xsl:sort here also, if necessary --></xsl:for-each></xsl:for-each></xsl:template>
Although the Muenchian method will continue to work in 2.0, for-each-group Is preferred as it is likely to be as efficient and probably more so. The Muenchian method can only be used for value-based grouping.
^"Recipe 6.2. Prefer for-each-group over Muenchian Method of Grouping".
January 01, 1970
xslt, muenchian, grouping, muenchian, grouping, muenchian, method, named, after, steve, muench, algorithm, grouping, data, used, transformations, that, identifies, keys, results, then, queries, nodes, with, that, this, improves, traditional, alternative, group. Muenchian grouping or Muenchian method named after Steve Muench is an algorithm for grouping of data used in XSL Transformations v1 that identifies keys in the results and then queries all nodes with that key This improves the traditional alternative for grouping whereby each node is checked against previous or following nodes to determine if the key is unique if it is this would indicate a new group 1 In both cases the key can take the form of an attribute element or computed value Basic elements and process flow of XSLT The unique identifier is referred to as a key because of the use of the key function to identify and track the group variable The technique is not necessary in XSLT 2 0 which introduces the new for each group tag General aspect of the transform editThe method took advantage of XSLT s ability to index documents using a key The trick involves using the index to efficiently figure out the set of unique grouping keys and then using this set to process all nodes in the group 2 lt xsl key name products by category match product use category gt lt xsl template match gt lt xsl for each select product count key products by category category 1 1 gt lt xsl variable name current grouping key select category gt lt xsl variable name current group select key products by category current grouping key gt lt xsl for each select current group gt lt processing for elements in group gt lt you can use xsl sort here also if necessary gt lt xsl for each gt lt xsl for each gt lt xsl template gt Although the Muenchian method will continue to work in 2 0 for each group Is preferred as it is likely to be as efficient and probably more so The Muenchian method can only be used for value based grouping References edit Grouping using the Muenchian Method Jeni Tennison Recipe 6 2 Prefer for each group over Muenchian Method of Grouping Retrieved from https en wikipedia org w index php title XSLT Muenchian grouping amp oldid 1220863837, wikipedia, wiki, book, books, library,
