{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,2]],"date-time":"2026-08-02T23:47:35Z","timestamp":1785714455681,"version":"3.56.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T00:00:00Z","timestamp":1275955200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s10115-010-0305-0","type":"journal-article","created":{"date-parts":[[2010,6,7]],"date-time":"2010-06-07T11:45:26Z","timestamp":1275911126000},"page":"303-325","source":"Crossref","is-referenced-by-count":118,"title":["PEGASUS: mining peta-scale graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"U","family":"Kang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charalampos E.","family":"Tsourakakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,6,8]]},"reference":[{"key":"305_CR1","unstructured":"Aggarwal G, Data M, Rajagopalan S, Ruhl M (2004) On the streaming model augmented with a sorting primitive. In: Proceedings of FOCS"},{"key":"305_CR2","unstructured":"Awerbuch B, Shiloach A (1983) New Connectivity and MSF Algorithms for Ultracomputer and PRAM. In: ICPP"},{"key":"305_CR3","doi-asserted-by":"crossref","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual (Web) search engine. In: WWW","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"305_CR4","doi-asserted-by":"crossref","unstructured":"Broder A, Kumar R, Maghoul F, Prabhakar R, Rajagopalan S, Stata R, Tomkins A, Wiener J (2000) Graph structure in the Web. In: Computer Networks 33","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"305_CR5","doi-asserted-by":"crossref","unstructured":"Chaiken R, Jenkins B, Larson P, Ramsey B, Shakib D, Weaver S, Zhou J (2008) SCOPE: easy and efficient parallel processing of massive data sets. In VLDB","DOI":"10.14778\/1454159.1454166"},{"key":"305_CR6","doi-asserted-by":"crossref","unstructured":"Chen C, Yan X, Zhu F, Han J (2007) gApprox: mining frequent approximate patterns from a massive network. In: IEEE international conference on data mining","DOI":"10.1109\/ICDM.2007.36"},{"key":"305_CR7","doi-asserted-by":"crossref","unstructured":"Chen J, Zaiane O, Goebel R (2009) Detecting communities in social networks using max-\u00a0min modularity. In: SIAM international conference on data mining","DOI":"10.1137\/1.9781611972795.84"},{"key":"305_CR8","doi-asserted-by":"crossref","unstructured":"Cheng J, Yu J, Ding B, Yu P, Wang H (2008) Fast graph pattern matching. In: ICDE","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"305_CR9","unstructured":"Dean J, Ghemawat S (2004) MapReduce: simplified data processing on large clusters. In: OSDI"},{"key":"305_CR10","unstructured":"Dunbar R (1998) Grooming, gossip, and the evolution of language. Harvard University Press"},{"key":"305_CR11","doi-asserted-by":"crossref","unstructured":"Falkowski T, Barth A, Spiliopoulou M (2007) DENGRAPH: a density-based community detection algorithm. In: Web intelligence","DOI":"10.1109\/WI.2007.74"},{"key":"305_CR12","doi-asserted-by":"crossref","unstructured":"Greiner J (1994) A comparison of parallel algorithms for connected components. In: Proceedings of the 6th ACM symposium on parallel algorithms and architectures","DOI":"10.1145\/181014.181021"},{"key":"305_CR13","doi-asserted-by":"crossref","unstructured":"Grossman R, Gu Y (2008) Data mining using high performance data clouds: experimental studies using sector and sphere. In: ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1401890.1402000"},{"key":"305_CR14","doi-asserted-by":"crossref","unstructured":"Hintsanen P, Toivonen H (2008) Finding reliable subgraphs from large probabilistic graphs. In: PKDD","DOI":"10.1007\/s10618-008-0106-1"},{"key":"305_CR15","doi-asserted-by":"crossref","unstructured":"Hirschberg D, Chandra A, Sarwate D (1979) Computing connected components on parallel computers. In: Communications of the ACM","DOI":"10.1145\/359138.359141"},{"key":"305_CR16","doi-asserted-by":"crossref","unstructured":"Kang U, Tsourakakis C, Faloutsos C (2009) PEGASUS: a peta-scale graph mining system\u2014implementation and observations. In: IEEE international conference on data mining","DOI":"10.1109\/ICDM.2009.14"},{"key":"305_CR17","doi-asserted-by":"crossref","unstructured":"Kang U, Tsourakakis C, Appel A, Faloutsos C, Leskovec J (2010) Radius plots for mining tera-byte scale graphs: algorithms, patterns, and observations. In: SIAM international conference on data mining","DOI":"10.1137\/1.9781611972801.48"},{"key":"305_CR18","doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (1999) Parallel multilevel k-way partitioning for irregular graphs. In: SIAM Review","DOI":"10.1145\/309847.309954"},{"key":"305_CR19","doi-asserted-by":"crossref","unstructured":"Ke Y, Cheng J, Yu J (2009) Top-k correlative graph mining. In: SIAM international conference on data mining","DOI":"10.1137\/1.9781611972795.89"},{"key":"305_CR20","doi-asserted-by":"crossref","unstructured":"Ketkar N, Holder L, Cook D (2005) Subdue: compression-based frequent pattern discovery in graph data. In: OSDM","DOI":"10.1145\/1133905.1133915"},{"key":"305_CR21","unstructured":"Kleinberg J (1998) Authoritative sources in a hyperlinked environment. In: Proceedings of the 9th ACM-SIAM SODA"},{"key":"305_CR22","doi-asserted-by":"crossref","unstructured":"Kolda T, Sun J (2008) Scalable tensor decompositions for multi-aspect data mining. In: IEEE international conference on data mining","DOI":"10.1109\/ICDM.2008.89"},{"key":"305_CR23","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2004) Finding frequent patterns in a large sparse graph. In: SIAM data mining conference","DOI":"10.1137\/1.9781611972740.32"},{"key":"305_CR24","doi-asserted-by":"crossref","unstructured":"Lahiri M, Berger-Wolf T (2010) Periodic subgraph mining in dynamic networks. In: Knowledge and information systems (KAIS). doi: 10.1007\/s10115-009-0253-8","DOI":"10.1007\/s10115-009-0253-8"},{"key":"305_CR25","doi-asserted-by":"crossref","unstructured":"Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C (2005) Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication. In: practice of knowledge discovery in databases (PKDD)","DOI":"10.1007\/11564126_17"},{"key":"305_CR26","doi-asserted-by":"crossref","unstructured":"Long B, Zhang Z, Yu P (2010) A general framework for relation graph clustering. In: Knowledge and information systems (KAIS). doi: 10.1007\/s10115-009-0255-6","DOI":"10.1007\/s10115-009-0255-6"},{"key":"305_CR27","doi-asserted-by":"crossref","unstructured":"McGlohon M, Akoglu L, Faloutsos C(2008) Weighted graphs and disconnected components: patterns and a generator. In: ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1401890.1401955"},{"key":"305_CR28","doi-asserted-by":"crossref","unstructured":"Narasimhamurthy A, Greene D, Hurley N, Cunningham P (2010) Partitioning large networks without breaking communities. In: Knowledge and information systems (KAIS). doi: 10.1007\/s10115-009-0251-x","DOI":"10.1007\/s10115-009-0251-x"},{"key":"305_CR29","doi-asserted-by":"crossref","unstructured":"Newman M (2005) Power laws, Pareto distributions and Zipf\u2019s law. In: Contemporary Physics","DOI":"10.1080\/00107510500052444"},{"key":"305_CR30","doi-asserted-by":"crossref","unstructured":"Olston C, Reed B, Srivastava U, Kumar R, Tomkins A (2008) Pig latin: a not-so-foreign language for data processing. In: SIGMOD","DOI":"10.1145\/1376616.1376726"},{"key":"305_CR31","doi-asserted-by":"crossref","unstructured":"Pan J, Yang H, Faloutsos C, Duygulu P (2004) Automatic multimedia cross-modal correlation discovery. In: ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1014052.1014135"},{"key":"305_CR32","doi-asserted-by":"crossref","unstructured":"Pandurangan G, Raghavan P, Upfal E (2002) Using pagerank to characterize web structure. In: COCOON","DOI":"10.1007\/3-540-45655-4_36"},{"key":"305_CR33","doi-asserted-by":"crossref","unstructured":"Papadimitriou S, Sun J (2008) DisCo: distributed co-clustering with map-reduce. In: IEEE international conference on data mining","DOI":"10.1109\/ICDM.2008.142"},{"key":"305_CR34","unstructured":"Peng W, Li T (2010) Temporal relation co-clustering on directional social network and author-topic evolution. In: Knowledge and information systems (KAIS). doi: 10.1007\/s10115-010-0289-92"},{"key":"305_CR35","doi-asserted-by":"crossref","unstructured":"Pike R, Dorward S, Griesemer R, Quinlan S (2005) Interpreting the data: parallel analysis with Sawzall. In: Scientific Programming Journal","DOI":"10.1155\/2005\/962135"},{"key":"305_CR36","doi-asserted-by":"crossref","unstructured":"Qian T, Srivastava J, Peng Z, Sheu P (2009) Simultaneously finding fundamental articles and new topics using a community tracking method. In: PAKDD","DOI":"10.1007\/978-3-642-01307-2_82"},{"key":"305_CR37","unstructured":"Ralf L (2008) Google\u2019s MapReduce programming model\u2014Revisited. In: Science of computer programming"},{"key":"305_CR38","doi-asserted-by":"crossref","unstructured":"Ranu S, Singh A (2009) GraphSig: a scalable approach to mining significant subgraphs in large graph databases. In: ICDE","DOI":"10.1109\/ICDE.2009.133"},{"key":"305_CR39","doi-asserted-by":"crossref","unstructured":"Shiloach Y, Vishkin U (1982) An O(logn) parallel connectivity algorithm. J Algorithm","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"305_CR40","doi-asserted-by":"crossref","unstructured":"Shrivastava N, Majumder A, Rastogi R (2008) Mining (social) network graphs to detect random link attacks. In: ICDE","DOI":"10.1109\/ICDE.2008.4497457"},{"key":"305_CR41","doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Kang U, Miller GL, Faloutsos C (2009) DOULION: counting triangles in massive graphs with a coin. In: Knowledge discovery and data mining (KDD)","DOI":"10.1145\/1557019.1557111"},{"key":"305_CR42","unstructured":"Tsourakakis C, Kolountzakis M, Miller GL (2009) Approximate triangle counting. In: Arxiv 0904.3761"},{"key":"305_CR43","doi-asserted-by":"crossref","unstructured":"Tsourakakis C (2010) Counting triangles in real-world networks using projections. In: Knowledge and information systems (KAIS). doi: 10.1007\/s10115-010-0291-2","DOI":"10.1007\/s10115-010-0291-2"},{"key":"305_CR44","doi-asserted-by":"crossref","unstructured":"Wang C, Wang W, Pei J, Zhu Y, Shi B (2004) Scalable mining of large disk-based graph databases. In: ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1014052.1014088"},{"key":"305_CR45","doi-asserted-by":"crossref","unstructured":"Wang N, Parthasarathy S, Tan K, Tung A (2008) CSV: visualizing and mining cohesive subgraph. In: SIGMOD","DOI":"10.1145\/1376616.1376663"},{"key":"305_CR46","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: IEEE international conference on data mining"},{"key":"305_CR47","unstructured":"Zhu F, Yan X, Han J, Yu P (2007) gPrune: a constraint pushing framework for graph pattern mining. In: PAKDD"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0305-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-010-0305-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0305-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T21:56:06Z","timestamp":1559166966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-010-0305-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,8]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["305"],"URL":"https:\/\/doi.org\/10.1007\/s10115-010-0305-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,8]]}}}