MySQL Forums
Forum List  »  General

full-text algorithm
Posted by: Bálint Hajduk
Date: March 05, 2018 09:14AM


I developed a full-text algorithm, and wrote a test in mysql to prove my theory. In short, the program is far from finished, but it's giving better result than simple b-tree for agglutinative languages, or the same just faster. If finished I'm sure it can be faster, and give better result then b-tree, moreover it's possible that it can be a little faster then a hash full-text.

The problem is, that I don't know where should ask, that MySQL is interested in things like this, or not.

Hajduk Bálint

Options: ReplyQuote

Written By
full-text algorithm
March 05, 2018 09:14AM
March 05, 2018 10:23AM
March 05, 2018 12:42PM
March 05, 2018 03:21PM
April 20, 2018 07:02AM
April 20, 2018 11:34AM

Sorry, you can't reply to this topic. It has been closed.

Content reproduced on this site is the property of the respective copyright holders. It is not reviewed in advance by Oracle and does not necessarily represent the opinion of Oracle or any other party.