Presentation is loading. Please wait.

Presentation is loading. Please wait.

(c) Maria Indrawan 20041 Distributed Information Retrieval.

Similar presentations


Presentation on theme: "(c) Maria Indrawan 20041 Distributed Information Retrieval."— Presentation transcript:

1 (c) Maria Indrawan 20041 Distributed Information Retrieval

2 (c) Maria Indrawan 20042 Challenges in Managing Distributed Information No topology of the data organisation. Dynamic data. The size of the collection. No control over quality of the data. Multimedia data.

3 (c) Maria Indrawan 20043 Challenges-Human Factor Diversity of users –Expert to novice Ill-formed queries. Specific behaviour –Favour precision over recall (85% users only look at the first screen – Lan Huang A survey on Web Information Technology)

4 (c) Maria Indrawan 20044 Types of Distributed IR Directory –Yahoo Search Engine –Google, AskJeeves, Yahoo, Teoma Meta Search –Metacrawler, Dogpile Distributed Broker –Harvest

5 (c) Maria Indrawan 20045 Directory Listing Manually created –Yahoo, Google, MSN –Open Directory Project www.dmoz.org

6 (c) Maria Indrawan 20046 Directory Listing Automatic classification TERENA. –http://www.terena.nl/tech/projects/portal/isir/reisnews9908 seac.htmlhttp://www.terena.nl/tech/projects/portal/isir/reisnews9908 seac.html Scorpion –http://orc.rsch.oclc.org:6109/

7 (c) Maria Indrawan 20047 Search Engine Architecture Crawler (robots) –Collecting the pages from the WEB. Indexer –Indexing pages collected by the crawler and represent them in an efficient data structure. Query Server –Accepting, process and return the results of the query from the user.

8 (c) Maria Indrawan 20048 Crawler – Design Considerations Crawling algorithm –Breadth-first vs Depth first How do we handle URL-aliases? How do we reduce server load? How do we detect a duplicate page or a mirror- site? How often we need to revisit a site?

9 (c) Maria Indrawan 20049 Update Rate www.searchengineshowdown.com (May 2003) www.searchengineshowdown.com Search EngineNewest page Found Rough AverageOldest Page Found Google2 days1 month165 days MSN (Ink)1 day4 weeks51 days HotBot (Ink)1 day4 weeks51 days AlltheWeb1 day1 month599 days Gigablast45 days7 months381 days Teoma41 days2.5 months81 days WiseNut133 days6 months183 days

10 (c) Maria Indrawan 200410 Indexer - Design Considerations How do we handle typing mistakes? Do we use stop list and stemming algorithm? How much do we want to index in a given web page? –Google index only the first 101 KB of a web page and 120 KB of PDF file. How big do we want the database indexed to be? –response time vs coverage Do we want to index PDF, PS files?

11 (c) Maria Indrawan 200411 Size Growth

12 (c) Maria Indrawan 200412 Estimated Size www.searchengineshowdown.com, Dec 31, 2002 www.searchengineshowdown.com

13 (c) Maria Indrawan 200413 Query Server- Design Considerations Retrieval model. Complexity of the query syntax. HCI – human computer interface. Output display.

14 (c) Maria Indrawan 200414 Retrieval Model Traditional approach: –Keywords matching returns to many low quality matches – low precision. Search engines need a VERY high precision output – even on the expense of RECALL. How can we achieve this?

15 (c) Maria Indrawan 200415 Google Retrieval Model Utilise the popularity of a page –If a page has many other pages pointed to this page, the page must be very important. We can assign a high weight to this page during search. –If a page is pointed by a popular page, this page can be considered as important because it is referred by a reputable source (a popular page). –PageRank Function.

16 (c) Maria Indrawan 200416 PageRank Example 3 3 10053 9 50 3

17 (c) Maria Indrawan 200417 Google Retrieval Model Utilise the anchor text. –Anchors often provide more accurate descriptions of web pages than the pages themselves. –Anchors may exist for documents which cannot be indexed by a text-based search engine. Utilise the appearance of the text. –Larger and bolder font text are weighted higher than other words.

18 (c) Maria Indrawan 200418 Results Overlap

19 (c) Maria Indrawan 200419 Metasearch Meta searches do not build their own index. They use the index of the existing search engines. When user posted a query to a meta search, the meta search sends the query to a number of search engines and collates the results. A list of metacrawler: –http://www.searchenginewatch.com/links/article.php/21 56241http://www.searchenginewatch.com/links/article.php/21 56241

20 (c) Maria Indrawan 200420 Meta Search metacrawler, www.metacrawler.comwww.metacrawler.com –uses google, yahoo,askJeeves, About, Looksmart, Teoma, Overture, FindWhat. dogpile, www.dogpile.comwww.dogpile.com –uses google, yahoo,askJeeves, About, Looksmart, Teoma, Overture, FindWhat

21 (c) Maria Indrawan 200421 Metasearch Design Issue Potential problems: –Translating the user query into a different query in a different search engine. –Query time is bounded by the least powerful (slowest) underlying system. –Combining results into a single ranked list is difficult. Effectiveness depend on heuristics and information passed back from underlying search engines. detecting overlap in the query results different scoring schemes (some do not use)

22 (c) Maria Indrawan 200422 Distributed Broker Information is indexed locally by geographical locations or institutional boundaries. –Suitable for supporting community that to have a common search database. Local indexes are combined to provide wider coverage. Document scoring is performed locally by each index server.

23 (c) Maria Indrawan 200423 Distributed Broker broker CSSE broker SIMS broker ACC broker MGM broker FIT broker F. Bussiness broker Monash

24 (c) Maria Indrawan 200424 Distributed Broker Example: Harvest –http://www.ncsa.uiuc.edu/SDG/IT94/Proceedings/Searc hing/schwartz.harvest/schwartz.harvest.htmlhttp://www.ncsa.uiuc.edu/SDG/IT94/Proceedings/Searc hing/schwartz.harvest/schwartz.harvest.html

25 (c) Maria Indrawan 200425 General architecture Hierarchical vs Flat Hierarchical: underlying index servers are connected through a hierarchy of brokers. –broker hierarchy provides efficient and global coverage. –brokers can be geographical, institutional or subject based. broker query broker query broker index server...

26 (c) Maria Indrawan 200426 Flat Graph Model broker index server broker index server broker index server broker index server... query

27 (c) Maria Indrawan 200427 Useful site www.searchenginewatch.com –Provides links to most of the information discovery tools.

28 (c) Maria Indrawan 200428 Summary Type of Distributed Information Discovery –Directory Listing yahoo –Search Engines. Google, AskJeeves, Teoma –Metasearch metacrawler, dogpile –Distributed Broker Harvest


Download ppt "(c) Maria Indrawan 20041 Distributed Information Retrieval."

Similar presentations


Ads by Google