June 19, 2013

Post: Sphinx: Going Beyond full text search

July 23, 2007 By 18 Comments

… youtube.com wikipedia.org and other top domains was extremely slow. Not to mention counting number of links (and number number… and now these 6 rows become simply one row in sphinx index with 6 “keywords” – specially crafter strings which corresponded to the… site or forum from the global sphinx index. So in general we find parallel processing using sphinx pretty good solution for many data…

Filed Under: Insight for Developers Tagged With: ,

Post: Sphinx search performance optimization: multi-threaded search

January 16, 2013 By 10 Comments

… way very early on. If your sphinx index does not fit to one machine, you would index different parts of it from different… your data looks like. Finishing line I always loved how Sphinx scales out easily with as many machines you need and… as I should. Well, it’s not like it is slow or anything, but queries are never too fast, are they…

Filed Under: MySQL Tagged With: , , ,

Post: Sphinx search performance optimization: attribute-based filters

January 15, 2013 By 11 Comments

… are not B-tree structured (and therefore are slow to work with), by default Sphinx actually stores them in memory. In fact… records we have in this index and how long does it take to do a full scan: sphinx> select * from catalog; … 20… an extra column in a full text index that I can use for filtering: sphinx> select * from catalog where match(‘@userkey userkey…

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

Comment: Full text search for all MySQL Storage Engines

June 27, 2006 By 37 Comments

… direct plugin for mysql (I assume this means that the sphinx index can be created directly from within mysql just as with… indexing and searching is fast (compared to vectorspace where the indexing will be slow) and the datastorage needed is smaller than with reversed index… more than “mix between reversed index and vectorspace model” ? :P Also, does the implementation of sphinx as plugin for mysql 5.1…

Filed Under: Insight for DBAs Tagged With: ,

Post: Using index for ORDER BY vs restricting number of rows.

February 16, 2007 By 8 Comments

… to use index for further restriction and than using file sort, rather than using index for sorting and doing non-index based filtering… index hint. The other problem you may have however is calculating count of matching rows which may be even trickier to slow for complex searches which generate a lot of rows. Another interesting technique is to use sphinx search to…

Filed Under: Insight for Developers Tagged With:

Post: How Percona does a MySQL Performance Audit

November 24, 2008 By 17 Comments

…. You cannot consider any one of these factors (schema, queries, indexing) in isolation, because they are tightly bound together, and tweaking…: wget http://hackmysql.com/scripts/mysqlsla perl mysqlsla -lt slow /path/to/slow.log By default, this outputs the top 10 most… evaluate Sphinx, or something like that.) In the common case, though, a query simply needs a rewrite or a new index or…

Filed Under: Insight for Developers Tagged With:

Comment: Full text search for all MySQL Storage Engines

June 29, 2006 By 37 Comments

… end just want to check if there is the match. Sphinx would count relevance even if sorting is done by SPH… date. Sphinx is not getting slower whatever sorting mode you’re using as data is not presorted in the index by relevance… date and get top 20 matches that would be really slow. About sphinx – it would be interesting to see which performance do…

Filed Under: Insight for DBAs Tagged With: ,

Post: Economics of Performance Optimization

March 13, 2008 By 9 Comments

… schema changes, use of replication, caching, using memcached, sphinx, implementing proper web caching etc. These changes are…implement well and add has higher risks – adding index you rarely would add bugs to your …money until projects takes off. As it gets slow one can spend say $1000 or personal …

Filed Under: Insight for Developers Tagged With: