{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:50:14Z","timestamp":1743097814052,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031125966"},{"type":"electronic","value":"9783031125973"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-12597-3_18","type":"book-chapter","created":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T10:02:21Z","timestamp":1659261741000},"page":"285-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GraphGuess: Approximate Graph Processing System with\u00a0Adaptive Correction"],"prefix":"10.1007","author":[{"given":"Morteza","family":"Ramezani","sequence":"first","affiliation":[]},{"given":"Mahmut T.","family":"Kandemir","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Sivasubramaniam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Abraham, I., Durfee, D., Koutis, I., Krinninger, S., Peng, R.: On fully dynamic graph sparsifiers. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 335\u2013344. IEEE (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.44","DOI":"10.1109\/FOCS.2016.44"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/2749469.2750386","volume":"43","author":"J Ahn","year":"2016","unstructured":"Ahn, J., Hong, S., Yoo, S., Mutlu, O., Choi, K.: A scalable processing-in-memory accelerator for parallel graph processing. ACM SIGARCH Comput. Archit. News 43(3), 105\u2013117 (2016). https:\/\/doi.org\/10.1145\/2749469.2750386","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"18_CR3","unstructured":"Bernstein, A., et al.: Fully-dynamic graph sparsifiers against an adaptive adversary. arXiv preprint arXiv:2004.08432 (2020)"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Besta, M., et al.: Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201325 (2019). https:\/\/doi.org\/10.1145\/3295500.3356182","DOI":"10.1145\/3295500.3356182"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Capelli, L.A., Hu, Z., Zakian, T.A.: iPregel: a combiner-based in-memory shared memory vertex-centric framework. In: Proceedings of the 47th International Conference on Parallel Processing Companion, pp. 1\u201310 (2018). https:\/\/doi.org\/10.1145\/3229710.3229719","DOI":"10.1145\/3229710.3229719"},{"key":"18_CR6","unstructured":"Ching, A.: Giraph: production-grade graph processing infrastructure for trillion edge graphs. ATPESC, ser. ATPESC 14 (2014)"},{"key":"18_CR7","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: distributed graph-parallel computation on natural graphs. In: OSDI, p. 2 (2012)"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Heidarshenas, A., Yesil, S., Skarlatos, D., Misailovic, S., Morrison, A., Torrellas, J.: V-Combiner: speeding-up iterative graph processing on a shared-memory platform with vertex merging. In: Proceedings of the 34th ACM International Conference on Supercomputing, pp. 1\u201313 (2020). https:\/\/doi.org\/10.1145\/3392717.3392739","DOI":"10.1145\/3392717.3392739"},{"key":"18_CR9","unstructured":"Iyer, A.P., Liu, Z., Jin, X., Venkataraman, S., Braverman, V., Stoica, I.: $$\\{$$ASAP$$\\}$$: Fast, approximate graph pattern mining at scale. In: 13th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 18), pp. 745\u2013761 (2018)"},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Iyer, A.P., et al.: Bridging the gap: towards approximate graph analytics. In: Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), p. 10. ACM (2018). https:\/\/doi.org\/10.1145\/3210259.3210269","DOI":"10.1145\/3210259.3210269"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/3037697.3037718","volume":"51","author":"D Jevdjic","year":"2017","unstructured":"Jevdjic, D., Strauss, K., Ceze, L., Malvar, H.S.: Approximate storage of compressed and encrypted videos. ACM SIGOPS Operat. Syst. Rev. 51(2), 361\u2013373 (2017). https:\/\/doi.org\/10.1145\/3037697.3037718","journal-title":"ACM SIGOPS Operat. Syst. Rev."},{"issue":"6","key":"18_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/1250734.1250759","volume":"42","author":"M Kulkarni","year":"2007","unstructured":"Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., Chew, L.P.: Optimistic parallelism requires abstractions. ACM SIGPLAN Notices 42(6), 211\u2013222 (2007). https:\/\/doi.org\/10.1145\/1250734.1250759","journal-title":"ACM SIGPLAN Notices"},{"key":"18_CR13","unstructured":"Kyrola, A., Blelloch, G.E., Guestrin, C.: GraphChi: large-scale graph computation on just a pc. In: 11th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 12). USENIX (2012)"},{"key":"18_CR14","unstructured":"Low, Y., Gonzalez, J.E., Kyrola, A., Bickson, D., Guestrin, C.E., Hellerstein, J.: GraphLab: a new framework for parallel machine learning. arXiv preprint arXiv:1408.2041 (2014)"},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146. ACM (2010). https:\/\/doi.org\/10.1145\/1807167.1807184","DOI":"10.1145\/1807167.1807184"},{"key":"18_CR16","unstructured":"McSherry, F., Isard, M., Murray, D.G.: Scalability! but at what cost? In: HotOS, vol. 15, p. 14. Citeseer (2015)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Mitliagkas, I., Borokhovich, M., Dimakis, A.G., Caramanis, C.: Frogwild!-fast pagerank approximations on graph engines. arXiv preprint arXiv:1502.04281 (2015)","DOI":"10.14778\/2757807.2757812"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Mukkara, A., Beckmann, N., Abeydeera, M., Ma, X., Sanchez, D.: Exploiting locality in graph analytics through hardware-accelerated traversal scheduling. In: 2018 51st Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO), pp. 1\u201314. IEEE (2018). https:\/\/doi.org\/10.1109\/MICRO.2018.00010","DOI":"10.1109\/MICRO.2018.00010"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Nai, L., Xia, Y., Tanase, I.G., Kim, H., Lin, C.Y.: GraphBIG: understanding graph computing in the context of industrial solutions. In: 2015 SC-International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201312. IEEE (2015). https:\/\/doi.org\/10.1145\/2807591.2807626","DOI":"10.1145\/2807591.2807626"},{"key":"18_CR20","doi-asserted-by":"publisher","unstructured":"Nguyen, D., Lenharth, A., Pingali, K.: A lightweight infrastructure for graph analytics. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pp. 456\u2013471. ACM (2013). https:\/\/doi.org\/10.1145\/2517349.2522739","DOI":"10.1145\/2517349.2522739"},{"issue":"1","key":"18_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/ICDE.2012.53","volume":"26","author":"M Qiao","year":"2012","unstructured":"Qiao, M., Cheng, H., Chang, L., Yu, J.X.: Approximate shortest distance computing: a query-dependent local landmark scheme. IEEE Trans. Knowl. Data Eng. 26(1), 55\u201368 (2012). https:\/\/doi.org\/10.1109\/ICDE.2012.53","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Roy, A., Mihailovic, I., Zwaenepoel, W.: X-stream: edge-centric graph processing using streaming partitions. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pp. 472\u2013488. ACM (2013). https:\/\/doi.org\/10.1145\/2517349.2522740","DOI":"10.1145\/2517349.2522740"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s, T., Bencz\u00far, A.A., Csalog\u00e1ny, K., Fogaras, D., R\u00e1cz, B.: To randomize or not to randomize: space optimal summaries for hyperlink analysis. In: Proceedings of the 15th International Conference on World Wide Web, pp. 297\u2013306 (2006)","DOI":"10.1145\/1135777.1135823"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Shang, Z., Yu, J.X.: Auto-approximation of graph computing. In: Proceedings of the VLDB Endowment 7(14), 1833\u20131844 (2014). https:\/\/doi.org\/10.14778\/2733085.2733090","DOI":"10.14778\/2733085.2733090"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Shin, K., Ghoting, A., Kim, M., Raghavan, H.: SWeG: lossless and lossy summarization of web-scale graphs. In: The World Wide Web Conference, pp. 1679\u20131690 (2019). https:\/\/doi.org\/10.1145\/3308558.3313402","DOI":"10.1145\/3308558.3313402"},{"issue":"6","key":"18_CR26","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1137\/080734029","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. SIAM J. Comput. 40(6), 1913\u20131926 (2011). https:\/\/doi.org\/10.1137\/080734029","journal-title":"SIAM J. Comput."},{"issue":"4","key":"18_CR27","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D.A., Teng, S.H.: Spectral sparsification of graphs. SIAM J. Comput. 40(4), 981\u20131025 (2011). https:\/\/doi.org\/10.1137\/08074489X","journal-title":"SIAM J. Comput."},{"key":"18_CR28","doi-asserted-by":"publisher","unstructured":"Sundaram, N., et al.: GraphMat: high performance graph analytics made productive. In: Proceedings of the VLDB Endowment, vol. 8(11), 1214\u20131225 (2015). https:\/\/doi.org\/10.14778\/2809974.2809983","DOI":"10.14778\/2809974.2809983"},{"key":"18_CR29","unstructured":"Yuhanna, N., Evelson, B., Hopkins, B., Jedinak, E.: Techradar: enterprise dbms, q1 2014 (2013). https:\/\/www.forrester.com\/report\/TechRadar+Enterprise+DBMS+Q1+2014\/-\/E-RES106801"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2022: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-12597-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T23:13:00Z","timestamp":1660259580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-12597-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031125966","9783031125973"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-12597-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"102","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.97","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}