Skip to content

Instantly share code, notes, and snippets.

Created April 17, 2011 11:06
Show Gist options
  • Star 4 You must be signed in to star a gist
  • Fork 1 You must be signed in to fork a gist
  • Save karmi/923944 to your computer and use it in GitHub Desktop.
Save karmi/923944 to your computer and use it in GitHub Desktop.
Simplistic Full-Text Search With Redis
The ruby is a pink to blood-red colored gemstone, a variety of the mineral corundum (aluminium oxide). The red color is caused mainly by the presence of the element chromium. Its name comes from ruber, Latin for red. Other varieties of gem-quality corundum are called sapphires. The ruby is considered one of the four precious stones, together with the sapphire, the emerald, and the diamond.
Ruby is a dynamic, reflective, general-purpose object-oriented programming language that combines syntax inspired by Perl with Smalltalk-like features. Ruby originated in Japan during the mid-1990s and was first developed and designed by Yukihiro "Matz" Matsumoto. It was influenced primarily by Perl, Smalltalk, Eiffel, and Lisp.
"Ruby" is a song by English rock band Kaiser Chiefs and is the lead track on their second album, Yours Truly, Angry Mob. It was released as the lead single from that album in the United Kingdom as a download on February 5, 2007 and as a limited edition 7 in and CD single on February 19 that year. It became the band's first ever #1 single on February 25, 2007, and ended 2007 as the year's 10th biggest-selling single in the UK with total sales of 313,765.
#!/usr/bin/env ruby
require 'rubygems'
require 'redis'
require 'benchmark'
module SimpleSearch
def index input
document =
document_id = document.path
tokens = analyze
store document_id, tokens
puts "Indexed document #{document_id} with tokens:", tokens.inspect, "\n"
def analyze content
# >>> Split content by words
# >>> Downcase every word
map { |word| word.downcase }.
# >>> Reject stop words and empty tokens
reject { |word| STOPWORDS.include?(word) || word == '' }
def store document_id, tokens
tokens.each do |token|
# >>> Save posting into inverted index
R.sadd "search:index:terms:#{token}", document_id
# >>> Save occurence count per token and document
R.incr "search:index:counts:#{token}:#{document_id}"
def search query
puts '-'*80
elapsed = Benchmark.realtime do
# >>> Just split query into terms
terms = query.split(' ')
# >>> Gather document ids containing all terms
documents = R.sinter * { |term| "search:index:terms:#{term}" }
documents.each do |document|
score = terms.inject(0) do |sum, term|
sum += R.get("search:index:counts:#{term}:#{document}").to_i; sum
end / terms.size
puts "* #{document} (Score: #{score})"
puts '-'*80, "Query '#{query}' finished in #{sprintf("%1.5f", elapsed)} seconds"
def counts
occurences = {}
# >>> Load counts for all terms and documents in index
counts = R.keys "search:index:counts:*"
counts.each do |count|
_, _, _, term, file = count.split(':')
# p [term, file]
# p R.get count
occurences[term] ||= 0
# >>> Build a hash with terms and their counts
occurences.update( { term => (occurences[term] += R.get(count).to_i) } )
# >>> Sort the terms by their occurences, in descending order
occurences = occurences.sort { |a, b| b[1] <=> a[1] }
R =
STOPWORDS = %w|a an and are as at but by for if in is it no not of on or that the then there these they this to was will with|
extend self
if __FILE__ == $0
case command = ARGV.shift
when 'search'
query = ARGV.join(' ') query
when 'counts'
SimpleSearch.counts.each do |facet|
term, count = facet
puts "* #{term.ljust(10)} (#{count})"
when 'index'
elapsed = Benchmark.realtime do
SimpleSearch::R.keys("search:*").each { |key| SimpleSearch::R.del key }
ARGV.each { |file| SimpleSearch.index file }
puts '-'*80, "Indexing done in #{sprintf("%1.2f", elapsed)} seconds", '-'*80
puts "USAGE:\n #{$0} index <FILE>\n #{$0} search <QUERY>\n #{$0} counts"
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment