Graph structure in the Web
The study of the Web as a graph is not only fascinating in its own right, but also yields valuable insight into Web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution. We report on experiments on local and global properties of...
Gespeichert in:
| Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2000-06, Vol.33 (1-6), p.309-320 |
|---|---|
| Hauptverfasser: | , , , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 320 |
|---|---|
| container_issue | 1-6 |
| container_start_page | 309 |
| container_title | Computer networks (Amsterdam, Netherlands : 1999) |
| container_volume | 33 |
| creator | Broder, Andrei Kumar, Ravi Maghoul, Farzin Raghavan, Prabhakar Rajagopalan, Sridhar Stata, Raymie Tomkins, Andrew Wiener, Janet |
| description | The study of the Web as a graph is not only fascinating in its own right, but also yields valuable insight into Web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution. We report on experiments on local and global properties of the Web graph using two AltaVista crawls each with over 200 million pages and 1.5 billion links. Our study indicates that the macroscopic structure of the Web is considerably more intricate than suggested by earlier experiments on a smaller scale. |
| doi_str_mv | 10.1016/S1389-1286(00)00083-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_57511491</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1389128600000839</els_id><sourcerecordid>55328325</sourcerecordid><originalsourceid>FETCH-LOGICAL-c448t-a8da601bed3807a6236510bda6dbac5d700f4fac4418aba5e53b3fe86333001b3</originalsourceid><addsrcrecordid>eNqFkE1Lw0AQhhdRsFb_gCAED6KH6Gw2-3USKVqFggcVj8tmM6Fb2qTuJoL_3m2rFy-eZhie94V5CDmjcE2BipsXypTOaaHEJcAVACiW6z0yokoWuQSh99P-ixySoxgXCSrLQo3I6TTY9TyLfRhcPwTMfJv1c8zesTomB41dRjz5mWPy9nD_OnnMZ8_Tp8ndLHdlqfrcqtoKoBXWTIG0omCCU6jSsa6s47UEaMrGJpgqW1mOnFWsQSUYY5BybEwudr3r0H0MGHuz8tHhcmlb7IZouOSUlpr-CxaSs0KATuD5H3DRDaFNTxiqtZBSCkgQ30EudDEGbMw6-JUNX4aC2Xg1W69mI80AmK1Xsym_3eUwOfn0GEx0HluHtQ_oelN3_p-Gb4WmfJI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>199677760</pqid></control><display><type>article</type><title>Graph structure in the Web</title><source>Elsevier ScienceDirect Journals</source><creator>Broder, Andrei ; Kumar, Ravi ; Maghoul, Farzin ; Raghavan, Prabhakar ; Rajagopalan, Sridhar ; Stata, Raymie ; Tomkins, Andrew ; Wiener, Janet</creator><creatorcontrib>Broder, Andrei ; Kumar, Ravi ; Maghoul, Farzin ; Raghavan, Prabhakar ; Rajagopalan, Sridhar ; Stata, Raymie ; Tomkins, Andrew ; Wiener, Janet</creatorcontrib><description>The study of the Web as a graph is not only fascinating in its own right, but also yields valuable insight into Web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution. We report on experiments on local and global properties of the Web graph using two AltaVista crawls each with over 200 million pages and 1.5 billion links. Our study indicates that the macroscopic structure of the Web is considerably more intricate than suggested by earlier experiments on a smaller scale.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/S1389-1286(00)00083-9</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Diameter ; Graph structure ; Graphs ; Measurement ; Searching ; Studies ; Web crawlers ; Web measurement ; World Wide Web</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2000-06, Vol.33 (1-6), p.309-320</ispartof><rights>2000</rights><rights>Copyright Elsevier Sequoia S.A. Jun 2000</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c448t-a8da601bed3807a6236510bda6dbac5d700f4fac4418aba5e53b3fe86333001b3</citedby><cites>FETCH-LOGICAL-c448t-a8da601bed3807a6236510bda6dbac5d700f4fac4418aba5e53b3fe86333001b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S1389128600000839$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids></links><search><creatorcontrib>Broder, Andrei</creatorcontrib><creatorcontrib>Kumar, Ravi</creatorcontrib><creatorcontrib>Maghoul, Farzin</creatorcontrib><creatorcontrib>Raghavan, Prabhakar</creatorcontrib><creatorcontrib>Rajagopalan, Sridhar</creatorcontrib><creatorcontrib>Stata, Raymie</creatorcontrib><creatorcontrib>Tomkins, Andrew</creatorcontrib><creatorcontrib>Wiener, Janet</creatorcontrib><title>Graph structure in the Web</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>The study of the Web as a graph is not only fascinating in its own right, but also yields valuable insight into Web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution. We report on experiments on local and global properties of the Web graph using two AltaVista crawls each with over 200 million pages and 1.5 billion links. Our study indicates that the macroscopic structure of the Web is considerably more intricate than suggested by earlier experiments on a smaller scale.</description><subject>Diameter</subject><subject>Graph structure</subject><subject>Graphs</subject><subject>Measurement</subject><subject>Searching</subject><subject>Studies</subject><subject>Web crawlers</subject><subject>Web measurement</subject><subject>World Wide Web</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><recordid>eNqFkE1Lw0AQhhdRsFb_gCAED6KH6Gw2-3USKVqFggcVj8tmM6Fb2qTuJoL_3m2rFy-eZhie94V5CDmjcE2BipsXypTOaaHEJcAVACiW6z0yokoWuQSh99P-ixySoxgXCSrLQo3I6TTY9TyLfRhcPwTMfJv1c8zesTomB41dRjz5mWPy9nD_OnnMZ8_Tp8ndLHdlqfrcqtoKoBXWTIG0omCCU6jSsa6s47UEaMrGJpgqW1mOnFWsQSUYY5BybEwudr3r0H0MGHuz8tHhcmlb7IZouOSUlpr-CxaSs0KATuD5H3DRDaFNTxiqtZBSCkgQ30EudDEGbMw6-JUNX4aC2Xg1W69mI80AmK1Xsym_3eUwOfn0GEx0HluHtQ_oelN3_p-Gb4WmfJI</recordid><startdate>20000601</startdate><enddate>20000601</enddate><creator>Broder, Andrei</creator><creator>Kumar, Ravi</creator><creator>Maghoul, Farzin</creator><creator>Raghavan, Prabhakar</creator><creator>Rajagopalan, Sridhar</creator><creator>Stata, Raymie</creator><creator>Tomkins, Andrew</creator><creator>Wiener, Janet</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20000601</creationdate><title>Graph structure in the Web</title><author>Broder, Andrei ; Kumar, Ravi ; Maghoul, Farzin ; Raghavan, Prabhakar ; Rajagopalan, Sridhar ; Stata, Raymie ; Tomkins, Andrew ; Wiener, Janet</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c448t-a8da601bed3807a6236510bda6dbac5d700f4fac4418aba5e53b3fe86333001b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Diameter</topic><topic>Graph structure</topic><topic>Graphs</topic><topic>Measurement</topic><topic>Searching</topic><topic>Studies</topic><topic>Web crawlers</topic><topic>Web measurement</topic><topic>World Wide Web</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Broder, Andrei</creatorcontrib><creatorcontrib>Kumar, Ravi</creatorcontrib><creatorcontrib>Maghoul, Farzin</creatorcontrib><creatorcontrib>Raghavan, Prabhakar</creatorcontrib><creatorcontrib>Rajagopalan, Sridhar</creatorcontrib><creatorcontrib>Stata, Raymie</creatorcontrib><creatorcontrib>Tomkins, Andrew</creatorcontrib><creatorcontrib>Wiener, Janet</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Broder, Andrei</au><au>Kumar, Ravi</au><au>Maghoul, Farzin</au><au>Raghavan, Prabhakar</au><au>Rajagopalan, Sridhar</au><au>Stata, Raymie</au><au>Tomkins, Andrew</au><au>Wiener, Janet</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Graph structure in the Web</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2000-06-01</date><risdate>2000</risdate><volume>33</volume><issue>1-6</issue><spage>309</spage><epage>320</epage><pages>309-320</pages><issn>1389-1286</issn><eissn>1872-7069</eissn><abstract>The study of the Web as a graph is not only fascinating in its own right, but also yields valuable insight into Web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution. We report on experiments on local and global properties of the Web graph using two AltaVista crawls each with over 200 million pages and 1.5 billion links. Our study indicates that the macroscopic structure of the Web is considerably more intricate than suggested by earlier experiments on a smaller scale.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S1389-1286(00)00083-9</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1389-1286 |
| ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2000-06, Vol.33 (1-6), p.309-320 |
| issn | 1389-1286 1872-7069 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_57511491 |
| source | Elsevier ScienceDirect Journals |
| subjects | Diameter Graph structure Graphs Measurement Searching Studies Web crawlers Web measurement World Wide Web |
| title | Graph structure in the Web |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T16%3A51%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Graph%20structure%20in%20the%20Web&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Broder,%20Andrei&rft.date=2000-06-01&rft.volume=33&rft.issue=1-6&rft.spage=309&rft.epage=320&rft.pages=309-320&rft.issn=1389-1286&rft.eissn=1872-7069&rft_id=info:doi/10.1016/S1389-1286(00)00083-9&rft_dat=%3Cproquest_cross%3E55328325%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=199677760&rft_id=info:pmid/&rft_els_id=S1389128600000839&rfr_iscdi=true |