In addition to the W3C XQFT Recommendation, BaseX supports fuzzy querying.
The XQFT grammar was enhanced by the FTMatchOption
to allow for approximate searches in full texts.
By default, the standard full-text index already supports the efficient
execution of fuzzy searches.
<doc> <a>foo bar</a> <a>foa bar</a> <a>faa bar</a> </doc>
create db doc.xml; create index fullext
xquery //a[text() contains text 'foo' using fuzzy]
<a>foo bar</a> <a>foa bar</a>
Fuzzy search is based on the Levenshtein distance. The maximum number of allowed
errors is calculated by dividing the token length of a specified query term by 4,
preserving a minimum of 1 errors. A static error distance can be set by adjusting
LSERR property (default:
SET LSERR 0).
The query above yields two results as there is no error between the query term
"foo" and the text node "foo bar", and one error between
"foo" and "foa bar".
BaseX offers different evaluation strategies for XQFT queries, the choice of which
depends on the input data and the existence of a full text index. The query compiler tries
to optimize and speed up queries by applying a full text index structure whenever
possible and useful. Three evaluation strategies are available: the standard sequential
database scan, a full-text index based evaluation and a hybrid one, combining both strategies
(see our <a target='_top' href='publications'>publications</a> for details).
Query optimization and selection of the most efficient evaluation strategy is done
in a full-fledged automatic manner. The output of the query optimizer indicates which
evaluation plan is chosen for a specific query. It can be inspected by activating verbose
SET VERBOSE ON) or opening the Query Info in the GUI.
Applying full-text index
suggests that the full-text index is applied to speed up query evaluation. A second message
Removing path with no index results
indicates that the index does not yield any results for the specified term and is thus skipped. If index optimizations are missing, it sometimes helps to give the compiler a second chance and try different rewritings of the same query.
To support a wide variety of scenarios, the available full-text index can
handle different combinations of the match options in XQuery Full Text.
By default, most indexing options are disabled. The GUI dialog for creating new databases
allows to choose the available options. On the command-line, the
command has to be used before the full-text index is created, either by
create index fulltext or
set ftindex on; create db FILENAME.xml.
The following options are available:
- Support Wildcards: a trie-based index can be applied to support wildcard searches (
SET WILDCARDS ON)
- Stemming: tokens are stemmed with the Porter Stemmer before being indexed (
SET STEMMING ON)
- Case Sensitive: tokens are indexed in case-sensitive mode (
SET CASESEND ON)
- Diacritics: diacritics are indexed as well (
SET DIACRITICS ON)
- TF/IDF Scoring: TF/IDF-based scoring values are calculated and stored in the index (
SET SCORING 1/2; details see below)
- Stopwords: a stop word list can be defined to reduce the number of indexed tokens (
SET STOPWORDS FILENAME)
Caution: The index will only be applied if the activated options are also specified in the query:
Index Options: Case Sensitive, Stemming ON Query 1 (wrong):
//*[text() contains text 'inform']
Query 2 (correct):
//*[text() contains text 'inform' using case sensitive using stemming]
Query 3 (correct):
declare ft-option using case sensitive using stemming; //*[text() contains text 'inform']
The XQuery Full Text Recommendation allows for the usage of scoring models
and values within queries, with scoring being completely implementation defined.
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. Three scoring types are currently
available, which can be adjusted with the
SET SCORING 0):
0:A standard algorithm is applied, which considers the length of a term and its frequency in a single text node. This algorithm is always applied if no index exists, or if the index cannot be applied in a query.
1:Standard TF/IDF algorithm, which treats document nodes as document units
2:Each text node is treated as a document unit in the TF/IDF algorithm. This variant is recommendable for large XML files which only contain one document node