Re: Writing inverted index code in perl might be overkill

When I saw P2P i started thinking of a massive P2P effort to index the web...Use spare processor power from computers around the world to index the web. If you had that kind of power you could do more interesting indexs of documents, i wonder however if it could truly rival google or yahoo's indexers. Kind of like a dmoz.org or something. Just thinking out loud, don't mind me.

___________
Eric Hodges

Comment on Re: Writing inverted index code in perl might be overkill

Replies are listed 'Best First'.
Re^2: Writing inverted index code in perl might be overkill by techcode (Hermit) on Aug 18, 2005 at 23:23 UTC
The problem that I see with a solution like this is that many would misuse it - depending on what part(s) of the system would be shared. I'm thinking of reverse engineering that could reveal how to be ranked better.	[reply]
Re^2: Writing inverted index code in perl might be overkill by dpavlin (Friar) on Aug 19, 2005 at 16:57 UTC
That's actually possible using existing horisontal scalability of HyperEstraier. Just setup multiple servers which crawl separate parts of web. Setup search to search over all nodes at once. Indexer can query search index to find out if some other indexer did crawl that page already (and optionally refresh content if needed). That way, you will have fresher pages with bigger number of incomming links (which you can count and use that also in page ranking - I hope that this idea doesn't violate Google patent). I don't have pointer to perl solution for this (other than CPAN modules which make every problem 90% done). On the other hand, with current P2P architecture you can have multiple indexes (for e-mail, documents, etc.) and search over just some or all of them. 2share!2flame...	[reply]