{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:58:47Z","timestamp":1725998327109},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961927"},{"type":"electronic","value":"9783319961934"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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-96193-4_5","type":"book-chapter","created":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T14:32:53Z","timestamp":1540996373000},"page":"143-162","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Processing of Graphs"],"prefix":"10.1007","author":[{"given":"Bin","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yatao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,1]]},"reference":[{"key":"5_CR1","series-title":"Advances in Database Systems","volume-title":"Managing and Mining Graph Data","year":"2010","unstructured":"Aggarwal CC, Wang H (eds) (2010) Managing and mining graph data. Advances in database systems, vol 40. Springer, Berlin"},{"key":"5_CR2","first-page":"2749","volume-title":"Proceedings of the 21st ACM international conference on information and knowledge management, CIKM \u201912","author":"A Aranda-And\u00fajar","year":"2012","unstructured":"Aranda-And\u00fajar A, Bugiotti F, Camacho-Rodr\u00edguez J, Colazzo D, Goasdou\u00e9 F, Kaoudi Z, Manolescu I (2012) Amada: web data repositories in the amazon cloud. In: Proceedings of the 21st ACM international conference on information and knowledge management, CIKM \u201912. ACM, New York, pp 2749\u20132751"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Atre M, Chaoji V, Zaki MJ, Hendler JA (2010) Matrix \u201cbit\u201d loaded: a scalable lightweight join query processor for RDF data. In: WWW, pp 41\u201350","DOI":"10.1145\/1772690.1772696"},{"key":"5_CR4","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B\u00e9la Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B (1998) Modern graph theory. Graduate texts in mathematics, Springer, Berlin"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Cheng J, Yu JX, Ding B, Yu PS, Wang H (2008) Fast graph pattern matching. In: ICDE, pp 913\u2013922","DOI":"10.1109\/ICDE.2008.4497500"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J. Cohen","year":"2009","unstructured":"Cohen J (2009) Graph twiddling in a mapreduce world. In: Computing in science & engineering, pp 29\u201341","journal-title":"Computing in Science & Engineering"},{"issue":"10","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51:107\u2013113","journal-title":"Commun ACM"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/800119.803884","volume-title":"Proceedings of the sixth annual ACM symposium on theory of computing, STOC \u201974","author":"MR Garey","year":"1974","unstructured":"Garey MR, Johnson DS, Stockmeyer L (1974) Some simplified np-complete problems. In: Proceedings of the sixth annual ACM symposium on theory of computing, STOC \u201974. ACM, New York, pp 47\u201363"},{"key":"5_CR10","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) Powergraph: distributed graph-parallel computation on natural graphs. In: OSDI, pp 17\u201330"},{"key":"5_CR11","first-page":"599","volume-title":"Proceedings of the 11th USENIX conference on operating systems design and implementation, OSDI\u201914","author":"JE Gonzalez","year":"2014","unstructured":"Gonzalez JE, Xin RS, Dave A, Crankshaw D, Franklin MJ, Stoica I (2014) Graphx: graph processing in a distributed dataflow framework. In: Proceedings of the 11th USENIX conference on operating systems design and implementation, OSDI\u201914. USENIX Association, Berkeley, pp 599\u2013613"},{"key":"5_CR12","unstructured":"Gregor D, Lumsdaine A (2005) The parallel BGL: a generic library for distributed graph computations. In: Parallel object-oriented scientific computing (POOSC), POOSC \u201905"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"He H, Singh AK (2008) Graphs-at-a-time: query language and access methods for graph databases. In: SIGMOD","DOI":"10.1145\/1376616.1376660"},{"key":"5_CR14","unstructured":"Holder LB, Cook DJ, Djoko S (1994) Substucture discovery in the subdue system. In: KDD workshop, pp 169\u2013180"},{"issue":"9","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TKDE.2011.103","volume":"23","author":"M Husain","year":"2011","unstructured":"Husain M, McGlothlin J, Masud MM, Khan L, Thuraisingham BM (2011) Heuristics-based query processing for large RDF graphs using cloud computing. IEEE Trans Knowl Data Eng 23(9):1312\u20131327","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Kang U, Tsourakakis CE, Faloutsos C (2009) Pegasus: a peta-scale graph mining system implementation and observations. In: Proceedings of the 2009 ninth IEEE international conference on data mining, ICDM \u201909. IEEE Computer Society, Washington, pp 229\u2013238","DOI":"10.1109\/ICDM.2009.14"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00778-014-0364-z","volume":"24","author":"Z Kaoudi","year":"2015","unstructured":"Kaoudi Z, Manolescu I (2015) RDF in the clouds: a survey. VLDB J 24(1):67\u201391","journal-title":"VLDB J"},{"key":"5_CR18","unstructured":"Kyrola A, Blelloch G, Guestrin C (2012) Graphchi: large-scale graph computation on just a pc. In: OSDI, pp 31\u201346"},{"issue":"8","key":"5_CR19","doi-asserted-by":"publisher","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low Y, Bickson D, Gonzalez J, Guestrin C, Kyrola A, Hellerstein JM (2012) Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc VLDB Endow 5(8):716\u2013727","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S0129626407002843","volume":"17","author":"A Lumsdaine","year":"2007","unstructured":"Lumsdaine A, Gregor D, Hendrickson B, Berry JW (2007) Challenges in parallel graph processing. Parallel Process Lett 17(1):5\u201320","journal-title":"Parallel Process Lett"},{"key":"5_CR21","unstructured":"Majumder S, Rixner S (2004) An event-driven architecture for MPI libraries. In: Proceedings of the 2004 Los Alamos computer science institute symposium"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/1807167.1807184","volume-title":"Proceedings of the 2010 international conference on management of data, SIGMOD \u201910","author":"G Malewicz","year":"2010","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 international conference on management of data, SIGMOD \u201910. ACM, New York, pp 135\u2013146"},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00778-009-0165-y","volume":"19","author":"T Neumann","year":"2010","unstructured":"Neumann T, Weikum G (2010) The rdf-3x engine for scalable management of RDF data. VLDB J 19(1):91\u2013113","journal-title":"VLDB J"},{"key":"5_CR24","volume-title":"Matroid theory","author":"J Oxley","year":"1992","unstructured":"Oxley J (1992) Matroid theory. Oxford University Press, Oxford"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Oxley J (2001) On the interplay between graphs and matroids. In: Surveys in combinatorics 2001. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511721328.010"},{"key":"5_CR26","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/2187980.2188058","volume-title":"Proceedings of the 21st international conference on World Wide Web, WWW \u201912 Companion","author":"N Papailiou","year":"2012","unstructured":"Papailiou N, Konstantinou I, Tsoumakos D, Koziris N (2012) H2rdf: adaptive query processing on RDF data in the cloud. In: Proceedings of the 21st international conference on World Wide Web, WWW \u201912 Companion. ACM, New York, pp 397\u2013400"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Qi Z, Xiao Y, Shao B, Wang H (2014) Distance oracle on billion node graphs. In: VLDB, VLDB Endowment","DOI":"10.14778\/2732219.2732225"},{"key":"5_CR28","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1145\/2588555.2593661","volume-title":"Proceedings of the 2014 ACM SIGMOD international conference on management of data, SIGMOD \u201914","author":"L Qin","year":"2014","unstructured":"Qin L, Yu JX, Chang L, Cheng H, Zhang C, Lin X (2014) Scalable big graph processing in mapreduce. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, SIGMOD \u201914. ACM, New York, pp 827\u2013838"},{"key":"5_CR29","first-page":"46","volume-title":"Proceedings of the 8th extended semantic web conference on the semanic web: research and applications - volume Part II, ESWC\u201911","author":"P Ravindra","year":"2011","unstructured":"Ravindra P, Kim H, Anyanwu K (2011) An intermediate algebra for optimizing RDF graph pattern matching on mapreduce. In: Proceedings of the 8th extended semantic web conference on the semanic web: research and applications - volume Part II, ESWC\u201911. Springer, Berlin, pp 46\u201361"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1996014.1996021","volume-title":"Proceedings of the fourth international workshop on data-intensive distributed computing, DIDC \u201911","author":"K Rohloff","year":"2011","unstructured":"Rohloff K, Schantz RE (2011) Clause-iteration with mapreduce to scalably query datagraphs in the shard graph-store. In: Proceedings of the fourth international workshop on data-intensive distributed computing, DIDC \u201911. ACM, New York, pp 35\u201344"},{"issue":"14","key":"5_CR31","doi-asserted-by":"publisher","first-page":"1918","DOI":"10.14778\/2556549.2556573","volume":"6","author":"M Sarwat","year":"2013","unstructured":"Sarwat M, Elnikety S, He Y, Mokbel MF (2013) Horton+: a distributed system for processing declarative reachability queries over partitioned graphs. Proc VLDB Endow 6(14):1918\u20131929","journal-title":"Proc VLDB Endow"},{"key":"5_CR32","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/2463676.2467799","volume-title":"Proceedings of the 2013 ACM SIGMOD international conference on management of data, SIGMOD \u201913","author":"B Shao","year":"2013","unstructured":"Shao B, Wang H, Li Y (2013) Trinity: a distributed graph engine on a memory cloud. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, SIGMOD \u201913. ACM, New York, pp 505\u2013516"},{"issue":"9","key":"5_CR33","doi-asserted-by":"publisher","first-page":"788","DOI":"10.14778\/2311906.2311907","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun Z, Wang H, Wang H, Shao B, Li J (2012) Efficient subgraph matching on billion node graphs. Proc VLDB Endow 5(9):788\u2013799","journal-title":"Proc VLDB Endow"},{"key":"5_CR34","volume-title":"Matroid decomposition","author":"K Truemper","year":"1998","unstructured":"Truemper K (1998) Matroid decomposition. Elsevier, Amsterdam"},{"issue":"1","key":"5_CR35","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM 23(1):31\u201342","journal-title":"J ACM"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33:103\u2013111","journal-title":"Commun ACM"},{"key":"5_CR37","first-page":"256","volume-title":"Proceedings of the 19th annual international symposium on computer architecture, ISCA \u201992","author":"T Eicken von","year":"1992","unstructured":"von Eicken T, Culler DE, Goldstein SC, Schauser KE (1992) Active messages: a mechanism for integrated communication and computation. In: Proceedings of the 19th annual international symposium on computer architecture, ISCA \u201992. ACM, New York, pp 256\u2013266"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Wang L, Xiao Y, Shao B, Wang H (2014) How to partition a billion-node graph. In: IEEE 30th international conference on data engineering, ICDE 2014, Chicago, March 31\u2013April 4, 2014, pp 568\u2013579","DOI":"10.1109\/ICDE.2014.6816682"},{"key":"5_CR39","unstructured":"Zaharia M, Chowdhury M, Franklin MJ, Shenker S, Stoica I (2010) Spark: cluster computing with working sets. In: HotCloud\u201910 proceedings of the 2nd USENIX conference on hot topics in cloud computing. USENIX Association, Berkeley, 18 pp."},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Zeng K, Yang J, Wang H, Shao B, Wang Z (2013) A distributed graph engine for web scale RDF data. In: VLDB, VLDB Endowment","DOI":"10.14778\/2535570.2488333"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Zhang S, Li S, Yang J (2009) Gaddi: distance index based subgraph matching in biological networks. In: EDBT","DOI":"10.1145\/1516360.1516384"},{"key":"5_CR42","doi-asserted-by":"crossref","unstructured":"Zhang X, Chen L, Tong Y, Wang M (2013) Eagre: towards scalable I\/O efficient SPARQL query evaluation on the cloud. In: Proceedings of the 2013 IEEE international conference on data engineering (ICDE 2013), ICDE \u201913. IEEE Computer Society, Washington, pp 565\u2013576","DOI":"10.1109\/ICDE.2013.6544856"},{"issue":"1","key":"5_CR43","first-page":"340","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao P, Han J (2010) On graph query optimization in large networks. PVLDB 3(1):340\u2013351","journal-title":"PVLDB"},{"key":"5_CR44","unstructured":"Zhao X, Sala A, Wilson C, Zheng H, Zhao BY (2010) Orion: shortest path estimation for large social graphs. In: WOSN\u201910"},{"key":"5_CR45","unstructured":"Zhao X, Sala A, Zheng H, Zhao BY (2011) Fast and scalable analysis of massive social graphs. CoRR"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Zhu F, Qu Q, Lo D, Yan X, Han J, Yu PS (2011) Mining top-k large structural patterns in a massive network. In: VLDB","DOI":"10.14778\/3402707.3402720"},{"issue":"1","key":"5_CR47","first-page":"886","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou L, Chen L, \u00d6zsu MT (2009) Distancejoin: pattern match query in a large graph database. PVLDB 2(1):886\u2013897","journal-title":"PVLDB"}],"container-title":["Data-Centric Systems and Applications","Graph Data Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96193-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T00:08:00Z","timestamp":1662336480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96193-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961927","9783319961934"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96193-4_5","relation":{},"ISSN":["2197-9723","2197-974X"],"issn-type":[{"type":"print","value":"2197-9723"},{"type":"electronic","value":"2197-974X"}],"subject":[],"published":{"date-parts":[[2018]]}}}