An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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).In both cases the key can take the form of an attribute, element, or computed value. The technique is not necessary in XSLT 2.0+, which introduces the new for-each-group tag.

Property Value
dbo:abstract
  • 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).In both cases the key can take the form of an attribute, element, or computed value. 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. (en)
dbo:thumbnail
dbo:wikiPageID
  • 17999461 (xsd:integer)
dbo:wikiPageLength
  • 2507 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1093248859 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • 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).In both cases the key can take the form of an attribute, element, or computed value. The technique is not necessary in XSLT 2.0+, which introduces the new for-each-group tag. (en)
rdfs:label
  • XSLT/Muenchian grouping (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License