On Fri, 2015-11-20 at 16:39 +0000, Dimitre Novatchev
I am aware of at least two very efficient algorithms:
1. Using *suffix-trees* -
2. Using the hash of the search-string and scanning the given
string
For substrings an n-gram approach can also be fast, but again it's a
sufficiently specialized optimization that I wouldn't expect most XPath
engines to do it unless they supported the Full Text extension.
Liam
--~----------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
EasyUnsubscribe: http://lists.mulberrytech.com/unsub/xsl-list/1167547
or by email: xsl-list-unsub(_at_)lists(_dot_)mulberrytech(_dot_)com
--~--