There are also many vendor extensions for string searches in various XML
databases that are exposed as proprietary XPath extension functions; In
addition to those that offer the Full Text extension.
...As I guess has become clear from this thread - you should benchmark the
various options available from your XPath processors of choice based, and
those should be based on your system resource constraints.
On 20 Nov 2015 19:50, "Liam R. E. Quin liam(_at_)w3(_dot_)org" <
xsl-list-service(_at_)lists(_dot_)mulberrytech(_dot_)com> wrote:
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
--~--