{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:39:26Z","timestamp":1725975566812},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319906850"},{"type":"electronic","value":"9783319906867"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90686-7_11","type":"book-chapter","created":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T13:49:55Z","timestamp":1524491395000},"page":"166-181","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimizing Declarative Parallel Distributed Graph Processing by Using Constraint Solvers"],"prefix":"10.1007","author":[{"given":"Akimasa","family":"Morihata","sequence":"first","affiliation":[]},{"given":"Kento","family":"Emoto","sequence":"additional","affiliation":[]},{"given":"Kiminori","family":"Matsuzaki","sequence":"additional","affiliation":[]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Hideya","family":"Iwasaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,24]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Elmagarmid, A.K., Agrawal, D. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Xie, C., Chen, R., Guan, H., Zang, B., Chen, H.: SYNC or ASYNC: time to fuse for distributed graph-parallel computation. In: Cohen, A., Grove, D. (eds.) Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2015, pp. 194\u2013204. ACM (2015)","DOI":"10.1145\/2688500.2688508"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhou, C., Gao, J., Fan, Z.: Giraphasync: supporting online and offline graph processing via adaptive asynchronous message processing. In: Mukhopadhyay, S., Zhai, C., Bertino, E., Crestani, F., Mostafa, J., Tang, J., Si, L., Zhou, X., Chang, Y., Li, Y., Sondhi, P. (eds.) Proceedings of the 25th ACM International Conference on Information and Knowledge Management, CIKM 2016, pp. 479\u2013488. ACM (2016)","DOI":"10.1145\/2983323.2983726"},{"issue":"3","key":"11_CR4","first-page":"193","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Balmin, A., Corsten, S.A., Tatikonda, S., McPherson, J.: From \u201cthink like a vertex\u201d to \u201cthink like a graph\u201d. PVLDB 7(3), 193\u2013204 (2013)","journal-title":"PVLDB"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00778-015-0405-2","volume":"25","author":"A Quamar","year":"2016","unstructured":"Quamar, A., Deshpande, A., Lin, J.J.: NScale: neighborhood-centric large-scale graph analytics in the cloud. VLDB J. 25(2), 125\u2013150 (2016)","journal-title":"VLDB J."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Prountzos, D., Manevich, R., Pingali, K.: Elixir: a system for synthesizing concurrent graph programs. In: Leavens, G.T., Dwyer, M.B. (eds.) Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2012, part of SPLASH 2012, pp. 375\u2013394. ACM (2012)","DOI":"10.1145\/2384616.2384644"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Cruz, F., Rocha, R., Goldstein, S.C.: Declarative coordination of graph-based parallel programs. In: Asenjo, R., Harris, T. (eds.) Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2016, pp. 4:1\u20134:12. ACM (2016)","DOI":"10.1145\/2851141.2851153"},{"issue":"9","key":"11_CR8","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/3022670.2951938","volume":"51","author":"Kento Emoto","year":"2016","unstructured":"Emoto, K., Matsuzaki, K., Hu, Z., Morihata, A., Iwasaki, H.: Think like a vertex, behave like a function! A functional DSL for vertex-centric big graph processing. In: Garrigue, J., Keller, G., Sumii, E. (eds.) Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, pp. 200\u2013213. ACM (2016)","journal-title":"ACM SIGPLAN Notices"},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9459-1","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","year":"1998","unstructured":"Caviness, B.F., Johnson, J.R. (eds.): Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, Vienna (1998). \nhttps:\/\/doi.org\/10.1007\/978-3-7091-9459-1"},{"issue":"9","key":"11_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1995376.1995394","volume":"54","author":"LM Moura de","year":"2011","unstructured":"de Moura, L.M., Bj\u00f8rner, N.: Satisfiability modulo theories: introduction and applications. Commun. ACM 54(9), 69\u201377 (2011)","journal-title":"Commun. ACM"},{"issue":"8","key":"11_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Effective techniques for message reduction and load balancing in distributed graph computation. In: Gangemi, A., Leonardi, S., Panconesi, A. (eds.) Proceedings of the 24th International Conference on World Wide Web, WWW 2015, pp. 1307\u20131317. ACM (2015)","DOI":"10.1145\/2736277.2741096"},{"issue":"5","key":"11_CR13","first-page":"493","volume":"10","author":"S Verma","year":"2017","unstructured":"Verma, S., Leslie, L.M., Shin, Y., Gupta, I.: An experimental comparison of partitioning strategies in distributed graph processing. PVLDB 10(5), 493\u2013504 (2017)","journal-title":"PVLDB"},{"issue":"7","key":"11_CR14","first-page":"577","volume":"7","author":"S Salihoglu","year":"2014","unstructured":"Salihoglu, S., Widom, J.: Optimizing graph algorithms on pregel-like systems. PVLDB 7(7), 577\u2013588 (2014)","journal-title":"PVLDB"},{"key":"11_CR15","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: Thekkath, C., Vahdat, A. (eds.) Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012, USENIX Association, pp. 17\u201330 (2012)"},{"issue":"8","key":"11_CR16","first-page":"716","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning in the cloud. PVLDB 5(8), 716\u2013727 (2012)","journal-title":"PVLDB"},{"issue":"9","key":"11_CR17","first-page":"950","volume":"8","author":"M Han","year":"2015","unstructured":"Han, M., Daudjee, K.: Giraph unchained: barrierless asynchronous parallel execution in pregel-like graph processing systems. PVLDB 8(9), 950\u2013961 (2015)","journal-title":"PVLDB"},{"issue":"1\u20132","key":"11_CR18","first-page":"1","volume":"4","author":"S Gulwani","year":"2017","unstructured":"Gulwani, S., Polozov, O., Singh, R.: Program synthesis. Found. Trends Program. Lang. 4(1\u20132), 1\u2013119 (2017)","journal-title":"Found. Trends Program. Lang."},{"issue":"11","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1016\/j.jsc.2005.09.012","volume":"41","author":"A Gr\u00f6\u00dflinger","year":"2006","unstructured":"Gr\u00f6\u00dflinger, A., Griebl, M., Lengauer, C.: Quantifier elimination in automatic loop parallelization. J. Symb. Comput. 41(11), 1206\u20131221 (2006)","journal-title":"J. Symb. Comput."},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-78791-4_9","volume-title":"Compiler Construction","author":"U Bondhugula","year":"2008","unstructured":"Bondhugula, U., Baskaran, M., Krishnamoorthy, S., Ramanujam, J., Rountev, A., Sadayappan, P.: Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model. In: Hendren, L. (ed.) CC 2008. LNCS, vol. 4959, pp. 132\u2013146. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78791-4_9"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Pouchet, L., Bondhugula, U., Bastoul, C., Cohen, A., Ramanujam, J., Sadayappan, P., Vasilache, N.: Loop transformations: convexity, pruning and optimization. In: Ball, T., Sagiv, M. (eds.): Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, pp. 549\u2013562. ACM (2011)","DOI":"10.1145\/1926385.1926449"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Prountzos, D., Manevich, R., Pingali, K.: Synthesizing parallel graph programs via automated planning. In: Grove, D., Blackburn, S. (eds.) Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2015, pp. 533\u2013544. ACM (2015)","DOI":"10.1145\/2737924.2737953"},{"issue":"14","key":"11_CR23","first-page":"1906","volume":"6","author":"J Seo","year":"2013","unstructured":"Seo, J., Park, J., Shin, J., Lam, M.S.: Distributed socialite: a datalog-based language for large-scale graph analysis. PVLDB 6(14), 1906\u20131917 (2013)","journal-title":"PVLDB"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","volume":"49","author":"U Meyer","year":"2003","unstructured":"Meyer, U., Sanders, P.: [Delta]-stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1), 114\u2013152 (2003)","journal-title":"J. Algorithms"},{"key":"11_CR25","unstructured":"Gonzalez, J.E., Xin, R.S., Dave, A., Crankshaw, D., Franklin, M.J., Stoica, I.: GraphX: graph processing in a distributed dataflow framework. In: Flinn, J., Levy, H. (eds.) Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2014, pp. 599\u2013613. USENIX Association (2014)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90686-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T13:53:09Z","timestamp":1524491589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-90686-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319906850","9783319906867"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90686-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}