Differences between current version and previous revision of MuenchianMethod.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 5 | Last edited on Thursday, November 6, 2003 9:19:57 am | by MuenchianMethod | |
| Older page: | version 4 | Last edited on Sunday, October 26, 2003 7:39:12 am | by AristotlePagaltzis | Revert |
@@ -1,5 +1,5 @@
-The MuenchianMethod is a technique in [XSLT], which could probably also be applied to other data-centric Category:FunctionalProgrammingLanguages.
+The MuenchianMethod is a technique in [XSLT], which could probably also be applied to other data-centric Category:FunctionalProgrammingLanguages. It was developed/discovered by Steve Muench
.
In [XSLT] a common problem is how to fire an action exactly once for each class of element seen. This is difficult in [XSLT] because it is a purely functional language and "remembering" that you've already seen an element of a class is impossible. There are certain highly recursive methods to solve the problem but these are incredibly inefficient, because (somewhat unusually for a functional language) [XSLT] is optimised not for recursion but for application of [Template]s to nodes in the [XML] tree.
The MuenchianMethod avoids this problem using a key defined to classify elements into a class. Keys in [XSLT] are like indexes in SQL -- they are efficient. A good introduction to the MuenchianMethod can be [found on the web | http://www.jenitennison.com/xslt/grouping/index.xml].
