Boolean search
The Boolean search is a model for information retrieval in which Document is considered as a bag of words.
Any query is posed as a boolean expression of terms where term means word.
Let us consider closely the model by an example.
Let us tokenize string of skills and build the equivalent matrix in memory(RAM)
The result is Rinat.
Term-Document incidence matrix
We have a four documents which contains programming skills of employees.- Yernat
PHP, Java, Basic - Marat
Perl, Java, C++ - Rinat
PHP, C++, XSLT - Bekzat
Java, HTML, PHP
Boolean query processing
Let us try to find employees who skilled with PHP AND C++.
May 3rd, 2011
