June 19, 2013

Comment: Full text search for all MySQL Storage Engines

June 29, 2006 By 37 Comments

… process all those hits specially for the case when I want the result to be top 200 sorted by date. For mysql fulltext that means that if each of the 10 common words produces 150k hits internally the mysql server… sphinx was way faster than mysqls own fulltext it still took 16 seconds for the “heavy” search) and that is why I…

Filed Under: Insight for DBAs Tagged With: ,

Comment: Full text search for all MySQL Storage Engines

June 29, 2006 By 37 Comments

…, what are the odds that mysql will use sphinx as its native fulltext ….60 read_hits: 2.16 ————— 10 most common words along with only -l 200 –sort=date (sorting by date descending (equal to my previous benchmark when there were no boolean search available …

Filed Under: Insight for DBAs Tagged With: ,

Post: Sphinx search performance optimization: attribute-based filters

January 15, 2013 By 11 Comments

… in MySQL terms, Full text columns are always indexed and using the very powerful extended query syntax you can do search against… other hand are sort of like unindexed MySQL columns. They are the extra details you may want to filter by, which is usually… | | hits[0] | 287 | +—————+————+ 6 rows in set (0.00 sec) That looks much better and I can mix it with other search…

Filed Under: Insight for Developers, MySQL Tagged With: , ,

Post: MySQL Server Variables - SQL layer or Storage Engine specific.

June 8, 2006 By 14 Comments

… in memory tables. So first MySQL versions did not bother naming…like it to make sure data hits the disk ft_boolean_syntax, …expansion_limit, ft_stopword_file FullText search related variables. As FullText currently…sort_buffer_size Buffer used to sort result set (allocated by each thread once sorting …

Filed Under: Insight for DBAs Tagged With: ,

Post: MySQL-Memcached or NOSQL Tokyo Tyrant - part 3

October 19, 2009 By 25 Comments

… to see what sort of performance we can see compared to MySQL and Memcached,…can add a where clause and search individual columns, and a ton more “… interesting is I started to hit bottlenecks in MySQL/Innodb when I had enough…to try and continue this series by exploring and benchmarking other NOSQL …

Filed Under: Benchmarks, Cloud and NoSQL, MySQL Tagged With: , ,

Comment: EuroOSCON 2006 - High Performance FullText Search

September 23, 2006 By 4 Comments

… my case the problem with mysql fulltext were that my searches performed: * Using boolean search. * No stopword-list. * Sorting hits by date and not “relevance” since relevance were irrelevant in this case :-) All the three reasons above made mysql…

Filed Under: Events and Announcements Tagged With: ,

Comment: Using Sphinx as MySQL data retrieval accelerator

November 7, 2006 By 25 Comments

…BY” is pretty common when using a sqlserver such as mysql so this would perhaps be a hint to the mysql developers to adopt new sorting… you really get the hits with highest relevance in return…you get with a single search query against Google however …

Filed Under: Insight for Developers Tagged With: ,

Comment: Full text search for all MySQL Storage Engines

February 12, 2010 By 37 Comments

… table just for search, and keep the information via …from this knowledge) to hit 2 FT indices at …by using BOOLEAN queries to restrict, and expressions to sort. AFAIK, natural FTS can’t sort until all results are returned anyway. I have reasonable success with MySQL…

Filed Under: Insight for DBAs Tagged With: ,

Comment: Using Sphinx as MySQL data retrieval accelerator

November 5, 2006 By 25 Comments

… sorting the results at all and that can be proven by just changing the … see a major increase in processing time… Searching on just “the” (or any other indexed… or any searchengine which is using mysql as backend and like sphinx stores … the word table and not the hit table itself. The time will be …

Filed Under: Insight for Developers Tagged With: ,