The Term-Frequency/Inverse-Document-Frequency IR algorithm implemented using redis.
This is an un-optimized, naive, and hopefully mostly-correct implementation of the algorithm.
Assume we have a collection of documents, each with its own unique identifier. We supply the identifier and the document text to the collector:
$ node > var collector = require("./collector"); > collector.indexDocument(1, "I love cats; I love every kind of cat."); > collector.indexDocument(2, "Sorry, I'm thinking about cats again!"); > collector.indexDocument(3, "Can't hug every cat.");
As documents are indexes, words are tokenized using a Porter stemmer.
For a given query, document IDs for matching documents are returned in order of relevance.
Note that there is no synchronous version of the search function. You have to use a callback to do anything with search results.
> collector.search("love", console.log); null [ 1 ] > collector.search("every", console.log); null [ 3, 1 ] > collector.search("cat", console.log); null [ 1, 2, 3 ]
As with indexing, query terms are stemmed. So for example:
> collector.search("hugging cats", console.log); null [ 3, 1, 2 ]
Document 3 is the best match for "hugging cats", since it contains "cat" and "hug". The other two documents are returned because they are about cats, though they're short on hugging.
example/texts directory contains poems downloaded from Project
Gutenberg. The script
librarian.js splits them up into poems, saves
them in a redis store (could be anything - the text storage has nothing
to do with the search mechanism itself), and indexes them.
The resulting 576 poems can be quickly searched:
$ cd example $ node > var librarian = require("./librarian"); > librarian.indexEverything(); // wait for deferred calls to finish ... > librarian.search("flower"); 38 matches found 3 ms elapsed Best match: 32-Emily Dickinson-VII. VII. WITH A FLOWER. I hide myself within my flower, That wearing on your breast, You, unsuspecting, wear me too -- And angels know the rest. I hide myself within my flower, That, fading from your vase, You, unsuspecting, feel for me Almost a loneliness.
The memory use is not small.
The example texts consist of 576 poems in three languages. (By Arthur Rimbaud, Emily Dickinson, Oscar Wilde, Rainer Maria Rilke, Robert Browning (his "shorter" poems), Rudyard Kipling, and William Blake.)
These texts comprise 830kB in three languages (English, French, and German). Actually, you could probably count Rudyard Kipling as a language other than English, for the purposes of indexing.
The resulting indexes in redis consume about 80MB. (Using the total amount of
memory reported by the redis
info command, which is about 1MB high, as it
includes redis's own system usage as well.)
config.filterStopWords === true, this drops by 5 or 6 per cent.
So the memory required for the redis indexes is 100 times higher than the space required to hold the original texts. Yargh!
I find that if all the texts are in the same language, the space requirements are around 50x. Still a huge increase.
I don't know. It was interesting to make, but obviously its applicability is severely limited by the amount of memory consumed. If you have 8GB memory, you could index 160MB of text in the same language. That's not much. A thousand documents? Not so good.
Optimizations could perhaps be found, but even so, its unscalability renders this implementation, used on typical machines, pretty undesirable for all but the most controlled cases.
On the other hand, it demonstrates (as if it needed demonstrating) just how blazingly fast applications written around node and redis are.