<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Measuring index quality using random walks on the web</dc:title>
   	<dc:creator>Henzinger, Monika H ; https://orcid.org/0000-0002-5008-6530</dc:creator>
   	<dc:creator>Heydon, Allan</dc:creator>
   	<dc:creator>Mitzenmacher, Michael</dc:creator>
   	<dc:creator>Najork, Marc</dc:creator>
   	<dc:subject>Search engines</dc:subject>
   	<dc:subject>Index quality</dc:subject>
   	<dc:subject>Random walks</dc:subject>
   	<dc:subject>PageRank</dc:subject>
   	<dc:description>Recent research has studied how to measure the size of a search engine, in terms of the number of pages indexed. In this paper, we consider a different measure for search engines, namely the quality of the pages in a search engine index. We provide a simple, effective algorithm for approximating the quality of an index by performing a random walk on the Web, and we use this methodology to compare the index quality of several major search engines.</dc:description>
   	<dc:publisher>Elsevier</dc:publisher>
   	<dc:date>1999</dc:date>
   	<dc:type>info:eu-repo/semantics/article</dc:type>
   	<dc:type>doc-type:Article</dc:type>
   	<dc:type>Article</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_2df8fbb1</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/11688</dc:identifier>
   	<dc:source>Henzinger M, Heydon A, Mitzenmacher M, Najork M. Measuring index quality using random walks on the web. &lt;i&gt;Computer Networks&lt;/i&gt;. 1999;31(11-16):1291-1303. doi:&lt;a href=&quot;https://doi.org/10.1016/s1389-1286(99)00016-x&quot;&gt;10.1016/s1389-1286(99)00016-x&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1016/s1389-1286(99)00016-x</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/1389-1286</dc:relation>
   	<dc:rights>info:eu-repo/semantics/closedAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
