Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number

Re^2: Writing inverted index code in perl might be overkill

by dpavlin (Friar)
on Aug 19, 2005 at 16:57 UTC ( #485209=note: print w/replies, xml ) Need Help??

in reply to Re: Writing inverted index code in perl might be overkill
in thread Writing a Search Engine in Perl?

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.

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

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://485209]
[LanX]: I have my doubts, IMHO its a workaround if the glyph is missing
[LanX]: (they are pronounced differently)
[choroba]: perl -Mutf8 -Mfeature=fc -wE 'say fc "straße" eq fc "strasse"'
[choroba]: returns 1 for me
[choroba]: are they?
[LanX]: strict rules : the a is long in "straße" and short in "strasse"
[choroba]: So the "a" is different, not the "s" ;-)
[LanX]: people knowing that it's a workaround will pronounce it right
[LanX]: well
[LanX]: Maße and Masse are two very different words.

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (11)
As of 2018-03-21 15:47 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (268 votes). Check out past polls.