Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.



Published on

Published in: Technology, News & Politics
  • Be the first to comment

  • Be the first to like this


  1. 1. Anatomy of a search engine • Not much known about AV, Lycos, Yahoo, etc. • But Google and Clever (to some extent) are published • Design criteria • Differences • Architecture • Data structures
  2. 2. Requirements • Basic IR concepts: – Recall: what % of relevant docs are retrieved – Precision: what % of docs retrieved are relevant • Quantity: – handle hundreds of thousands of queries/sec • Quality – High precision (not with pres. engines)
  3. 3. Page rank • Idea: a page is important when it is referred to a lot, or referred to from an important page • PR is used to prioritize; works well even with search is just on page titles
  4. 4. PR details • Pages T1,…,Tn point to page A, C(A) is a link fan-out of A PR(A)=(1-d) + d(PR(T1)/C(T1)+…+PR(Tn)/C(Tn)) d=dumping factor=.85 Model of random walk on the Web PR(p) = prob. That a “random” user will visit p
  5. 5. Other features and terms • Anchor text is associated with the page it links to • Some markup aspects are used
  6. 6. Google architecture • URL server sends list of URLs to be fetched to crawlers • StoreServer compresses and stores pages • Indexer extracts words, their pos., size, capital. • Anchors cont.links and their text • Sorter generates inverted index • Searcher uses Lexicon, II, and PR
  7. 7. Some details • Barrels store words (wordIDs); if a doc contains a word, doc`s ID and its wordID are stored with hitlist of this word in the doc • Lexicon points to Inverted Barrels; ea word points to docid and hits
  8. 8. Operation • Crawling • Searching • Ranking
  9. 9. Crawling and indexing • Parsing into anchors and words – error robustness (flex+stack) • Indexing in parallel – hashing into barrels using the lexicon – the problem of new words shared
  10. 10. Searching 1 parse query 2 convert words into wordIDs 3 Identif. A barrel for ea. Word 4 scan doclists until a doc that matches all the search words is found
  11. 11. Ranking • For a single word, identify the hit list and its type, count the # of hits of ea type, vector- multiply • Combine with PR • For multiple words, take proximity into account
  12. 12. Going further • Google will not return any IBM pages for the query `mainframes` • Many pages that point to IBM page use the term ‘mainframe’, so this page should be returned
  13. 13. • Clever ranks authoritities pages and hub pages. Authorities are pages with high PR. Hubs are pages that point to authorities. E.g. my friend’s page with a list of links to on-line CD stores. Hubs may not be chosen by PR alone • Clever/HITS (Hyperlink Induced Topic Search) starts with an initial set of pages and hubs
  14. 14. Mathematically speaking… • Let xp be authority weight, yq be hub weight, q->p denotes q links to p x p = ∑ yq y p = ∑ xq q→ p p →q • Let A be adjacency matrix: Ai,j =1 if there is a link between i and j, 0 otherwise
  15. 15. x ←ATy and y ← Ax x ←ATAx, and we can iterate that further, working with powers of ATA This sequence of powers converges to the eigenvector of ATA This means that the result does not depend on the initial weights
  16. 16. • Remove ‘local’ links (“back to the main page”) • Drift: transfer of main authority to, e.g., topics of hobbies • Highjacking: if several pages from the same site occur in the base set, they may take over a topic
  17. 17. • Remedied by partial content indexing – anchors, and by • dividing a page into pagelets – contiguous sequences of links • Hubs are good when learning about a topic, less so when seekeing specific info.
  18. 18. Autres engins • Altavista et Lycos ont probablement des méthodes simples de sélection • Excite semble utiliser beaucoup de propriétés des pages • Voir « What is a tall poppy among Web pages? »7th Int’l WWW Conf.