Dear Monks,
I came across "Bit vector" from one of my posts where I was said that I could compress my file by 75% using Bit vector and thus 75% less memory required and 75% shorter the search space to look up for a substring from a string.
So now I wanted to know that what a "bit vectors" is all about,(Sry I havn't heard of it) and how can i use it for my exact string matching problem.I request to our fellow monks to shed some light over it or direct me to some digestible article so that i could grasp it easily (as i am not from the computer science background).
Here is the reference node where i was introduced to it at first Re: Exact string matching
In reply to Bit Vector ?? by saranrsm
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |