Difference between revisions of "Haskell Quiz/Index and Query"
Jump to navigation
Jump to search
m |
(+cat) |
||
Line 28: | Line 28: | ||
* [[Haskell Quiz/Index and Query/Solution Jethr0|Jethr0]] |
* [[Haskell Quiz/Index and Query/Solution Jethr0|Jethr0]] |
||
+ | |||
+ | [[Category:Haskell Quiz|Index and Query]] |
Latest revision as of 10:28, 13 January 2007
Ruby Quiz #54:
An indexing scheme where you number all encountered words ascendingly and represent the content of a file as bit-array with the bit at position 2^i representing the i'th word.
So if you have for example:
Doc1=The quick brown fox Doc2=Jumped over the brown dog Doc3=Cut him to the quick
This would yield:
Doc1=00000001111 Doc2=00001110101 Doc3=11110000011
You can very quickly return the Docs that contain 'the' [ Doc1,Doc2,Doc3 ], or 'brown' [ Doc1,Doc2 ] etc.