PDF (US Ltr)
- 26.8Mb
PDF (A4)
- 26.9Mb
HTML Download (TGZ)
- 7.1Mb
HTML Download (Zip)
- 7.2Mb
[+/-]
MATCH (
col1,col2,...) AGAINST (expr [search_modifier])
search_modifier:
{
IN NATURAL LANGUAGE MODE
| IN NATURAL LANGUAGE MODE WITH QUERY EXPANSION
| IN BOOLEAN MODE
| WITH QUERY EXPANSION
}MySQL では、次のような全文インデックス設定および検索がサポートされています。
MySQL の全文インデックスは、型
FULLTEXTのインデックスです。全文インデックスは、
InnoDBまたはMyISAMテーブルでのみ使用でき、CHAR、VARCHAR、またはTEXTカラムにのみ作成できます。FULLTEXTインデックスの定義は、テーブルの作成時にCREATE TABLEステートメントで指定することも、あとでALTER TABLEまたはCREATE INDEXを使用して追加することもできます。データセットが大きい場合は、
FULLTEXTインデックスが付いていないテーブルにロードしてから、そのあとでインデックスを作成した方が、既存のFULLTEXTインデックスが付いているテーブルにロードするよりも断然速いです。
全文検索は、MATCH() ... AGAINST 構文を使用して実行されます。MATCH() には、検索対象のカラム名をカンマで区切ったリストを指定します。AGAINST には、検索する文字列と、実行する検索のタイプを示すオプションの修飾子を指定します。検索文字列は、クエリー評価時に定数である文字列値にする必要があります。たとえば、テーブルカラムは、行ごとに異なる可能性があるため除外されます。
全文検索には、次の 3 つの種類があります。
-
自然言語の検索では、検索文字列が人間の自然な言語でのフレーズ (フリーテキストのフレーズ) として解釈されます。特別な演算子はありません。ストップワードリストが適用されます。これらは、
InnoDB検索インデックスの場合はinnodb_ft_enable_stopword、innodb_ft_server_stopword_table、およびinnodb_ft_user_stopword_table、MyISAM検索インデックスの場合はft_stopword_fileによって制御されます。詳細は、セクション12.9.4「全文ストップワード」を参照してください。IN NATURAL LANGUAGE MODE修飾子が指定されている場合または修飾子がまったく指定されていない場合は、全文検索が自然言語検索になります。詳細は、セクション12.9.1「自然言語全文検索」を参照してください。 ブール検索では、特別なクエリー言語のルールを使用して検索文字列が解釈されます。文字列には、検索対象の単語が含まれます。また、一致する行に単語が存在しなければならない、または存在してはならないように、あるいは通常よりも単語の重みが高くまたは低くなるように、要件を指定する演算子を含めることもできます。特定の共通単語 (ストップワード) は、検索インデックスから省略され、検索文字列に存在しない場合は一致が行われません。
IN BOOLEAN MODE修飾子は、ブール検索を指定します。詳細は、セクション12.9.2「ブール全文検索」を参照してください。クエリー拡張検索は、自然言語検索を改善したものです。自然言語検索を実行する際は、検索文字列が使用されます。その後、検索で返されたもっとも関連性の高い行からの単語が検索文字列に追加され、再度検索が実行されます。クエリーでは、2 回目の検索からの行が返されます。
IN NATURAL LANGUAGE MODE WITH QUERY EXPANSIONまたはWITH QUERY EXPANSION修飾子は、クエリー拡張検索を指定します。詳細は、セクション12.9.3「クエリー拡張を使用した全文検索」を参照してください。
FULLTEXT クエリーのパフォーマンスについては、セクション8.3.4「カラムインデックス」を参照してください。
InnoDB FULLTEXT インデックスの処理に関するより技術的な詳細は、セクション14.2.13.3「FULLTEXT インデックス」を参照してください。
全文検索上の制約については、セクション12.9.5「全文制限」に一覧表示されています。
myisam_ftdump ユーティリティーは、MyISAM 全文インデックスの内容をダンプします。これは、全文クエリーのデバッグ時に役立つことがあります。セクション4.6.2「myisam_ftdump — 全文インデックス情報の表示」を参照してください。
A search for something like "GATA-D22S690" finds
all entries containing GATA and not the full
hyphenated text. The '-' character is treated as a
word stop even within literals. The same is true if
any of the special text search modifiers are used (eg
found with full text searches.
BOOLEAN MODE will almost always return a
relevance of 1.0. In order to get a relevance that is
meaningful, you'll need to:
<BR/><BR/>
SELECT MATCH('Content') AGAINST ('keyword1
keyword2') as Relevance FROM table WHERE MATCH
('Content') AGAINST('+keyword1 +keyword2' IN
BOOLEAN MODE) HAVING Relevance > 0.2 ORDER
BY Relevance DESC
<BR/><BR/>
Notice that you are doing a regular relevance query
to obtain relevance factors combined with a WHERE
clause that uses BOOLEAN MODE. The BOOLEAN
MODE gives you the subset that fulfills the
requirements of the BOOLEAN search, the relevance
query fulfills the relevance factor, and the HAVING
clause (in this case) ensures that the document is
relevant to the search (i.e. documents that score
less than 0.2 are considered irrelevant). This also
allows you to order by relevance.
<BR/><BR/>
This may or may not be a bug in the way that IN
BOOLEAN MODE operates, although the comments
I've read on the mailing list suggest that IN
BOOLEAN MODE's relevance ranking is not very
complicated, thus lending itself poorly for actually
providing relevant documents. BTW - I didn't notice
a performance loss for doing this, since it appears
MySQL only performs the FULLTEXT search once,
even though the two MATCH clauses are different.
Use EXPLAIN to prove this.
ALTER TABLE cities ADD city_soundex VARCHAR(4) NOT NULL;
UPDATE cities SET city_soundex=LEFT(SOUNDEX(city_name),4);
And then to query against:
SELECT * FROM citites WHERE city_soundex=LEFT(SOUNDEX('Some City Name'),4);
I am running a Athlon 2.2 Ghz with 512 MB DDR RAM 400 Mhz. Hard drive has seek time of 9 ms.
Our next shot at this is going to be to create 80 different tables, one for each category (yuck!), just to try to get decent performance on the within-category fulltext search.
I would think there is enough interest in fulltext search for there to be an email list dedicated to it where those of us who need to use it on real-world web sites could interact with the developers to try to tune it for the good of the community at large.
4 Million rows x 6 words per row = 24 Million entries
4 Million rows x 30 words per row = 120 Million entries
If you index intelligently, you may well find that the feature meets your needs, despite what some users may have remarked above. "Number of rows" is useless as a benchmarking statistic on its own.
Any fulltext search in our database takes around 1-5ms. A three word search can take a few seconds but still faster than anything else...Even Amazon.
This is from our main server which has several thousand hits every day. We are one of the biggest booksellers in my country.
-This was in 'reply' to someone posting earlier about poor performance in 'real world situation'.
We have a vast database of products (totaling 3 million rows).
The rebuild of the full-text index took 21 minutes to complete.
As for the search, a multiple word search on the full-text index of 1 field is as follows:
20 rows returned
Query took 1.0263 sec
The size of the index is very big though.
Index 449,529 KB
We are going to eliminate unnecessary words which should make the index smaller.
First machine: a 512M Athlon 2100 running WinXP on a RAID1 array, and it took 9 mins 20 sec.
Second machine: 1G RAM P4-2.0ghz, running Linux 7.3 (2.4.20-13.7 kernel), one-spindle (but fast) IDE disk, and it took 29 mins 11 sec.
The query was "alter table msg_bodies add fulltext fti_bodies (subject, body);", and the dataset is about 550M, 1.3 million rows.
Both machines were mostly idle when the indexing occurred. I know it's just anecdotal, but if you run a big alter as I did, don't be surprised if it takes a while... oh yeah, and then be prepared for MUCH longer than normal insert times when you add large data to the FT indexed columns. This makes sense of course, but, at least on my dataset and hardware, is positively NOT neglible. FYI.
For Chinese charset in UTF-8 encoding.
It needed to set ft_min_word_len =1
To make FULLTEXT MATCH work with Japanese UTF-8 text, be careful that words from your Japanese text be separated by the __ASCII__ space character, not Japanese UTF-8 (or other) spacing characters.
(when using phpMyAdmin to manage data/ write a SQL query, you must switch away from your Japanese IME to insert a space char...)
1. Have a normalized versions of the important columns: where you've stripped punctuation and converted numerals to words ('1' to 'one'). Likewise normalise the search string.
2. Have a combined fulltext index on your searchable columns to use in your 'WHERE' clause, but then have separate fulltext indexes on each column to use in the 'ORDER BY' clause, so they can have different weights.
3. For the scoring algorithm, include the independent importance of that record, and include a match of the inclusive index against stemmed versions of the search words (as: "wedding" => "wed", "weddings").
4. If there's exactly one result, go straight to that record.
5. If you get no results, try matching against the start of the most important column (WHERE column LIKE 'term%'), and put a 5-character index on that column. This helps if someone is searching on a very short word or a stopword.
6. Reduce minimum word length to 3, and make a new stopwords list just using "a an and the is in which we you to on this by of with". Use "REPAIR TABLE xxx QUICK" to rebuild the index and make a note of the index-file (xxx.MYI) size before and after you make changes. Then use ft_dump to tune.
Fulltext search in MySQL isn't slow really. It's slower than normal index selects, but that's not noticable.
I'm playing tables that each contains ca 4million records, about 6GB of text that needs to be indexed. The problem lies in the optimization of the queries, that use the MATCH() and AGAINST() functions. So far as I found out MySQL can use in a query only one index. The optimizer looks for the index that will possibly give the smallest amount of rows, then goes trough all of these, and removes those records, that fall out because of the other WHERE statements.
When you enter a fulltext search, the server _has_ to use that index. Any other statments could be applied only to the rows that were returned by the search. If you have lots of records, most of the searches will return lots of results. The rest of your query will be executed like if you were executing it against a table that contains the results, and no indexes - obviously that will be processed sequentially.
Same thing applies when you use the SQL_CALC_FOUND_ROWS, or LIMIT with high offset values: first the server has to load all the results, then the limit could be applied.
If you _have_ to use the fulltext, these are some hints how you could get quite good results:
- Try to avoid any group, where, order and any statements for what it's necessary to get all the results. I know, usually this is impossible.
- If you need to show the results on a web page, try to find other methods to get the total number of results than using SQL_CALC_FOUND_ROWS. Better if you don't tell the user at all how many results there are ;)
- If indexing text that is in other language than english, before doing anything create a stopword file for your language! (That could reduce index size about 30%)
But most important: think a lot, before you decide to use fulltext search!
I'm not sure I agree with your comment that Mysql *always* uses a fulltext index if you include match...against.
I tried a sample query where I used match...against and another value in the where clause (on the primary keyed field) and Mysql's optimizer picked the primary key index.
The statement looked like "select something from sometable where match(col1, col2) against ('some text here') and pk_col = 44
Here is my code/example:
SELECT *,MATCH (YR,AU,ST,SD,SC,BT,BD,BC,AT,AD,AC,JR,KW,AUS,GEO,AN,RB,CO,RR) AGAINST ('Margaret Atwood' IN BOOLEAN MODE) AS relevancy FROM
ccl_main WHERE MATCH (YR,AU,ST,SD,SC,BT,BD,BC,AT,AD,AC,JR,KW,AUS,GEO,AN,RB,CO,RR) AGAINST ('Margaret Atwood' IN BOOLEAN MODE) ORDER BY
relevancy DESC;]
Machine: The machine is an Athlon XP 3200+ w/ 1 gig RAM, one drive for the OS, and another 250GB EIDE drive for the MySQL data. OS is Redhat 9.
Index creation: 3 hours 5 min. Most of that time was probably copying the table (since MySQL copies the table before it modifies it). The process was definitely disk-limited -- CPU usage was never regularly above 50%. I believe that were it not for the excess data to copy, the index creation would have taken about 45 minutes.
Queries were chosen to compare rare words, common words, and words of different lengths. All queries seemed to be disk-limited (CPU utilization hardly moved off baseline), which makes sense given that there is not enough RAM to hold the index in memory. All queries were done mutiple times and the average time reported. Results follow.
Word, Rows, Seconds, Seconds/Row
----------------------------------------
bilobed, 4, 0.15, 0.0375
mends, 4, 0.19, 0.0475
nanotechnology, 23, 0.64, 0.0278
bioluminescent, 53, 1.53, 0.0289
photosynthesis, 81, 2.21, 0.0273
graphite, 5070, 123.00, 0.0243
bicycle, 5385, 122.00, 0.0227
titanium, 13503, 350.00, 0.0259
(titanium,graphite), 18423, 425.00, 0.0231
metal, 151095, 4020.00, 0.0266
This is just a small test on the way to indexing the full 100 gig in the database that I am working on for http://www.freepatentsonline.com. I'll post results for that once I have a new server built.
The first, non-boolean MATCH can't keep pace with the second, boolean one since it does not recognise the boolean operators. A search for foo* might turn up rows with foo, foobar, foofighters, etc but the non-boolean, relevance MATCH can't "count" anything except foo. Same problem with a phrase search.
Since effectively you can't use boolean operators in the second, boolean MATCH, it's rendered pointless.
Results could be post-processed with your own ranking algorithm but it's kind of odd that you can't do a boolean search AND rank results in the query.
SELECT * FROM data WHERE
haystack LIKE ('%needle%')
AND haystack RLIKE '[[:<:]]needle[[:>:]]'
This query will produce the same result as the following query, but is roughly 20X faster.
SELECT * FROM data WHERE
haystack RLIKE '[[:<:]]needle[[:>:]]'
For more than one word use:
haystack LIKE ('%word1%word2%')
AND haystack RLIKE '[[:<:]]word1[[:>:]].*[[:<:]]word2[[:>:]]'
It's very important to have a sufficiently large key_buffer_size. Get much of the index in RAM and searches are typically very fast. Because we use InnoDB tables and can't share cache between InnoDB and MyISAM, we're moving to a setup which will use a dedicated and MyISAM tuned search server.
We run a slow query killer which will kill queries once their allowed time expires. That time depends on server load (active thread count). Documented at http://wp.wikidev.net/Querybane
It turns out that our current search often spends most time on things other than full text search - an improved version which is much more efficient is pending. Remember that you can use a self join to get around the one index per query limit of MySQL.
Search remains our most problematic load feature, requiring a couple of quite capable slaves to keep up at busy time. If we're working on the servers and the remainder can't handle the load, we switch to Google or Yahoo search. This is from one of the top few hundred sites on the net, so it's scaling pretty well for our application. One server was sufficiently fast to take us to the top 1,000.
1. For example, we have 4 tables with fulltext index. We need to perform fast search on them.
2. Do the following:
CREATE TEMPORARY TABLE xxx SELECT id, name, MATCH(name) AGAINST ('search_string') AS relevancy FROM table1;
INSERT INTO xxx SELECT id, name, MATCH(name) AGAINST ('search_string') AS relevancy FROM table2 ...
3. Then, when the temporary table is filled with the data, do the simple select from it:
SELECT id, name FROM xxx ORDER BY relevancy DESC
4. That's all.
I think, it is the optimal way to make a VERY FAST fulltext search from a number of tables. I hope, this will be helpful.
i compare products with there prices. i used the "relevance" idea (written above). But it will not recognize it correctly.
Heres my query:
SELECT *, MATCH( field ) AGAINST ('blabla') as relevance FROM `table` WHERE MATCH( field ) AGAINST ('blabla' IN BOOLEAN MODE ) HAVING relevance > 0.2
for example it finds 18 rows. to increase the rows, i checked (manuelly) the relevance. 3 above 18 (all 18.xxx) and the rest about 10.3 or lower. If i increase the "having" to 15, it finds only 2 of 3.
The field i use is the only index-field and ofcourse a fulltext specific field.
it seems that the relevance is taking part of the search results.
i am still looking for another idea but the relevance would cover my needs 100%
*update*
I just updated the mysql version from 4.0.15 to 4.1.8 and it works perfectly...
1. run services.msc to check what .ini your mysql is reading (in my case, "C:\MySQL\bin\mysqld-nt" --defaults-file="C:\MySQL\my.ini" MySQL)
2. change your my.ini like this:
[mysqld]
ft_min_word_len=3
ft_stopword_file="C:\\MySQL\\stop.txt"
3. restart your mysqld at services.msc
4. reindex your table using REPAIR TABLE tbl_name QUICK;
done!
select * , match (artist,album,title) against ('blues in orbit') from musicfiles where match (artist,album,title) against ('ellington');
will FIND all records with 'ellington' as substring of artist, album or title, but will RATE them as the search match'es 'blues in orbit'
You can even .... ORDER BY or GROUP BY MATCH (kunstner,albumtitel,titel) AGAINST ('prelude to a kiss'); ... or against anything else!
Alternatively, instead of doing all full-text search within MySql
database, you can pull data out and create an index on it.
It's a much faster search.
I am using DBSight to search on 1.7million records of 1.2G data, on a P3 450MHz, 256MRam, with sub-second performance.
Taking search out of database also give you capability to customize stemmer and query parser.
select id, match(post) against('foo') as score from messages where match (body) against( 'foo' );
...
155323 rows in set (16 min 7.51 sec)
select id, match(post) against('foo') as score from messages where match (body) against( 'foo' ) limit 100;
...
100 rows in set (1.25 sec)
I ran a number of other tests on various terms known to be in the text with similar results.
These were run in reverse order shown. Make sure you return only the rows you need or you will suffer. For a search engine application returning pages of results keep in mind that nobody is going to ever see page 74! Cap the results to a reasonable maximum trading response time for completeness where possible.
# This query is what you send to your MySQL to return the results. I put the LIMIT so that you don't overflow.
$query_ret="SELECT ProductID, Title, Description, Price, RetailPrice, MATCH (Title) AGAINST ('$keyword') AS score FROM server.book HAVING score > 0 LIMIT $start, $maxret;";
# This query will COUNT the number of rows it found. (I believe that's correct), I don't believe it counts occurrences, just rows. I saw that if you pull back without a LIMIT above, and count that way, it's 100000x slower. So do your count like this:
$query_count="SELECT count(MATCH(Title) AGAINST('$keyword')) AS score FROM server.book WHERE MATCH (Title) AGAINST ('$keyword') HAVING score > 0;";
Make sure you have your Primary Key setup, your Title and Description as SEPARATE FULLTEXT INDEXES. I spent a few hours boggling over this.
Nathan
For the sake of example, consider we have 6 as maximum rank and 2,3,4.234 are scores for three different records. Now to get percentage we have to do simple maths i.e., we can divide each score by 6(max rank) and then mulitply the result with 100.
(2/6)*100 = ..%
(3/6)*100 = ..%
(4.234/6)*100 = ..%
Hope this helps someone.
Saqib Aziz
Let me guess: you have a lot of data, and you went ahead and FULLTEXT indexed a column within that large pile of data. To put it in simple words: not cool.
How long does your data take to return from a FULLTEXT search... 5 seconds? More? If you're returning data under 3 seconds, then you're ok, but if you want it to return in 1.3 seconds, here's what I did.
1. Dont fulltext index a column within a huge table. Instead, take a Unique Identifier, and the text you're searching, and copy it to another table.
Use this to export your columns:
SELECT uniquecolumn, mytextsearchcolumn FROM mydatabase.mytable INTO OUTFILE "c:/path/outfile.txt";
That will export your data to a file in Tab Delimited format.
Now, create a new table somewhere, and call it fulltextengine or something, with only 2 columns (less is better), you could add one more if you need to.
Now import your data:
LOAD DATA INFILE "c:/path/outfile.txt" IGNORE INTO TABLE mydatabase.fulltextengine;
Now, create your FULLTEXT index on your search field.
Great. Now you have a separate table for searching. So if you want to try it out, go into MySQL, and try this, or PHPmyAdmin:
SELECT SQL_CALC_FOUND_ROWS uniquecolumn, searchcolumn, MATCH (searchcolumn) AGAINST
('Keyword Goes Here') AS score FROM mydatabase.fulltextengine HAVING score > 0;
Hope this helps!
It may add extra maintenance, but I will give up my soul to increase search speeds by 6x.
This technique obviously (you'll see why) doesn't work for phrase matching but it may speed up the search time by reducing the size of the dataset to search. Here's the algorithm I use.
1. extract the text
2. count each word of 2 or more characters in the text and record the frequency that each occurs
3. from this list of words 2 or more characters long, remove the k (k currently = 500) most common words in the english dictionary
4. sort the list so that the most frequently occurring words appear first
5. take the first n words as the final keywords, where n > 0 and n < the total number of remaining words
Please try Senna, fulltext search engine that can be embedded in MySQL.
http://qwik.jp/senna/
Original MySQL fulltext search is slow for query SELECT COUNT(*) or SELECT * FROM xx LIMIT large_number,x.
These queries are very fast with Senna's 2ind patch.
If you need to disable stop-words without re-compiling, consider appending a character to the end of each word in your text before inserting your text into the database. I used "q". I also right-padded all words shorter than 4 characters to a length of 4 characters by appending "q"s. And I appended a " " to the end of my text string before inserting into the database.
After retrieving my text from the database, I did a global replace on my text. I changed "qqq" to "", "qq" to "", and "q " to " " - in that order - to restore the text to it's original form. That was not the best solution but it worked. Luckily for me, my text was simply a space delimited list of words without and punctuation. Otherwise, my "q" encoding and decoding would have been more difficult.
For example, using this I could solve a problem with one table called 'Professional', which had a many-to-many reference to another table 'Profession'. Although I was using DISTINCT I was getting duplicate results because of different relevance values that MATCH was giving to the different entrances in 'Professions'.
Here I am copying the final query that worked OK (it's a bit simplified):
select distinct p.idProfessional, MAX(MATCH (pssion.name, pssion.description) AGAINST ('string to search')) as professionRanking FROM professional p, professional_profession pp, profession pssion WHERE pp.Professional_idProfessional = p.idProfessional AND pp.Profession_idProfession = pssion.idProfession and ( MATCH (pssion.name, pssion.description) AGAINST ('string to search') GROUP BY p.idProfessional ORDER BY professionRanking DESC
This is the reason MATCH command allows prefixed wildcards but not postfixed wilcards. Since single words are indexed, a postfix wildcard is impossible to manage in the usual way index does. You can't retrieve '*nited states' instantly from index because left characters are the most important part of index.
Even so, I hope MySql developers some day implement postfix wildcars, because for many of us, it is important to perform a truly 'full text' search. To say something, if I have a record with the word 'database' , I want retrieve this record when searching by 'tabas', an impossible task for actual fulltext search command.
It's easy to see that such a command can gain lot of performance, even when MySql developers be obliged to search byte to byte into the indexed words.
If you have a big table with text descriptions , to say 1 GB size, it is possible that quantity of different words into text will not pass from 500.000, maybe 1.000.000 words, averaging 8 bytes each, total 8 MB of data to be browsed, instead the 1 GB you should seek byte to byte to find what you want.
This is a 1 GB / 8 MB = 125 , or two orders of magnitude lower in terms of processing.
Table:
id(integer primary key)|content(text fulltext indexed)|status(integer key)
Note that executing folowing query, mysql will use only one index. Either fulltext, or status (Depending on intern statistics).
Q1:
SELECT * FROM table WHERE MATCH(content) AGAINST('searchQuery') AND status = 1
However it is still possible to use both indexes in one query. You will need a new index on id,status pair and use join. Thus mysql will be able to use one index for each table.
Q2:
SELECT t1.* from table t1 LEFT JOIN table t2 ON(t1.id=t2.id) WHERE MATCH(t1.content)AGAINST('searchQuery') AND status=1
Q2 will run significantly faster than Q1 at least in my case :)
Note the overhead: You will need an id for each row and a key wich is spanned over needed fields strating with id.
This will work:
SELECT * FROM myfile WHERE description LIKE '%sea%'
But this will return nothing:
SELECT * FROM myfile WHERE MATCH (description) AGAINST ('sea')
BECAUSE THE DEFAULT MIN LENGTH IS 4!
need to set ft_min_word_len to 3 in the configuration file if you want it to work.
SELECT MATCH (column) AGAINST ('keyword') relevancy FROM t1 WHERE MATCH (column) AGAINST ('keyword') ORDER BY relevancy DESC LIMIT 1
Change the ft_min_word_len setting. You can find what the server is using by running:
SHOW VARIABLES LIKE 'ft%';
Then you'll have to rebuild the indexes on the tables that have FULLTEXT indices, because the server I'm using had several databases I needed a quick way to identify which tables these were.
SELECT DISTINCT TABLE_SCHEMA,
TABLE_NAME
FROM COLUMNS
WERE COLUMN_KEY = 'MUL'
I could then rebuild the tables.
Very fast and flexible, and works nice with MySQL.
Eliminates many of the issues mentioned here in the comments, also ;)
http://drupal.jacksonkr.com/content/searching-mysql-database-exact-word
1- If your working in one table with a lot of records...each time the records are updated or new lines inserted the index must be (obviously)recreated ... if it's myisam ... @writing operations the table is locked...
2- I guess that the best approach towards this it's probably the logic of: when tables are huge ... not creating indexes for text search ... create cache@sql ...(cache@sql is one index!) ...
Somehow anticipating these problems ... like i write are not problems to ignore...
Why this is the best option... because if people use one file to log the last writing operations and compare it with the file that contains the results @cache(best approach ... cronjob!) ... it's only necessary to point to the file that contains the results@cache...
The logic of:If there are 500 000 000 of conjugations of words/phrases,etc what's the need of indexing everything if only 50 000 conjugations are used/seeked,etc ...
Regards,
Carlos
1. `COLLATION = utf8_unicode_ci` & `CHARACTER SET = utf8`. (Databases, Tables, and Columns).
2. Index words of 3 letters and more. This is Very Important for Arabic, `ft_min_word_len = 3` (see `show variables like "ft_%";`)
3. Check the version of MySQL (5.5 or 5.6), and Engine (InnoDb or MyIsam)