I am looking for an automated way to answer the question: what are the URLs on the world wide web that contain at least two strings from a set of strings.
So if I have a set of strings {"A", "B" and "C"} -- I want to know, what pages on the world wide web contain "A" and B", "A" and "C", "B" and "C" or "A", "B" and "C."
Obviously, for this simple example: Google it!
But I want a scaleable, automated, and free solution. Google does not permit automated queries. Yahoo makes you pay.
One idea I have is (1) start with a URL, (2) check the text at that URL for the search strings (3) parse out the links from the text (4) record that you have checked the page and if it contains the strings then (5) search the links from the initial URL. Repeat until you have searched the tree.
How feasible is this in terms of time and space on a single commodity machine -- given the size the internet? The internet is really, really big -- but only a comparatively few pages will contain these strings (they are proper names).
I don't want to index the whole web as if my laptop were google!
Most of the crawler's time will be spent confirming that the pages don't contain the strings.
I'm trying to get a rough ballpark to understand if this is even remotely feasible.