toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Record Links
Author (up) Chierichetti, Flavio; Lattanzi, Silvio; Mari, Federico; Panconesi, Alessandro pdf  doi
openurl 
  Title On Placing Skips Optimally in Expectation Type Conference Article
  Year 2008 Publication Web Search and Web Data Mining (WSDM 2008) Abbreviated Journal  
  Volume Issue Pages 15-24  
  Keywords Information Retrieval  
  Abstract We study the problem of optimal skip placement in an inverted list. Assuming the query distribution to be known in advance, we formally prove that an optimal skip placement can be computed quite efficiently. Our best algorithm runs in time O(n log n), n being the length of the list. The placement is optimal in the sense that it minimizes the expected time to process a query. Our theoretical results are matched by experiments with a real corpus, showing that substantial savings can be obtained with respect to the tra- ditional skip placement strategy, that of placing consecutive skips, each spanning sqrt(n) many locations.  
  Address  
  Corporate Author Thesis  
  Publisher Acm Place of Publication Editor Najork, M.; Broder, A.Z.; Chakrabarti, S.  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ ChiLatMar08 Serial 94  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: