If all the hub and authority scores are initialized to 1, what is the hub/authority score of a node after one iteration?
In the preceding discussion we encountered two recommended “hard constants” – the increment on te being ten times the last fetch time, and the number of back queues being three times the number of crawl threads. How are these two constants related?
How should the Boolean query x AND NOT y be handled? Why is naive evaluation
of this query normally very expensive? Write out a postings merge algorithm thatevaluates this query efficiently.