Hi Bram,
BaseX employs a wide variety of algorithms for searching data, traversing paths, tokenizing texts etc., and XQuery is a complex programming language with lots of features, so I definitely need more information on what you mean by »search algorithm«. The official specs [1,2] might give you some hints on XQuery; check out [3,4] for BaseX.
Cheers, Christian
[1] https://www.w3.org/TR/xquery-31/ [2] https://www.w3.org/TR/xpath-full-text-30/ [3] http://files.basex.org/publications/Gruen%20%5B2010%5D,%20Storing%20and%20Qu... [4] http://phobos103.inf.uni-konstanz.de/xml15/
On Fri, May 27, 2016 at 2:36 PM, Bram Vanroy | KU Leuven bram.vanroy1@student.kuleuven.be wrote:
Good afternoon all,
It’s me again
While writing my paper, I was wondering how BaseX (and/or XQuery)’s search algorithm actually works. I imagine each XML-structure is search through one by one, but what technique is used in this search? I’m looking for some terminology such as A*, IDA, D*, depth-first, breadth-first, top down, bottom up, etc. but I cannot find anything in your documentation. Can you enlighten me on the subject? And is the algorithm used specified by BaseX, or is it implied by XQuery?
Kind regards
Bram Vanroy