{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T14:17:45Z","timestamp":1790086665641,"version":"4.0.1"},"reference-count":57,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2016,2,12]]},"DOI":"10.3233\/sw-150176","type":"journal-article","created":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T05:07:40Z","timestamp":1456204060000},"page":"139-166","source":"Crossref","is-referenced-by-count":7,"title":["Signal\/Collect12"],"prefix":"10.1177","volume":"7","author":[{"given":"Philip","family":"Stutz","sequence":"first","affiliation":[{"name":"University of Zurich, Switzerland. E-mail:\u00a0bernstein@ifi.uzh.ch"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Strebel","sequence":"additional","affiliation":[{"name":"University of Zurich, Switzerland. E-mail:\u00a0bernstein@ifi.uzh.ch"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abraham","family":"Bernstein","sequence":"additional","affiliation":[{"name":"University of Zurich, Switzerland. E-mail:\u00a0bernstein@ifi.uzh.ch"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","reference":[{"key":"10.3233\/SW-150176_ref1","doi-asserted-by":"crossref","unstructured":"[1] K.\u00a0Andreev and H.\u00a0R\u00e4cke, Balanced graph partitioning, in: Proc. of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201904, ACM, New York, NY, USA, 2004, pp.\u00a0120\u2013124.","DOI":"10.1145\/1007912.1007931"},{"key":"10.3233\/SW-150176_ref2","doi-asserted-by":"crossref","unstructured":"[2] D.A.\u00a0Bader and K.\u00a0Madduri, Snap, small-world network analysis and partitioning: an open-source parallel graph framework for the exploration of large-scale networks, in: 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, IEEE Press, Miami, FL, 2008, pp.\u00a01\u201312.","DOI":"10.1109\/IPDPS.2008.4536261"},{"key":"10.3233\/SW-150176_ref3","doi-asserted-by":"crossref","unstructured":"[3] C.\u00a0Biemann, Chinese whispers: an efficient graph clustering algorithm and its application to natural language processing problems, in: Proc. of the First Workshop on Graph Based Methods for Natural Language Processing, TextGraphs-1, Association for Computational Linguistics, Stroudsburg, PA, USA, 2006, pp.\u00a073\u201380.","DOI":"10.3115\/1654758.1654774"},{"key":"10.3233\/SW-150176_ref4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.14778\/1920841.1920881","article-title":"Haloop: efficient iterative data processing on large clusters","volume":"3","author":"Bu","year":"2010","journal-title":"Proc. of the VLDB Endowment"},{"key":"10.3233\/SW-150176_ref5","doi-asserted-by":"crossref","unstructured":"[5] Z.\u00a0Cai, D.\u00a0Logothetis and G.\u00a0Siganos, Facilitating real-time graph mining, in: Proc. of the Fourth International Workshop on Cloud Data Management, CloudDB \u201912, ACM, New York, NY, USA, 2012, pp.\u00a01\u20138.","DOI":"10.1145\/2390021.2390023"},{"key":"10.3233\/SW-150176_ref6","doi-asserted-by":"crossref","unstructured":"[6] S.\u00a0Chakrabarti, B.\u00a0Dom and P.\u00a0Indyk, Enhanced hypertext categorization using hyperlinks, in: Proc. of the 1998 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201998, ACM, New York, NY, USA, 1998, pp.\u00a0307\u2013318.","DOI":"10.1145\/276304.276332"},{"issue":"1","key":"10.3233\/SW-150176_ref7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: determining global states of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comput. Syst."},{"key":"10.3233\/SW-150176_ref8","doi-asserted-by":"crossref","unstructured":"[8] R.\u00a0Chen, X.\u00a0Weng, B.\u00a0He and M.\u00a0Yang, Large graph processing in the cloud, in: SIGMOD Conference\u201910, ACM Press, New York, NY, USA, 2010, pp.\u00a01123\u20131126.","DOI":"10.1145\/1807167.1807297"},{"issue":"4","key":"10.3233\/SW-150176_ref9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/MCSE.2009.120","article-title":"Graph twiddling in a mapreduce world","volume":"11","author":"Cohen","year":"2009","journal-title":"Computing in Science Engineering"},{"key":"10.3233\/SW-150176_ref10","unstructured":"[10] J.\u00a0Dean and S.\u00a0Ghemawat, Mapreduce: simplified data processing on large clusters, in: OSDI\u201904: Proc. of the 6th Conference on Symposium on Opearting Systems Design & Implementation, USENIX Association, Berkeley, CA, USA, 2004, p.\u00a010."},{"key":"10.3233\/SW-150176_ref12","doi-asserted-by":"crossref","unstructured":"[12] M.\u00a0deLorimier, N.\u00a0Kapre, N.\u00a0Mehta, D.\u00a0Rizzo, I.\u00a0Eslick, R.\u00a0Rubin, T.E.\u00a0Uribe, T.F.\u00a0Knight and A.\u00a0Dehon, Graphstep: a system architecture for sparse-graph algorithms, in: Proc. of the IEEE Symposium on Field-Programmable Custom Computing Machines, IEEE, IEEE Computer Society, Napa, CA, 2006, pp.\u00a0143\u2013151.","DOI":"10.1109\/FCCM.2006.45"},{"key":"10.3233\/SW-150176_ref13","doi-asserted-by":"crossref","unstructured":"[13] J.\u00a0Ekanayake, H.\u00a0Li, B.\u00a0Zhang, T.\u00a0Gunarathne, S.-H.\u00a0Bae, J.\u00a0Qiu and G.\u00a0Fox, Twister: a runtime for iterative mapreduce, in: Proc. of the 19th ACM International Symposium on High Performance Distributed Computing, S.\u00a0Hariri and K.\u00a0Keahey, eds, ACM, New York, NY, 2010, pp.\u00a0810\u2013818.","DOI":"10.1145\/1851476.1851593"},{"issue":"4","key":"10.3233\/SW-150176_ref14","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1038\/scientificamerican1070-120","article-title":"Mathematical games: the fantastic combinations of John Conway\u2019s new solitaire game \u201clife\u201d","volume":"223","author":"Gardner","year":"1970","journal-title":"Scientific American"},{"key":"10.3233\/SW-150176_ref15","unstructured":"[15] L.\u00a0Getoor, E.\u00a0Segal, B.\u00a0Taskar and D.\u00a0Koller, Probabilistic models of text and link structure for hypertext classification, in: IJCAI Workshop on Text Learning: Beyond Supervision, International Joint Conferences on Artificial Intelligence Inc., 2001, http:\/\/linqs.cs.umd.edu\/basilic\/web\/Publications\/2001\/getoor:ijcaiws01\/ijcai01-ws.pdf."},{"key":"10.3233\/SW-150176_ref16","unstructured":"[16] J.E.\u00a0Gonzalez, Y.\u00a0Low, H.\u00a0Gu, D.\u00a0Bickson and C.\u00a0Guestrin, Powergraph: distributed graph-parallel computation on natural graphs, in: Proc. of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201912, USENIX Association, Berkeley, CA, USA, 2012, pp.\u00a017\u201330."},{"issue":"6","key":"10.3233\/SW-150176_ref17","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1086\/226707","article-title":"Threshold models of collective behavior","volume":"83","author":"Granovetter","year":"1978","journal-title":"American Journal of Sociology"},{"key":"10.3233\/SW-150176_ref18","doi-asserted-by":"crossref","unstructured":"[18] D.\u00a0Gregor and A.\u00a0Lumsdaine, Lifting sequential graph algorithms for distributed-memory parallel computation, in: ACM SIGPLAN Notices \u2013 Proc. of the 20th Annual ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications, Vol.\u00a040, 2005, pp.\u00a0423\u2013437.","DOI":"10.1145\/1103845.1094844"},{"key":"10.3233\/SW-150176_ref19","unstructured":"[19] D.\u00a0Gregor and A.\u00a0Lumsdaine, The parallel bgl: a generic library for distributed graph computations, in: Parallel Object-Oriented Scientific Computing (POOSC), Glasgow, UK, 2005."},{"key":"10.3233\/SW-150176_ref20","doi-asserted-by":"crossref","unstructured":"[20] Y.\u00a0Gu, L.\u00a0Lu, R.\u00a0Grossman and A.\u00a0Yoo, Processing massive sized graphs using sector\/sphere, in: 2010 IEEE Workshop on Many-Task Computing on Grids and Supercomputers (MTAGS), IEEE Press, New Orleans, LA, 2010, pp.\u00a01\u201310.","DOI":"10.1109\/MTAGS.2010.5699427"},{"key":"10.3233\/SW-150176_ref21","unstructured":"[21] P.\u00a0Haller and H.\u00a0Miller, Parallelizing machine learning \u2013 functionally: a framework and abstractions for parallel graph processing, in: 2nd Annual Scala Workshop 2011, 2011."},{"key":"10.3233\/SW-150176_ref22","unstructured":"[22] C.\u00a0Hewitt, P.\u00a0Bishop and R.\u00a0Steiger, A universal modular actor formalism for artificial intelligence, in: IJCAI\u201973: Proc. of the 3rd International Joint Conference on Artificial Intelligence, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1973, pp.\u00a0235\u2013245."},{"issue":"6025","key":"10.3233\/SW-150176_ref23","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1126\/science.1200970","article-title":"The world\u2019s technological capacity to store, communicate, and compute information","volume":"332","author":"Hilbert","year":"2011","journal-title":"Science"},{"key":"10.3233\/SW-150176_ref24","doi-asserted-by":"crossref","unstructured":"[24] S.\u00a0Hong, H.\u00a0Chafi, E.\u00a0Sedlar and K.\u00a0Olukotun, Green-marl: a dsl for easy and efficient graph analysis, in: Proc. of the Seventeenth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS XVII, ACM, New York, NY, USA, 2012, pp.\u00a0349\u2013362.","DOI":"10.1145\/2150976.2151013"},{"key":"10.3233\/SW-150176_ref25","doi-asserted-by":"crossref","unstructured":"[25] M.\u00a0Isard, M.\u00a0Budiu, Y.\u00a0Yu, A.\u00a0Birrell and D.\u00a0Fetterly, Dryad: distributed data-parallel programs from sequential building blocks, in: EuroSys \u201907: Proc. of the 2nd ACM SIGOPS\/EuroSys European Conference on Computer Systems 2007, ACM, New York, NY, USA, 2007, pp.\u00a059\u201372.","DOI":"10.1145\/1272996.1273005"},{"key":"10.3233\/SW-150176_ref26","doi-asserted-by":"crossref","unstructured":"[26] M.\u00a0Isard and Y.\u00a0Yu, Distributed data-parallel computing using a high-level programming language, in: Proc. of the 35th SIGMOD International Conference on Management of Data, SIGMOD \u201909, ACM, New York, NY, USA, 2009, pp.\u00a0987\u2013994.","DOI":"10.1145\/1559845.1559962"},{"key":"10.3233\/SW-150176_ref27","doi-asserted-by":"crossref","unstructured":"[27] T.\u00a0Kajdanowicz, W.\u00a0Indyk, P.\u00a0Kazienko and J.\u00a0Kukul, Comparison of the efficiency of mapreduce and bulk synchronous parallel approaches to large network processing, in: 2012 IEEE 12th International Conference on Data Mining Workshops (ICDMW), IEEE, IEEE Press, Vancouver, Canada, 2012, pp.\u00a0218\u2013225.","DOI":"10.1109\/ICDMW.2012.135"},{"key":"10.3233\/SW-150176_ref28","unstructured":"[28] U.\u00a0Kang, D.\u00a0Chau and C.\u00a0Faloutsos, Inference of beliefs on billion-scale graphs, in: The 2nd Workshop on Large-Scale Data Mining: Theory and Applications, ACM, ACM Press, Washington, DC, 2010."},{"key":"10.3233\/SW-150176_ref29","doi-asserted-by":"crossref","unstructured":"[29] U.\u00a0Kang, C.E.\u00a0Tsourakakis and C.\u00a0Faloutsos, Pegasus: a peta-scale graph mining system, in: Proc. of the 2009 Ninth IEEE International Conference on Data Mining (ICDM), IEEE Computer Society, Los Alamitos, CA, USA, 2009, pp.\u00a0229\u2013238.","DOI":"10.1109\/ICDM.2009.14"},{"key":"10.3233\/SW-150176_ref30","doi-asserted-by":"crossref","unstructured":"[30] C.\u00a0Kiefer, A.\u00a0Bernstein and A.\u00a0Locher, Adding data mining support to sparql via statistical relational learning methods, in: The Semantic Web: Research and Applications, S.\u00a0Bechhofer, M.\u00a0Hauswirth, J.\u00a0Hoffmann and M.\u00a0Koubarakis, eds, Lecture Notes in Computer Science Series, Vol.\u00a05021, Springer, Berlin, Heidelberg, Teneriffe, Spain, 2008, pp.\u00a0478\u2013492.","DOI":"10.1007\/978-3-540-68234-9_36"},{"key":"10.3233\/SW-150176_ref31","unstructured":"[31] D.\u00a0Koller and N.\u00a0Friedman, Probabilistic Graphical Models: Principles and Techniques, MIT Press, Cambridge, MA, 2009."},{"key":"10.3233\/SW-150176_ref32","doi-asserted-by":"crossref","unstructured":"[32] E.\u00a0Krepska, T.\u00a0Kielmann, W.\u00a0Fokkink and H.\u00a0Bal, A high-level framework for distributed processing of large-scale graphs, in: Proc. of the 12th International Conference on Distributed Computing and Networking, ICDCN\u201911, Springer-Verlag, Berlin, Heidelberg, 2011, pp.\u00a0155\u2013166.","DOI":"10.1007\/978-3-642-17679-1_14"},{"issue":"2","key":"10.3233\/SW-150176_ref33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/2007183.2007185","article-title":"Hipg: parallel processing of large-scale graphs","volume":"45","author":"Krepska","year":"2011","journal-title":"ACM SIGOPS Operating Systems Review"},{"key":"10.3233\/SW-150176_ref34","first-page":"985","article-title":"Kronecker graphs: an approach to modeling networks","volume":"11","author":"Leskovec","year":"2010","journal-title":"The Journal of Machine Learning Research"},{"key":"10.3233\/SW-150176_ref35","doi-asserted-by":"crossref","unstructured":"[35] J.\u00a0Lin and M.\u00a0Schatz, Design patterns for efficient graph algorithms in mapreduce, in: Proc. of the Eighth Workshop on Mining and Learning with Graphs, MLG \u201910, ACM, New York, NY, USA, 2010, pp.\u00a078\u201385.","DOI":"10.1145\/1830252.1830263"},{"key":"10.3233\/SW-150176_ref37","unstructured":"[37] Y.\u00a0Low, J.\u00a0Gonzalez, A.\u00a0Kyrola, D.\u00a0Bickson, C.\u00a0Guestrin and J.M.\u00a0Hellerstein, Graphlab: a new parallel framework for machine learning, in: Conference on Uncertainty in Artificial Intelligence (UAI), AUAI Press, Catalina Island, California, 2010."},{"issue":"5","key":"10.3233\/SW-150176_ref38","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1142\/S0129626407002843","article-title":"Challenges in parallel graph processing","volume":"17","author":"Lumsdaine","year":"2007","journal-title":"Parallel Processing Letters"},{"key":"10.3233\/SW-150176_ref39","doi-asserted-by":"crossref","unstructured":"[39] S.A.\u00a0Macskassy and F.\u00a0Provost, A simple relational classifier, in: Proc. of the Second Workshop on Multi-Relational Data Mining (MRDM-2003) at KDD-2003, ACM Press, Washington, DC, 2003, pp.\u00a064\u201376.","DOI":"10.21236\/ADA452802"},{"key":"10.3233\/SW-150176_ref40","first-page":"935","article-title":"Classification in networked data: a toolkit and a univariate case study","volume":"8","author":"Macskassy","year":"2007","journal-title":"J. Mach. Learn. Res."},{"key":"10.3233\/SW-150176_ref41","doi-asserted-by":"crossref","unstructured":"[41] G.\u00a0Malewicz, M.H.\u00a0Austern, A.J.C.\u00a0Bik, J.C.\u00a0Dehnert, I.\u00a0Horn, N.\u00a0Leiser and G.\u00a0Czajkowski, Pregel: a system for large-scale graph processing, in: SIGMOD Conference, A.K.\u00a0Elmagarmid and D.\u00a0Agrawal, eds, ACM, New York, NY, 2010, pp.\u00a0135\u2013146.","DOI":"10.1145\/1807167.1807184"},{"key":"10.3233\/SW-150176_ref42","unstructured":"[42] D.G.\u00a0Murray, M.\u00a0Schwarzkopf, C.\u00a0Smowton, S.\u00a0Smith, A.\u00a0Madhavapeddy and S.\u00a0Hand, Ciel: a universal execution engine for distributed data-flow computing, in: Proc. of the 8th USENIX Conference on Networked Systems Design and Implementation, NSDI\u201911, USENIX Association, Berkeley, CA, USA, 2011, p.\u00a09."},{"key":"10.3233\/SW-150176_ref43","doi-asserted-by":"crossref","unstructured":"[43] M.\u00a0Najork, D.\u00a0Fetterly, A.\u00a0Halverson, K.\u00a0Kenthapadi and S.\u00a0Gollapudi, Of hammers and nails: an empirical comparison of three paradigms for processing large graphs, in: Proc. of the Fifth ACM International Conference on Web Search and Data Mining, WSDM \u201912, ACM, New York, NY, USA, 2012, pp.\u00a0103\u2013112.","DOI":"10.1145\/2124295.2124310"},{"issue":"1\u20132","key":"10.3233\/SW-150176_ref44","doi-asserted-by":"crossref","first-page":"256","DOI":"10.14778\/1920841.1920877","article-title":"x-rdf-3x: fast querying, high update rates, and consistency for rdf databases","volume":"3","author":"Neumann","year":"2010","journal-title":"Proceedings of the VLDB Endowment"},{"key":"10.3233\/SW-150176_ref45","doi-asserted-by":"crossref","unstructured":"[45] C.\u00a0Olston, B.\u00a0Reed, U.\u00a0Srivastava, R.\u00a0Kumar and A.\u00a0Tomkins, Pig latin: a not-so-foreign language for data processing, in: Proc. of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201908, ACM, New York, NY, USA, 2008, pp.\u00a01099\u20131110.","DOI":"10.1145\/1376616.1376726"},{"issue":"4","key":"10.3233\/SW-150176_ref47","first-page":"277","article-title":"Interpreting the data: parallel analysis with sawzall","volume":"13","author":"Pike","year":"2005","journal-title":"Sci. Program."},{"key":"10.3233\/SW-150176_ref48","unstructured":"[48] R.\u00a0Power and J.\u00a0Li, Piccolo: building fast, distributed programs with partitioned tables, in: Proc. of the 9th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201910, USENIX Association, Berkeley, CA, USA, 2010, pp.\u00a01\u2013 14."},{"key":"10.3233\/SW-150176_ref49","unstructured":"[49] S.J.\u00a0Russell and P.\u00a0Norvig, Artificial Intelligence: A Modern Approach, 2nd international edn, Prentice Hall, Upper Saddle River, New Jersey, 2003."},{"key":"10.3233\/SW-150176_ref52","doi-asserted-by":"crossref","unstructured":"[52] S.\u00a0Seo, E.J.\u00a0Yoon, J.\u00a0Kim, S.\u00a0Jin, J.-S.\u00a0Kim and S.\u00a0Maeng, Hama: an efficient matrix computation with the mapreduce framework, in: IEEE International Conference on Cloud Computing Technology and Science, 2010, pp.\u00a0721\u2013726.","DOI":"10.1109\/CloudCom.2010.17"},{"key":"10.3233\/SW-150176_ref53","unstructured":"[53] J.\u00a0Siek, L.-Q.\u00a0Lee and A.\u00a0Lumsdaine, The Boost Graph Library: User Guide and Reference Manual, Addison-Wesley, Indianapolis, Indiana, 2002."},{"key":"10.3233\/SW-150176_ref55","doi-asserted-by":"crossref","unstructured":"[55] P.\u00a0Stutz, A.\u00a0Bernstein and W.W.\u00a0Cohen, Signal\/collect: graph algorithms for the (semantic) web, in: International Semantic Web Conference (ISWC) 2010, P.P.-S. et al., eds, LNCS, Vol.\u00a06496, Springer, Heidelberg, Shanghai, China, 2010, pp.\u00a0764\u2013780.","DOI":"10.1007\/978-3-642-17746-0_48"},{"key":"10.3233\/SW-150176_ref56","unstructured":"[56] P.\u00a0Stutz, M.\u00a0Verman, L.\u00a0Fischer and A.\u00a0Bernstein, Triplerush: a fast and scalable triple store, in: 9th International Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS 2013), CEUR-WS, Sydney, Australia, 2013, pp.\u00a050\u201365."},{"issue":"8","key":"10.3233\/SW-150176_ref57","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","article-title":"A bridging model for parallel computation","volume":"33","author":"Valiant","year":"1990","journal-title":"Commun. ACM"},{"key":"10.3233\/SW-150176_ref58","unstructured":"[58] G.\u00a0Wang, W.\u00a0Xie, A.\u00a0Demers and J.\u00a0Gehrke, Asynchronous large-scale graph processing made easy, in: Conference on Innovative Data Systems Research (CIDR), Asilomar, California, 2013."},{"issue":"1","key":"10.3233\/SW-150176_ref59","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.14778\/1453856.1453965","article-title":"Hexastore: sextuple indexing for semantic web data management","volume":"1","author":"Weiss","year":"2008","journal-title":"Proc. of the VLDB Endowment"},{"key":"10.3233\/SW-150176_ref60","unstructured":"[60] M.\u00a0Zaharia, M.\u00a0Chowdhury, M.J.\u00a0Franklin, S.\u00a0Shenker and I.\u00a0Stoica, Spark: cluster computing with working sets, in: Proc. of the 2nd USENIX Conference on Hot Topics in Cloud Computing, HotCloud\u201910, USENIX Association, Berkeley, CA, USA, 2010, p.\u00a010."},{"issue":"4","key":"10.3233\/SW-150176_ref61","doi-asserted-by":"crossref","first-page":"265","DOI":"10.14778\/2535570.2488333","article-title":"A distributed graph engine for web scale rdf data","volume":"6","author":"Zeng","year":"2013","journal-title":"Proc. VLDB Endow."},{"key":"10.3233\/SW-150176_ref62","doi-asserted-by":"crossref","unstructured":"[62] Y.\u00a0Zhang, Q.\u00a0Gao, L.\u00a0Gao and C.\u00a0Wang, imapreduce: a distributed computing framework for iterative computation, in: Proc. of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, IPDPSW \u201911, IEEE Computer Society, Washington, DC, USA, 2011, pp.\u00a01112\u20131121.","DOI":"10.1109\/IPDPS.2011.260"},{"key":"10.3233\/SW-150176_ref63","doi-asserted-by":"crossref","unstructured":"[63] Y.\u00a0Zhang, Q.\u00a0Gao, L.\u00a0Gao and C.\u00a0Wang, Priter: a distributed framework for prioritized iterative computations, in: Proc. of the 2nd ACM Symposium on Cloud Computing, SOCC \u201911, ACM, New York, NY, USA, 2011, pp.\u00a013:1\u201313:14.","DOI":"10.1145\/2038916.2038929"}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-150176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:22:55Z","timestamp":1777612975000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-150176"}},"subtitle":["Processing large graphs in seconds"],"editor":[{"given":"Andreas","family":"Hotho","sequence":"additional","affiliation":[{"name":"Universit\u00e4t W\u00fcrzburg, Germany"}],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2016,2,12]]},"references-count":57,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/sw-150176","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"value":"2210-4968","type":"electronic"},{"value":"1570-0844","type":"print"}],"subject":[],"published":{"date-parts":[[2016,2,12]]}}}