[{"article_processing_charge":"No","scopus_import":"1","extern":"1","publication_status":"published","keyword":["Search engines","Index quality","Random walks","PageRank"],"publisher":"Elsevier","intvolume":"        31","month":"05","page":"1291-1303","day":"17","citation":{"mla":"Henzinger, Monika, et al. “Measuring Index Quality Using Random Walks on the Web.” <i>Computer Networks</i>, vol. 31, no. 11–16, Elsevier, 1999, pp. 1291–303, doi:<a href=\"https://doi.org/10.1016/s1389-1286(99)00016-x\">10.1016/s1389-1286(99)00016-x</a>.","chicago":"Henzinger, Monika, Allan Heydon, Michael Mitzenmacher, and Marc Najork. “Measuring Index Quality Using Random Walks on the Web.” <i>Computer Networks</i>. Elsevier, 1999. <a href=\"https://doi.org/10.1016/s1389-1286(99)00016-x\">https://doi.org/10.1016/s1389-1286(99)00016-x</a>.","ama":"Henzinger M, Heydon A, Mitzenmacher M, Najork M. Measuring index quality using random walks on the web. <i>Computer Networks</i>. 1999;31(11-16):1291-1303. doi:<a href=\"https://doi.org/10.1016/s1389-1286(99)00016-x\">10.1016/s1389-1286(99)00016-x</a>","ieee":"M. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “Measuring index quality using random walks on the web,” <i>Computer Networks</i>, vol. 31, no. 11–16. Elsevier, pp. 1291–1303, 1999.","short":"M. Henzinger, A. Heydon, M. Mitzenmacher, M. Najork, Computer Networks 31 (1999) 1291–1303.","ista":"Henzinger M, Heydon A, Mitzenmacher M, Najork M. 1999. Measuring index quality using random walks on the web. Computer Networks. 31(11–16), 1291–1303.","apa":"Henzinger, M., Heydon, A., Mitzenmacher, M., &#38; Najork, M. (1999). Measuring index quality using random walks on the web. <i>Computer Networks</i>. Elsevier. <a href=\"https://doi.org/10.1016/s1389-1286(99)00016-x\">https://doi.org/10.1016/s1389-1286(99)00016-x</a>"},"abstract":[{"lang":"eng","text":"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."}],"article_type":"original","status":"public","issue":"11-16","language":[{"iso":"eng"}],"quality_controlled":"1","doi":"10.1016/s1389-1286(99)00016-x","oa_version":"None","author":[{"first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"last_name":"Heydon","first_name":"Allan","full_name":"Heydon, Allan"},{"first_name":"Michael","full_name":"Mitzenmacher, Michael","last_name":"Mitzenmacher"},{"first_name":"Marc","full_name":"Najork, Marc","last_name":"Najork"}],"publication_identifier":{"issn":["1389-1286"]},"publication":"Computer Networks","date_updated":"2024-11-06T08:14:12Z","year":"1999","date_published":"1999-05-17T00:00:00Z","date_created":"2022-07-29T07:00:28Z","type":"journal_article","volume":31,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11688","title":"Measuring index quality using random walks on the web"}]