{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:22Z","timestamp":1750220722527,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"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":[[2020,6,14]]},"DOI":"10.1145\/3398682.3399164","type":"proceedings-article","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T19:25:57Z","timestamp":1591730757000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["ELite"],"prefix":"10.1145","author":[{"given":"Xiaofei","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Memphis"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[{"name":"HKUST"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465355"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_1_3_1","unstructured":"Apache 2017. Apache Giraph. http:\/\/giraph.apache.org.  Apache 2017. Apache Giraph. http:\/\/giraph.apache.org."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/1929861.1929864"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/080737174"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1839490.1839494"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755591"},{"key":"e_1_3_2_1_8_1","volume-title":"MapReduce Online. In Proc. 7th USENIX Symp. on Networked Systems Design & Implementation. USENIX Association, 21--21","author":"Condie Tyson","year":"2010","unstructured":"Tyson Condie , Neil Conway , Peter Alvaro , Joseph M. Hellerstein , Khaled Elmeleegy , and Russell Sears . 2010 . MapReduce Online. In Proc. 7th USENIX Symp. on Networked Systems Design & Implementation. USENIX Association, 21--21 . Tyson Condie, Neil Conway, Peter Alvaro, Joseph M. Hellerstein, Khaled Elmeleegy, and Russell Sears. 2010. MapReduce Online. In Proc. 7th USENIX Symp. on Networked Systems Design & Implementation. USENIX Association, 21--21."},{"key":"e_1_3_2_1_9_1","article-title":"Approximate graph clustering for program characterization","volume":"8","author":"Demme John","year":"2012","unstructured":"John Demme and Simha Sethumadhavan . 2012 . Approximate graph clustering for program characterization . ACM Trans. Architecture and Code Optimizaiton 8 , 4 (2012), 21:1-21:21. John Demme and Simha Sethumadhavan. 2012. Approximate graph clustering for program characterization. ACM Trans. Architecture and Code Optimizaiton 8, 4 (2012), 21:1-21:21.","journal-title":"ACM Trans. Architecture and Code Optimizaiton"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796308217"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993647"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129128"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. 10th USENIX Symp. on Operating System Design and Implementation. 17--30","author":"Gonzalez Joseph E.","year":"2012","unstructured":"Joseph E. Gonzalez , Yucheng Low , Haijie Gu , Danny Bickson , and Carlos Guestrin . 2012 . PowerGraph: Distributed Graph-parallel Computation on Natural Graphs . In Proc. 10th USENIX Symp. on Operating System Design and Implementation. 17--30 . Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-parallel Computation on Natural Graphs. In Proc. 10th USENIX Symp. on Operating System Design and Implementation. 17--30."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732980"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850580"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"volume-title":"Probability theory: The logic of science","author":"Jaynes E. T.","key":"e_1_3_2_1_18_1","unstructured":"E. T. Jaynes . 2003. Probability theory: The logic of science . Cambridge University Press . E. T. Jaynes. 2003. Probability theory: The logic of science. Cambridge University Press."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2907294.2907312"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336675"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.80"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_1_24_1","unstructured":"M. E. J. Newman D. J. Watts and S. H. Strogatz. 2002. Random graph models of social networks. In (Sackler NAS Colloquium) Self-Organized Complexity in the Physical Biological and Social Sciences. National Academy of Sciences 2566--2573.  M. E. J. Newman D. J. Watts and S. H. Strogatz. 2002. Random graph models of social networks. In (Sackler NAS Colloquium) Self-Organized Complexity in the Physical Biological and Social Sciences. National Academy of Sciences 2566--2573."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775059"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544813"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488673"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.57"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164139"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732294"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733090"},{"key":"e_1_3_2_1_33_1","volume-title":"Shortest-path queries in static networks. ACM Comput. Surv. 46, 4","author":"Sommer Christian","year":"2014","unstructured":"Christian Sommer . 2014. Shortest-path queries in static networks. ACM Comput. Surv. 46, 4 ( 2014 ), 45:1-45:31. Christian Sommer. 2014. Shortest-path queries in static networks. ACM Comput. Surv. 46, 4 (2014), 45:1-45:31."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380798"},{"key":"e_1_3_2_1_35_1","volume-title":"Proc. USENIX 2015 Annual Technical Conf. 387--401","author":"Wang Kai","year":"2015","unstructured":"Kai Wang , Guoqing (Harry) Xu , Zhendong Su , and Yu David Liu . 2015 . GraphQ: Graph Query Processing with Abstraction Refinement - Scalable and Programmable Analytics over Very Large Graphs on a Single PC . In Proc. USENIX 2015 Annual Technical Conf. 387--401 . Kai Wang, Guoqing (Harry) Xu, Zhendong Su, and Yu David Liu. 2015. GraphQ: Graph Query Processing with Abstraction Refinement - Scalable and Programmable Analytics over Very Large Graphs on a Single PC. In Proc. USENIX 2015 Annual Technical Conf. 387--401."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.133"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland OR USA","acronym":"SIGMOD\/PODS '20"},"container-title":["Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398682.3399164","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3398682.3399164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:31Z","timestamp":1750199611000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398682.3399164"}},"subtitle":["Cost-effective Approximation of Exploration-based Graph Analysis"],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":37,"alternative-id":["10.1145\/3398682.3399164","10.1145\/3398682"],"URL":"https:\/\/doi.org\/10.1145\/3398682.3399164","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}