Søkerobot (Norwegian Nynorsk Wikipedia)

Analysis of information sources in references of the Wikipedia article "Søkerobot" in Norwegian Nynorsk language version.

refsWebsite

Global rank Norwegian Nynorsk rank

10web.archive.org

1^st place

7doi.org

2^nd place

7^th place

2www10.org

low place

4,966^th place

2unimi.it

9,889^th place

4,967^th place

2robotstxt.org

low place

4,968^th place

1books.google.com

3^rd place

6^th place

1example.org

low place

7,828^th place

1chato.cl

low place

7,829^th place

1acm.org

1,185^th place

1,512^th place

1harvard.edu

18^th place

64^th place

1nih.gov

4^th place

21^st place

1stanford.edu

179^th place

1ucla.edu

782^nd place

550^th place

1www2003.org

low place

7,830^th place

1springerlink.com

2,569^th place

485^th place

1sharif.edu

low place

7,831^st place

1webist.org

low place

7,832^nd place

1uiowa.edu

3,018^th place

6,205^th place

1brown.edu

2,481^st place

6,292^nd place

acm.org

doi.acm.org

A. Gulli; A. Signorini (2005). «The indexable web is more than 11.5 billion pages». Special interest tracks and posters of the 14th international conference on World Wide Web. ACM Press. s. 902–903. doi:10.1145/1062745.1062789.

books.google.com

MasaTalet på mulige URLar som genererast dynamisk fra serverprogram gjer det vanskelig for roboten å unngå å lasta ned duplikat av sider han allereie har vitja. Sjølv om W3C åtvarar mot å nytta meir enn 255 byte i ein HTTP GET førespurnad[2], svarar til det 256^{256} \approx 3,2 \times 10^{616} sider som kan genererast, og ein kan derfor ikkje gjetta seg til gyldige GET-førespurnadar. I tillegg kan same innehald lenkjast til på fleire forskjellige måtar. Til dømes kan ei vevsapplikasjon som serverer nyheitsmeldingar frå forskjellige årstal tilby eit felt for årstal, og eit felt for svartype. Om du då spesifiserer example.com/?årstal=2000&datatype=XML er dette nøyaktig det same som å spesifisera example.com/?datatype=XML&årstal=2000. Då får du eit problem når same informasjon kan lenkjast på forskjellige måtar, og hyperkoplingane dermed ikkje lengre peikar til unikt innhald.nès, Julien (15. februar 2007). Web Archiving. Springer. s. 1. ISBN 978-3-54046332-0. Henta 5. april 2014.

brown.edu

cs.brown.edu

Junghoo Cho; Hector Garcia-Molina (2000). «Synchronizing a database to improve freshness» (PDF). Proceedings of the 2000 ACM SIGMOD international conference on Management of data. Dallas, Texas, United States: ACM. s. 117–128. ISBN 1-58113-217-4. doi:10.1145/342009.335391. Arkivert (PDF) frå originalen den 18. august 2003. Henta 23. mars 2009.

chato.cl

Castillo, Carlos (2004). Effective Web Crawling (Ph.D. thesis). University of Chile. Henta 3. august 2010.

doi.org

dx.doi.org

Edwards, J., McCurley, K. S., and Tomlin, J. A. (2001). «An adaptive model for optimizing performance of an incremental web crawler». In Proceedings of the Tenth Conference on World Wide Web (Hong Kong: Elsevier Science): 106–113. doi:10.1145/371920.371960. Arkivert frå originalen 25. juni 2014. Henta 23. mai 2014.
A. Gulli; A. Signorini (2005). «The indexable web is more than 11.5 billion pages». Special interest tracks and posters of the 14th international conference on World Wide Web. ACM Press. s. 902–903. doi:10.1145/1062745.1062789.
Steve Lawrence; C. Lee Giles (8. juli 1999). «Accessibility of information on the web». Nature 400 (6740): 107. Bibcode:1999Natur.400..107L. PMID 10428673. doi:10.1038/21987.
Serge Abiteboul; Mihai Preda; Gregory Cobena (2003). «Adaptive on-line page importance computation». Proceedings of the 12th international conference on World Wide Web. Budapest, Hungary: ACM. s. 280–290. ISBN 1-58113-680-3. doi:10.1145/775152.775192. Henta 22. mars 2009.
Paolo Boldi; Bruno Codenotti; Massimo Santini; Sebastiano Vigna (2004). «UbiCrawler: a scalable fully distributed Web crawler» (PDF). Software: Practice and Experience 34 (8): 711–726. doi:10.1002/spe.587. Arkivert frå originalen (PDF) 20. mars 2009. Henta 23. mars 2009.
Cothey, Viv (2004). «Web-crawling reliability». Journal of the American Society for Information Science and Technology 55 (14): 1228–1238. doi:10.1002/asi.20078.
Junghoo Cho; Hector Garcia-Molina (2000). «Synchronizing a database to improve freshness» (PDF). Proceedings of the 2000 ACM SIGMOD international conference on Management of data. Dallas, Texas, United States: ACM. s. 117–128. ISBN 1-58113-217-4. doi:10.1145/342009.335391. Arkivert (PDF) frå originalen den 18. august 2003. Henta 23. mars 2009.

example.org

name=HTTP/1.1 standardenDoe, John (30 April 2005). «My Favorite Things, Part II». Encyclopedia of Things. Open Publishing. Henta 6 July 2005.

harvard.edu

adsabs.harvard.edu

Steve Lawrence; C. Lee Giles (8. juli 1999). «Accessibility of information on the web». Nature 400 (6740): 107. Bibcode:1999Natur.400..107L. PMID 10428673. doi:10.1038/21987.

nih.gov

ncbi.nlm.nih.gov

Steve Lawrence; C. Lee Giles (8. juli 1999). «Accessibility of information on the web». Nature 400 (6740): 107. Bibcode:1999Natur.400..107L. PMID 10428673. doi:10.1038/21987.

robotstxt.org

Koster, M. (1996). A standard for robot exclusion Arkivert 2007-11-07 ved Wayback Machine..
Koster, M. (1993). Guidelines for robots writers Arkivert 2005-04-22 ved Wayback Machine..

sharif.edu

ce.sharif.edu

Shervin Daneshpajouh, Mojtaba Mohammadi Nasiri, Mohammad Ghodsi, A Fast Community Based Algorithm for Generating Crawler Seeds Set Arkivert 2011-07-20 ved Wayback Machine., In proceeding of 4th International Conference on Web Information Systems and Technologies (WEBIST-2008), Funchal, Portugal, May 2008.

springerlink.com

Paolo Boldi; Massimo Santini; Sebastiano Vigna (2004). «Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations». Algorithms and Models for the Web-Graph. s. 168–180. Arkivert frå originalen (PDF) 19. april 2010. Henta 23. mars 2009.

stanford.edu

ilpubs.stanford.edu

Cho, J.; Garcia-Molina, H.; Page, L. (April 1998). «Efficient Crawling Through URL Ordering». Seventh International World-Wide Web Conference (Brisbane, Australia).

ucla.edu

oak.cs.ucla.edu

Cho, Junghoo, "Crawling the Web: Discovery and Maintenance of a Large-Scale Web Data", Ph.D. dissertation, Department of Computer Science, Stanford University, November 2001

uiowa.edu

dollar.biz.uiowa.edu

Pant, Gautam; Srinivasan, Padmini; Menczer, Filippo (2004). «Crawling the Web» (PDF). I Levene, Mark; Poulovassilis, Alexandra. Web Dynamics: Adapting to Change in Content, Size, Topology and Use. Springer. s. 153–178. ISBN 978-3-540-40676-1. Arkivert frå originalen (PDF) 20. mars 2009. Henta 22. mars 2009.

unimi.it

vigna.dsi.unimi.it

Paolo Boldi; Bruno Codenotti; Massimo Santini; Sebastiano Vigna (2004). «UbiCrawler: a scalable fully distributed Web crawler» (PDF). Software: Practice and Experience 34 (8): 711–726. doi:10.1002/spe.587. Arkivert frå originalen (PDF) 20. mars 2009. Henta 23. mars 2009.
Paolo Boldi; Massimo Santini; Sebastiano Vigna (2004). «Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations». Algorithms and Models for the Web-Graph. s. 168–180. Arkivert frå originalen (PDF) 19. april 2010. Henta 23. mars 2009.

web.archive.org

Edwards, J., McCurley, K. S., and Tomlin, J. A. (2001). «An adaptive model for optimizing performance of an incremental web crawler». In Proceedings of the Tenth Conference on World Wide Web (Hong Kong: Elsevier Science): 106–113. doi:10.1145/371920.371960. Arkivert frå originalen 25. juni 2014. Henta 23. mai 2014.
Marc Najork and Janet L. Wiener. Breadth-first crawling yields high-quality pages Arkivert 2017-12-24 ved Wayback Machine.. In Proceedings of the Tenth Conference on World Wide Web, pages 114–118, Hong Kong, May 2001. Elsevier Science.
Paolo Boldi; Bruno Codenotti; Massimo Santini; Sebastiano Vigna (2004). «UbiCrawler: a scalable fully distributed Web crawler» (PDF). Software: Practice and Experience 34 (8): 711–726. doi:10.1002/spe.587. Arkivert frå originalen (PDF) 20. mars 2009. Henta 23. mars 2009.
Paolo Boldi; Massimo Santini; Sebastiano Vigna (2004). «Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations». Algorithms and Models for the Web-Graph. s. 168–180. Arkivert frå originalen (PDF) 19. april 2010. Henta 23. mars 2009.
Baeza-Yates, R., Castillo, C., Marin, M. and Rodriguez, A. (2005). Crawling a Country: Better Strategies than Breadth-First for Web Page Ordering. In Proceedings of the Industrial and Practical Experience track of the 14th conference on World Wide Web, pages 864–872, Chiba, Japan. ACM Press.
Shervin Daneshpajouh, Mojtaba Mohammadi Nasiri, Mohammad Ghodsi, A Fast Community Based Algorithm for Generating Crawler Seeds Set Arkivert 2011-07-20 ved Wayback Machine., In proceeding of 4th International Conference on Web Information Systems and Technologies (WEBIST-2008), Funchal, Portugal, May 2008.
Pant, Gautam; Srinivasan, Padmini; Menczer, Filippo (2004). «Crawling the Web» (PDF). I Levene, Mark; Poulovassilis, Alexandra. Web Dynamics: Adapting to Change in Content, Size, Topology and Use. Springer. s. 153–178. ISBN 978-3-540-40676-1. Arkivert frå originalen (PDF) 20. mars 2009. Henta 22. mars 2009.
Junghoo Cho; Hector Garcia-Molina (2000). «Synchronizing a database to improve freshness» (PDF). Proceedings of the 2000 ACM SIGMOD international conference on Management of data. Dallas, Texas, United States: ACM. s. 117–128. ISBN 1-58113-217-4. doi:10.1145/342009.335391. Arkivert (PDF) frå originalen den 18. august 2003. Henta 23. mars 2009.
Koster, M. (1996). A standard for robot exclusion Arkivert 2007-11-07 ved Wayback Machine..
Koster, M. (1993). Guidelines for robots writers Arkivert 2005-04-22 ved Wayback Machine..

webist.org

Shervin Daneshpajouh, Mojtaba Mohammadi Nasiri, Mohammad Ghodsi, A Fast Community Based Algorithm for Generating Crawler Seeds Set Arkivert 2011-07-20 ved Wayback Machine., In proceeding of 4th International Conference on Web Information Systems and Technologies (WEBIST-2008), Funchal, Portugal, May 2008.

www10.org

Edwards, J., McCurley, K. S., and Tomlin, J. A. (2001). «An adaptive model for optimizing performance of an incremental web crawler». In Proceedings of the Tenth Conference on World Wide Web (Hong Kong: Elsevier Science): 106–113. doi:10.1145/371920.371960. Arkivert frå originalen 25. juni 2014. Henta 23. mai 2014.
Marc Najork and Janet L. Wiener. Breadth-first crawling yields high-quality pages Arkivert 2017-12-24 ved Wayback Machine.. In Proceedings of the Tenth Conference on World Wide Web, pages 114–118, Hong Kong, May 2001. Elsevier Science.

www2003.org

Serge Abiteboul; Mihai Preda; Gregory Cobena (2003). «Adaptive on-line page importance computation». Proceedings of the 12th international conference on World Wide Web. Budapest, Hungary: ACM. s. 280–290. ISBN 1-58113-680-3. doi:10.1145/775152.775192. Henta 22. mars 2009.