<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
<title>Snipplr</title>
<link>http://snipplr.com/language/mysql/tags/ranking</link>
<description>Recent snippets posted on Snipplr.com</description>
<language>en-us</language>
<pubDate>Wed, 19 Jun 2013 21:33:29 GMT</pubDate>
<item>
<title>(MySQL) Very simple search retrieval query, ranking with tf-idf weight - jatkins</title>
<link>http://snipplr.com/view/51513/very-simple-search-retrieval-query-ranking-with-tfidf-weight/</link>
<description><![CDATA[ <p>This assumes two tables: `search_results` and `keyword_counts`. `search_results` is an inverted index with, at minimum, fields for the keyword indexed, its occurrences, and the indexed item's id in the table it is in (e.g. `item_id` in `search_results` could be `45`, referencing `id = 45` in `documents`) in the table it's in. `keyword_counts` has a row for each indexed item with the total number of unique words in it and its id in the table the actual item is in.

Released into the public domain. This may have bugs in it, but it's worked so far for me.</p> ]]></description>
<pubDate>Mon, 04 Apr 2011 20:33:17 GMT</pubDate>
<guid>http://snipplr.com/view/51513/very-simple-search-retrieval-query-ranking-with-tfidf-weight/</guid>
</item>
<item>
<title>(MySQL) Bayesian ranking - seb-oulba</title>
<link>http://snipplr.com/view/22559/bayesian-ranking/</link>
<description><![CDATA[ <p>Use Bayesian values to get a "more fair" ranking than average value based ranking. Example with a "games" table having some ratings in table "ratings"</p> ]]></description>
<pubDate>Thu, 05 Nov 2009 05:07:51 GMT</pubDate>
<guid>http://snipplr.com/view/22559/bayesian-ranking/</guid>
</item>
</channel>
</rss>