{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:35Z","timestamp":1773481955856,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,9]],"date-time":"2017-05-09T00:00:00Z","timestamp":1494288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Samsung Research Funding Center of Samsung Electronics","award":["SRFC-IT1401-04"],"award-info":[{"award-number":["SRFC-IT1401-04"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,9]]},"DOI":"10.1145\/3035918.3064014","type":"proceedings-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:09:00Z","timestamp":1494439740000},"page":"913-928","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["TrillionG"],"prefix":"10.1145","author":[{"given":"Himchan","family":"Park","sequence":"first","affiliation":[{"name":"Daegu Gyeongbuk Institute of Science and Technology, Daegu, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Soo","family":"Kim","sequence":"additional","affiliation":[{"name":"Daegu Gyeongbuk Institute of Science and Technology, Daegu, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Amazon S3. https:\/\/aws.amazon.com\/s3.  Amazon S3. https:\/\/aws.amazon.com\/s3."},{"key":"e_1_3_2_1_2_1","unstructured":"Apache HBase. http:\/\/hbase.apache.org\/.  Apache HBase. http:\/\/hbase.apache.org\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Apache Spark. http:\/\/spark.apache.org\/.  Apache Spark. http:\/\/spark.apache.org\/."},{"key":"e_1_3_2_1_4_1","unstructured":"Graph500 benchmark. http:\/\/www.graph500.org\/.  Graph500 benchmark. http:\/\/www.graph500.org\/."},{"key":"e_1_3_2_1_5_1","unstructured":"Hadoop implementation of RMAT-WES\/P. https:\/\/github.com\/paulmw\/rmat.  Hadoop implementation of RMAT-WES\/P. https:\/\/github.com\/paulmw\/rmat."},{"key":"e_1_3_2_1_6_1","unstructured":"Human Connectome Project. http:\/\/www.humanconnectomeproject.org\/.  Human Connectome Project. http:\/\/www.humanconnectomeproject.org\/."},{"key":"e_1_3_2_1_7_1","unstructured":"Rich Data and the Increasing Value of the Internet of Things. http:\/\/www.emc.com\/leadership\/digital-universe\/2014iview\/internet-of-things.htm.  Rich Data and the Increasing Value of the Internet of Things. http:\/\/www.emc.com\/leadership\/digital-universe\/2014iview\/internet-of-things.htm."},{"key":"e_1_3_2_1_8_1","unstructured":"Stanford Network Analysis Project. http:\/\/snap.stanford.edu\/.  Stanford Network Analysis Project. http:\/\/snap.stanford.edu\/."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11964-9_13"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2633993"},{"key":"e_1_3_2_1_11_1","volume-title":"Emergence of scaling in random networks. science, 286(5439):509--512","author":"Barab\u00e1si A.-L.","year":"1999","unstructured":"A.-L. Barab\u00e1si and R. Albert . Emergence of scaling in random networks. science, 286(5439):509--512 , 1999 . A.-L. Barab\u00e1si and R. Albert. Emergence of scaling in random networks. science, 286(5439):509--512, 1999."},{"key":"e_1_3_2_1_12_1","first-page":"21","article-title":"The Hadoop distributed file system: Architecture and design","volume":"11","author":"Borthakur D.","year":"2007","unstructured":"D. Borthakur . The Hadoop distributed file system: Architecture and design . Hadoop Project Website , 11 (2007): 21 , 2007 . D. Borthakur. The Hadoop distributed file system: Architecture and design. Hadoop Project Website, 11(2007):21, 2007.","journal-title":"Hadoop Project Website"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2015.96"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.52"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2013.07.014"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"e_1_3_2_1_22_1","first-page":"599","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2014","unstructured":"J. E. Gonzalez , R. S. Xin , A. Dave , D. Crankshaw , M. J. Franklin , and I. Stoica . GraphX: Graph processing in a distributed dataflow framework . In OSDI , pages 599 -- 613 , 2014 . J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica. GraphX: Graph processing in a distributed dataflow framework. In OSDI, pages 599--613, 2014."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882964"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915204"},{"key":"e_1_3_2_1_26_1","first-page":"71","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","author":"Kumar P.","unstructured":"P. Kumar and H. H. Huang . G-store: high-performance graph store for trillion-edge processing . In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis , page 71 . IEEE Press, 2016. P. Kumar and H. H. Huang. G-store: high-performance graph store for trillion-edge processing. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, page 71. IEEE Press, 2016."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564126_17"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756039"},{"key":"e_1_3_2_1_29_1","volume-title":"Synthetic Graph Generation for Data-Intensive HPC Benchmarking: Background and Framework","author":"Lothian J.","year":"2013","unstructured":"J. Lothian , S. Powers , B. D. Sullivan , M. Baker , J. Schrock , and S. W. Poole . Synthetic Graph Generation for Data-Intensive HPC Benchmarking: Background and Framework . 2013 . J. Lothian, S. Powers, B. D. Sullivan, M. Baker, J. Schrock, and S. W. Poole. Synthetic Graph Generation for Data-Intensive HPC Benchmarking: Background and Framework. 2013."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213844"},{"key":"e_1_3_2_1_31_1","first-page":"156","volume-title":"Technology Conference on Performance Evaluation and Benchmarking","author":"Pham M.-D.","year":"2012","unstructured":"M.-D. Pham , P. Boncz , and O. Erling . S3G2: A scalable structure-correlated social graph generator . In Technology Conference on Performance Evaluation and Benchmarking , pages 156 -- 172 . Springer , 2012 . M.-D. Pham, P. Boncz, and O. Erling. S3G2: A scalable structure-correlated social graph generator. In Technology Conference on Performance Evaluation and Benchmarking, pages 156--172. Springer, 2012."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452427"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.28"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.23"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"e_1_3_2_1_37_1","volume-title":"Networkit: An interactive tool suite for high-performance network analysis. arXiv preprint arXiv:1403.3005","author":"Staudt C. L.","year":"2014","unstructured":"C. L. Staudt , A. Sazonovs , and H. Meyerhenke . Networkit: An interactive tool suite for high-performance network analysis. arXiv preprint arXiv:1403.3005 , 2014 . C. L. Staudt, A. Sazonovs, and H. Meyerhenke. Networkit: An interactive tool suite for high-performance network analysis. arXiv preprint arXiv:1403.3005, 2014."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806849"},{"key":"e_1_3_2_1_39_1","first-page":"53","volume-title":"EDBT","author":"Zhang J.","year":"2016","unstructured":"J. Zhang and Y. Tay . GSCALER: Synthetically scaling a given graph . In EDBT , pages 53 -- 64 , 2016 . J. Zhang and Y. Tay. GSCALER: Synthetically scaling a given graph. In EDBT, pages 53--64, 2016."},{"key":"e_1_3_2_1_40_1","unstructured":"G. K. Zipf. Human behavior and the principle of least effort: An introduction to human ecology. 2016  G. K. Zipf. Human behavior and the principle of least effort: An introduction to human ecology. 2016"}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","location":"Chicago Illinois USA","acronym":"SIGMOD\/PODS'17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2017 ACM International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3064014","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3064014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:41Z","timestamp":1750217801000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3064014"}},"subtitle":["A Trillion-scale Synthetic Graph Generator using a Recursive Vector Model"],"short-title":[],"issued":{"date-parts":[[2017,5,9]]},"references-count":40,"alternative-id":["10.1145\/3035918.3064014","10.1145\/3035918"],"URL":"https:\/\/doi.org\/10.1145\/3035918.3064014","relation":{},"subject":[],"published":{"date-parts":[[2017,5,9]]},"assertion":[{"value":"2017-05-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}