Subject: Re: [xsl] Using memory addressing to retrieve a value vice using a software string library to retrieve a value From: "Adam Retter adam.retter@xxxxxxxxxxxxxx" <xsl-list-service@xxxxxxxxxxxxxxxxxxxxxx> Date: Fri, 20 Nov 2015 20:01:47 -0000 |
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@xxxxxx" < xsl-list-service@xxxxxxxxxxxxxxxxxxxxxx> 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
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Using memory addressing t, Liam R. E. Quin liam | Thread | [xsl] Introducing myself to the lis, Kevin Veroneau kevin |
Re: [xsl] Using memory addressing t, Liam R. E. Quin liam | Date | [xsl] Introducing myself to the lis, Kevin Veroneau kevin |
Month |