Differences between version 3 and previous revision of MuenchianMethod.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 3 | Last edited on Friday, August 22, 2003 10:42:33 am | by DavidHallett | Revert |
| Older page: | version 2 | Last edited on Thursday, August 21, 2003 8:17:37 pm | by StuartYeates | Revert |
@@ -1,9 +1,9 @@
The [MuenchianMethod] is a technique in [XSLT], which could probably also be applied to other data-centric [FunctionalLanguages].
In [XSLT] a common problem is how to fire an action exactly 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 application of templates 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
are efficient.
+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.
The following creates a key called kName based on the name of each node. The template then matches only those nodes which are the first node in the key with that name.
...
