Changes

Jump to navigation Jump to search
118 bytes added ,  17:45, 17 July 2011
BaseX offers an efficient internal scoring model which can be easily extended to
different application scenarios. Additionally, BaseX allows to store scoring
values within the full-text index structure(demanding additional time andmemory). Three scoring types are currentlyavailable, which can be adjusted with the <code>SCORING</code> property(Default: <code>SET SCORING 0</code>): *<code>0:</code> A standard This algorithm is applied, which considers yields the best results for general-purpose use cases. It calculates the scoring value out of the length of a term and its frequency in a single text node. This algorithm is always also applied if no index exists, or if the index cannot be applied in a query. *<code>1:</code> Standard TF/IDF algorithm, which treats ''document nodes '' as document units .*<code>2:</code> Each ''text node '' is treated as a document unit in the TF/IDF algorithm. This variant is recommendable an alternative for type <code>1</code>, if the database contains large , few XML files which only contain one document node.
==Fuzzy Querying==
Bureaucrats, editor, reviewer, Administrators
13,554

edits

Navigation menu