mirror of
https://github.com/MariaDB/server.git
synced 2025-01-18 04:53:01 +01:00
15a13203f1
it can tell MySQL to make a copy of everything (bug#17123) include/mysql/plugin.h: Now ftparser does not need to bother about memory management - it can tell MySQL to make a copy of everything (bug#17123) MYSQL_FTFLAGS_NEED_COPY flag storage/myisam/ft_boolean_search.c: param->flags storage/myisam/ft_nlq_search.c: param->flags. ft_parse takes a mem_root as an argument storage/myisam/ft_parser.c: ftparser takes a memroot as an argument. words are copied there, if necessary. memroot is reset for every parsing and free'd at the end of the statement. storage/myisam/ft_update.c: ftparser takes a memroot as an argument. words are copied there, if necessary. memroot is reset for every parsing and free'd at the end of the statement. storage/myisam/ftdefs.h: ftparser takes a memroot as an argument. words are copied there, if necessary. memroot is reset for every parsing and free'd at the end of the statement. storage/myisam/mi_check.c: ftparser takes a memroot as an argument. words are copied there, if necessary storage/myisam/myisamdef.h: memroot for ftparser in MI_INFO and MI_SORT_PARAM storage/myisam/sort.c: free ftparser memroot
152 lines
6.1 KiB
C
152 lines
6.1 KiB
C
/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
|
|
|
|
/* Written by Sergei A. Golubchik, who has a shared copyright to this code */
|
|
|
|
/* some definitions for full-text indices */
|
|
|
|
#include "fulltext.h"
|
|
#include <m_ctype.h>
|
|
#include <my_tree.h>
|
|
#include <queues.h>
|
|
#include <mysql/plugin.h>
|
|
|
|
#define true_word_char(s,X) (my_isalnum(s,X) || (X)=='_')
|
|
#define misc_word_char(X) 0
|
|
#define word_char(s,X) (true_word_char(s,X) || misc_word_char(X))
|
|
|
|
#define FT_MAX_WORD_LEN_FOR_SORT 31
|
|
|
|
#define FTPARSER_MEMROOT_ALLOC_SIZE 65536
|
|
|
|
#define COMPILE_STOPWORDS_IN
|
|
|
|
/* Interested readers may consult SMART
|
|
(ftp://ftp.cs.cornell.edu/pub/smart/smart.11.0.tar.Z)
|
|
for an excellent implementation of vector space model we use.
|
|
It also demonstrate the usage of different weghting techniques.
|
|
This code, though, is completely original and is not based on the
|
|
SMART code but was in some cases inspired by it.
|
|
|
|
NORM_PIVOT was taken from the article
|
|
A.Singhal, C.Buckley, M.Mitra, "Pivoted Document Length Normalization",
|
|
ACM SIGIR'96, 21-29, 1996
|
|
*/
|
|
|
|
#define LWS_FOR_QUERY LWS_TF
|
|
#define LWS_IN_USE LWS_LOG
|
|
#define PRENORM_IN_USE PRENORM_AVG
|
|
#define NORM_IN_USE NORM_PIVOT
|
|
#define GWS_IN_USE GWS_PROB
|
|
/*==============================================================*/
|
|
#define LWS_TF (count)
|
|
#define LWS_BINARY (count>0)
|
|
#define LWS_SQUARE (count*count)
|
|
#define LWS_LOG (count?(log( (double) count)+1):0)
|
|
/*--------------------------------------------------------------*/
|
|
#define PRENORM_NONE (p->weight)
|
|
#define PRENORM_MAX (p->weight/docstat.max)
|
|
#define PRENORM_AUG (0.4+0.6*p->weight/docstat.max)
|
|
#define PRENORM_AVG (p->weight/docstat.sum*docstat.uniq)
|
|
#define PRENORM_AVGLOG ((1+log(p->weight))/(1+log(docstat.sum/docstat.uniq)))
|
|
/*--------------------------------------------------------------*/
|
|
#define NORM_NONE (1)
|
|
#define NORM_SUM (docstat.nsum)
|
|
#define NORM_COS (sqrt(docstat.nsum2))
|
|
|
|
#define PIVOT_VAL (0.0115)
|
|
#define NORM_PIVOT (1+PIVOT_VAL*docstat.uniq)
|
|
/*---------------------------------------------------------------*/
|
|
#define GWS_NORM (1/sqrt(sum2))
|
|
#define GWS_GFIDF (sum/doc_cnt)
|
|
/* Mysterious, but w/o (double) GWS_IDF performs better :-o */
|
|
#define GWS_IDF log(aio->info->state->records/doc_cnt)
|
|
#define GWS_IDF1 log((double)aio->info->state->records/doc_cnt)
|
|
#define GWS_PROB ((aio->info->state->records > doc_cnt) ? log(((double)(aio->info->state->records-doc_cnt))/doc_cnt) : 0 )
|
|
#define GWS_FREQ (1.0/doc_cnt)
|
|
#define GWS_SQUARED pow(log((double)aio->info->state->records/doc_cnt),2)
|
|
#define GWS_CUBIC pow(log((double)aio->info->state->records/doc_cnt),3)
|
|
#define GWS_ENTROPY (1-(suml/sum-log(sum))/log(aio->info->state->records))
|
|
/*=================================================================*/
|
|
|
|
/* Boolean search operators */
|
|
#define FTB_YES (ft_boolean_syntax[0])
|
|
#define FTB_EGAL (ft_boolean_syntax[1])
|
|
#define FTB_NO (ft_boolean_syntax[2])
|
|
#define FTB_INC (ft_boolean_syntax[3])
|
|
#define FTB_DEC (ft_boolean_syntax[4])
|
|
#define FTB_LBR (ft_boolean_syntax[5])
|
|
#define FTB_RBR (ft_boolean_syntax[6])
|
|
#define FTB_NEG (ft_boolean_syntax[7])
|
|
#define FTB_TRUNC (ft_boolean_syntax[8])
|
|
#define FTB_LQUOT (ft_boolean_syntax[10])
|
|
#define FTB_RQUOT (ft_boolean_syntax[11])
|
|
|
|
typedef struct st_ft_word {
|
|
byte * pos;
|
|
uint len;
|
|
double weight;
|
|
} FT_WORD;
|
|
|
|
int is_stopword(char *word, uint len);
|
|
|
|
uint _ft_make_key(MI_INFO *, uint , byte *, FT_WORD *, my_off_t);
|
|
|
|
byte ft_get_word(CHARSET_INFO *, byte **, byte *, FT_WORD *,
|
|
MYSQL_FTPARSER_BOOLEAN_INFO *);
|
|
byte ft_simple_get_word(CHARSET_INFO *, byte **, const byte *,
|
|
FT_WORD *, my_bool);
|
|
|
|
typedef struct _st_ft_seg_iterator {
|
|
uint num, len;
|
|
HA_KEYSEG *seg;
|
|
const byte *rec, *pos;
|
|
} FT_SEG_ITERATOR;
|
|
|
|
void _mi_ft_segiterator_init(MI_INFO *, uint, const byte *, FT_SEG_ITERATOR *);
|
|
void _mi_ft_segiterator_dummy_init(const byte *, uint, FT_SEG_ITERATOR *);
|
|
uint _mi_ft_segiterator(FT_SEG_ITERATOR *);
|
|
|
|
void ft_parse_init(TREE *, CHARSET_INFO *);
|
|
int ft_parse(TREE *, byte *, int, struct st_mysql_ftparser *parser,
|
|
MYSQL_FTPARSER_PARAM *, MEM_ROOT *);
|
|
FT_WORD * ft_linearize(TREE *, MEM_ROOT *);
|
|
FT_WORD * _mi_ft_parserecord(MI_INFO *, uint, const byte *, MEM_ROOT *);
|
|
uint _mi_ft_parse(TREE *, MI_INFO *, uint, const byte *,
|
|
MYSQL_FTPARSER_PARAM *, MEM_ROOT *);
|
|
|
|
FT_INFO *ft_init_nlq_search(MI_INFO *, uint, byte *, uint, uint, byte *);
|
|
FT_INFO *ft_init_boolean_search(MI_INFO *, uint, byte *, uint, CHARSET_INFO *);
|
|
|
|
extern const struct _ft_vft _ft_vft_nlq;
|
|
int ft_nlq_read_next(FT_INFO *, char *);
|
|
float ft_nlq_find_relevance(FT_INFO *, byte *, uint);
|
|
void ft_nlq_close_search(FT_INFO *);
|
|
float ft_nlq_get_relevance(FT_INFO *);
|
|
my_off_t ft_nlq_get_docid(FT_INFO *);
|
|
void ft_nlq_reinit_search(FT_INFO *);
|
|
|
|
extern const struct _ft_vft _ft_vft_boolean;
|
|
int ft_boolean_read_next(FT_INFO *, char *);
|
|
float ft_boolean_find_relevance(FT_INFO *, byte *, uint);
|
|
void ft_boolean_close_search(FT_INFO *);
|
|
float ft_boolean_get_relevance(FT_INFO *);
|
|
my_off_t ft_boolean_get_docid(FT_INFO *);
|
|
void ft_boolean_reinit_search(FT_INFO *);
|
|
extern MYSQL_FTPARSER_PARAM *ftparser_call_initializer(MI_INFO *info,
|
|
uint keynr,
|
|
uint paramnr);
|
|
extern void ftparser_call_deinitializer(MI_INFO *info);
|