{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T21:38:10Z","timestamp":1792964290607,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,9]]},"DOI":"10.1145\/1376616.1376661","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T10:13:22Z","timestamp":1213092802000},"page":"419-432","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":252,"title":["Graph summarization with bounded error"],"prefix":"10.1145","author":[{"given":"Saket","family":"Navlakha","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajeev","family":"Rastogi","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nisheeth","family":"Shrivastava","sequence":"additional","affiliation":[{"name":"Bell Labs Research, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/882454.875027"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502415960"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_4_1","first-page":"107","volume-title":"WWW","author":"Brin S.","year":"1998","unstructured":"S. Brin and L. Page . The anatomy of a large-scale hypertextual web search engine . In WWW , pages 107 -- 117 , 1998 .]] S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In WWW, pages 107--117, 1998.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1053072.1053085"},{"key":"e_1_3_2_1_6_1","first-page":"111","volume-title":"VLDB","author":"Chakrabarti K.","year":"2000","unstructured":"K. Chakrabarti , M. N. Garofalakis , R. Rastogi , and K. Shim . Approximate query processing using wavelets . In VLDB , pages 111 -- 122 , 2000 .]] K. Chakrabarti, M. N. Garofalakis, R. Rastogi, and K. Shim. Approximate query processing using wavelets. In VLDB, pages 111--122, 2000.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872838"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081948"},{"key":"e_1_3_2_1_9_1","volume-title":"Algorithms for Clustering Data","author":"Dubes R. C.","year":"1988","unstructured":"R. C. Dubes and A. K. Jain . Algorithms for Clustering Data . Prentice Hall , 1988 .]] R. C. Dubes and A. K. Jain. Algorithms for Clustering Data. Prentice Hall, 1988.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808776"},{"key":"e_1_3_2_1_11_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W.H. Freeman , 1979 .]] M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.]]"},{"key":"e_1_3_2_1_12_1","first-page":"721","volume-title":"VLDB","author":"Gibson D.","year":"2005","unstructured":"D. Gibson , R. Kumar , and A. Tomkins . Discovering large dense subgraphs in massive graphs . In VLDB , pages 721 -- 732 , 2005 .]] D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, pages 721--732, 2005.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253291"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298349"},{"key":"e_1_3_2_1_15_1","first-page":"174","volume-title":"VLDB","author":"Ioannidis Y. E.","year":"1999","unstructured":"Y. E. Ioannidis and V. Poosala . Histogram-based approximation of set-valued query-answers . In VLDB , pages 174 -- 185 , 1999 .]] Y. E. Ioannidis and V. Poosala. Histogram-based approximation of set-valued query-answers. In VLDB, pages 174--185, 1999.]]"},{"key":"e_1_3_2_1_16_1","first-page":"186","volume-title":"VLDB","author":"Jagadish H. V.","year":"1999","unstructured":"H. V. Jagadish , J. Madar , and R. T. Ng . Semantic compression and pattern extraction with fascicles . In VLDB , pages 186 -- 198 , 1999 .]] H. V. Jagadish, J. Madar, and R. T. Ng. Semantic compression and pattern extraction with fascicles. In VLDB, pages 186--198, 1999.]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879023"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_20_1","first-page":"639","volume-title":"VLDB","author":"Kumar R.","year":"1999","unstructured":"R. Kumar , P. Raghavan , S. Rajagopalan , and A. Tomkins . Extracting large-scale knowledge bases from the web . In VLDB , pages 639 -- 650 , 1999 .]] R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large-scale knowledge bases from the web. In VLDB, pages 639--650, 1999.]]"},{"key":"e_1_3_2_1_21_1","first-page":"1481","volume-title":"WWW","author":"Kumar R.","year":"1999","unstructured":"R. Kumar , P. Raghavan , S. Rajagopalan , and A. Tomkins . Trawling the web for emerging cyber-communities . In WWW , pages 1481 -- 1493 , 1999 .]] R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cyber-communities. In WWW, pages 1481--1493, 1999.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287435"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656266"},{"key":"e_1_3_2_1_24_1","first-page":"849","volume-title":"NIPS","author":"Ng A. Y.","year":"2001","unstructured":"A. Y. Ng , M. I. Jordan , and Y. Weiss . On spectral clustering: Analysis and an algorithm . In NIPS , pages 849 -- 856 , 2001 .]] A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, pages 849--856, 2001.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166082"},{"key":"e_1_3_2_1_26_1","first-page":"405","volume-title":"ICDE","author":"Raghavan S.","year":"2003","unstructured":"S. Raghavan and H. Garcia-Molina . Representing web graphs . In ICDE , pages 405 -- 416 , 2003 .]] S. Raghavan and H. Garcia-Molina. Representing web graphs. In ICDE, pages 405--416, 2003.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/882455.874988"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.1239303"},{"key":"e_1_3_2_1_30_1","first-page":"213","volume-title":"Data Compression Conference","author":"Suel T.","year":"2001","unstructured":"T. Suel and J. Yuan . Compressing the graph structure of the web . In Data Compression Conference , pages 213 -- 222 , 2001 .]] T. Suel and J. Yuan. Compressing the graph structure of the web. In Data Compression Conference, pages 213--222, 2001.]]"},{"key":"e_1_3_2_1_31_1","first-page":"15","volume-title":"USENIX Annual Technical Conference, General Track","author":"Tan G.","year":"2003","unstructured":"G. Tan , M. Poletto , J. V. Guttag , and M. F. Kaashoek . Role classification of hosts within enterprise networks based on connection patterns . In USENIX Annual Technical Conference, General Track , pages 15 -- 28 , 2003 .]] G. Tan, M. Poletto, J. V. Guttag, and M. F. Kaashoek. Role classification of hosts within enterprise networks based on connection patterns. In USENIX Annual Technical Conference, General Track, pages 15--28, 2003.]]"}],"event":{"name":"SIGMOD\/PODS '08: SIGMOD\/PODS '08 - International Conference on Management of Data","location":"Vancouver Canada","acronym":"SIGMOD\/PODS '08","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2008 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376661","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1376616.1376661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:58:00Z","timestamp":1750240680000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376661"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":31,"alternative-id":["10.1145\/1376616.1376661","10.1145\/1376616"],"URL":"https:\/\/doi.org\/10.1145\/1376616.1376661","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}