01809nas a2200217   4500008004100000245008200041210006900123260000900192300001400201490000600215520109000221653002601311653003401337653002001371653001501391100001501406700001401421700001501435700002401450856011701474       2007                        eng d00aPre-processing and Path Normalization of a web graph used as a social network0 aPreprocessing and Path Normalization of a web graph used as a so  c2007  a262 - 2760 v53 aMany efforts have been made for compression of web graphs. Most of these methods are suitable for search engines and are centered around encoding links and URLs efficiently. The purpose is to handle a large set of web pages in the main memory against any web based search. The authors of the present paper are interested in studying web graph as a social network and to develop a data model for it. So, suitable compression techniques, which are space efficient for disk based storage, are required. This paper has provided a two level compression technique. In the first level, the structural properties of a graph are studied and strongly connected components are fused to reduce the original graph to a DAG. Paths on this DAG are then stored efficiently using a Path Normalization technique. Space complexity expressions indicate the efficiency of the method. Relevant operators required for accessing the original graph through the compressed representations have also been discussed. Important earlier works have been referred to indicate the requirements of the present approach.10aCompression technique10aPath normailisation technique10aSocial software10aWeb search1 aTeja, C.B.1 aMitra, S.1 aBagchi, A.1 aBandyopadhyay, A.K.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-57949092373&partnerID=40&md5=08a3428b63ad14c630820944a0e9c222