%0 Journal Article %1 bharat1998connectivity %A Bharat, K. %A Broder, A. %A Henzinger, M. %A Kumar, P. %A Venkatasubramanian, S. %D 1998 %J Computer Networks and ISDN Systems %K technology, web-graph %N 1 %P 469--477 %T The Connectivity Server: fast access to linkage information on the Web %U http://www.ingentaconnect.com/content/els/01697552/1998/00000030/00000001/art80047 %V 30 %X We have built a server that provides linkage information for all pages indexed by the AltaVista search engine. In its basic operation, the server accepts a query consisting of a set L of one or more URLs and returns a list of all pages that point to pages in L (predecessors) and a list of all pages that are pointed to from pages in L (successors). More generally the server can produce the entire neighbourhood (in the graph theory sense) of L up to a given distance and can include information about all links that exist among pages in the neighbourhood.Although some of this information can be retrieved directly from Alta Vista or other search engines, these engines are not optimized for this purpose and the process of constructing the neighbourhood of a given set of pages is slow and laborious. In contrast our prototype server needs less than 0.1 ms per result URL.So far we have built two applications that use the Connectivity Server: a direct interface that permits fast navigation of the Web via the predecessor/successor relation, and a visualization tool for the neighbourhood of a given set of pages. We envisage numerous other applications such as ranking, visualization, and classification.

@article{bharat1998connectivity, abstract = {We have built a server that provides linkage information for all pages indexed by the AltaVista search engine. In its basic operation, the server accepts a query consisting of a set L of one or more URLs and returns a list of all pages that point to pages in L (predecessors) and a list of all pages that are pointed to from pages in L (successors). More generally the server can produce the entire neighbourhood (in the graph theory sense) of L up to a given distance and can include information about all links that exist among pages in the neighbourhood.Although some of this information can be retrieved directly from Alta Vista or other search engines, these engines are not optimized for this purpose and the process of constructing the neighbourhood of a given set of pages is slow and laborious. In contrast our prototype server needs less than 0.1 ms per result URL.So far we have built two applications that use the Connectivity Server: a direct interface that permits fast navigation of the Web via the predecessor/successor relation, and a visualization tool for the neighbourhood of a given set of pages. We envisage numerous other applications such as ranking, visualization, and classification.}, added-at = {2009-08-06T15:16:38.000+0200}, author = {Bharat, K. and Broder, A. and Henzinger, M. and Kumar, P. and Venkatasubramanian, S.}, biburl = {https://www.bibsonomy.org/bibtex/2736e358fb46440c3ff410948713de83f/chato}, citeulike-article-id = {1413098}, citeulike-linkout-0 = {http://www.ingentaconnect.com/content/els/01697552/1998/00000030/00000001/art80047}, interhash = {63e1c896820079151ab9074c65bab568}, intrahash = {736e358fb46440c3ff410948713de83f}, journal = {Computer Networks and ISDN Systems}, keywords = {technology, web-graph}, month = {April}, number = 1, pages = {469--477}, posted-at = {2007-06-26 10:31:53}, priority = {0}, timestamp = {2009-08-06T15:16:47.000+0200}, title = {The Connectivity Server: fast access to linkage information on the Web}, url = {http://www.ingentaconnect.com/content/els/01697552/1998/00000030/00000001/art80047}, volume = 30, year = 1998 }