{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:54:28Z","timestamp":1773482068612,"version":"3.50.1"},"reference-count":92,"publisher":"Emerald","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2,22]]},"abstract":"<jats:p>In the last decade or so we have witnessed a growing interest in processing large data sets on large distributed clusters. The idea was pioneered by the MapReduce framework, and has been widely adopted by several other systems, including PigLatin, Hive, Scope, U-SQL, Dremmel, Spark and Myria. A large part of the complex data analysis performed by these systems consists of a sequence of relatively simple query operations, such as joining two or more tables. This survey discusses recent algorithmic developments for distributed data processing. It uses a theoretical model of parallel processing called the Massively Parallel Computation (MPC) model, which is a simplification of the BSP model where the only cost is given by the amount of communication and the number of communication rounds. The survey studies several algorithms for multi-join queries, for sorting, and for matrix multiplication, and discusses their relationships and common techniques applied across the different data processing tasks.<\/jats:p>","DOI":"10.1561\/1900000055","type":"journal-article","created":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T04:51:10Z","timestamp":1519275070000},"page":"239-370","source":"Crossref","is-referenced-by-count":9,"title":["Algorithmic Aspects of Parallel Data Processing"],"prefix":"10.1561","volume":"8","author":[{"given":"Paraschos","family":"Koutris","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison"}]},{"given":"Semih","family":"Salihoglu","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Dan","family":"Suciu","sequence":"additional","affiliation":[{"name":"University of Washington"}]}],"member":"140","published-online":{"date-parts":[[2018,2,22]]},"reference":[{"key":"2025122605561706700_ref001","doi-asserted-by":"crossref","DOI":"10.1145\/2882903.2915213","article-title":"EmptyHeaded: A Relational Engine for Graph Processing","volume-title":"SIGMOD","author":"Aberger","year":"2016"},{"issue":"4","key":"2025122605561706700_ref002","article-title":"Upper and Lower Bounds on the Cost of a Map-Reduce Computation","volume":"6","author":"Afrati","year":"2013","journal-title":"PVLDB"},{"key":"2025122605561706700_ref003","article-title":"GYM: A Multiround Distributed Join Algorithm","volume-title":"ICDT","author":"Afrati","year":"2017"},{"issue":"9","key":"2025122605561706700_ref004","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2011.47","article-title":"Optimizing multiway joins in a map-reduce environment","volume":"23","author":"Afrati","year":"2011","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"5","key":"2025122605561706700_ref005","doi-asserted-by":"crossref","DOI":"10.1147\/rd.395.0575","article-title":"A Three-dimensional Approach to Parallel Matrix Multiplication","volume":"39","author":"Agarwal","year":"1995","journal-title":"IBM Journal of Research and Development"},{"issue":"1","key":"2025122605561706700_ref006","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(90)90188-N","article-title":"Communication Complexity of PRAMs","volume":"71","author":"Aggarwal","year":"1990","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"2025122605561706700_ref007","doi-asserted-by":"crossref","DOI":"10.1145\/48529.48535","article-title":"The Input\/Output Complexity of Sorting and Related Problems","volume":"31","author":"Aggarwal","year":"1988","journal-title":"Communications of the ACM"},{"issue":"1","key":"2025122605561706700_ref008","doi-asserted-by":"crossref","DOI":"10.1007\/BF02579338","article-title":"Sorting in c log n Parallel Sets","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"issue":"4","key":"2025122605561706700_ref009","doi-asserted-by":"crossref","DOI":"10.1137\/110859440","article-title":"Size Bounds and Query Plans for Relational Joins","volume":"42","author":"Atserias","year":"2013","journal-title":"SIAM Journal on Computing"},{"key":"2025122605561706700_ref010","author":"Ballard","year":"2012"},{"key":"2025122605561706700_ref011","doi-asserted-by":"crossref","DOI":"10.21236\/ADA580140","article-title":"Communication Optimal Parallel Multiplication of Sparse Random Matrices","volume-title":"SPAA","author":"Ballard","year":"2013"},{"key":"2025122605561706700_ref012","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-34862-4_2","article-title":"Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication","volume-title":"MedAlg","author":"Ballard","year":"2012"},{"issue":"3","key":"2025122605561706700_ref013","doi-asserted-by":"crossref","DOI":"10.1137\/090769156","article-title":"Minimizing Communication in Numerical Linear Algebra","volume":"32","author":"Ballard","year":"2011","journal-title":"SIAM Journal of Matrix Analysis Applications"},{"issue":"6","key":"2025122605561706700_ref014","doi-asserted-by":"crossref","DOI":"10.1145\/2395116.2395121","article-title":"Graph Expansion and Communication Costs of Fast Matrix Multiplication","volume":"59","author":"Ballard","year":"2013","journal-title":"Journal of the ACM"},{"key":"2025122605561706700_ref015","doi-asserted-by":"crossref","DOI":"10.1145\/2902251.2902302","article-title":"Semantic Acyclicity Under Constraints","volume-title":"PODS","author":"Barcel\u00f3","year":"2016"},{"key":"2025122605561706700_ref016","doi-asserted-by":"crossref","DOI":"10.1145\/1468075.1468121","article-title":"Sorting Networks and Their Applications","volume-title":"AFIPS","author":"Batcher","year":"1968"},{"key":"2025122605561706700_ref017","doi-asserted-by":"crossref","DOI":"10.1145\/2463664.2465224","article-title":"Communication Steps for Parallel Query Processing","volume-title":"PODS","author":"Beame","year":"2013"},{"key":"2025122605561706700_ref018","doi-asserted-by":"crossref","DOI":"10.1145\/2594538.2594558","article-title":"Skew in Parallel Query Processing","volume-title":"PODS","author":"Beame","year":"2014"},{"key":"2025122605561706700_ref019","article-title":"Communication Cost in Parallel Query Processing","volume-title":"CoRR","author":"Beame","year":"2016"},{"key":"2025122605561706700_ref020","volume-title":"Algorithms and Theory of Computation Handbook, chapter 25","author":"Blelloch","year":"2010"},{"issue":"1","key":"2025122605561706700_ref021","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(85)90008-X","article-title":"Routing, Merging, and Sorting on Parallel Models of Computation","volume":"30","author":"Borodin","year":"1985","journal-title":"Journal of Computer and System Sciences"},{"key":"2025122605561706700_ref022","article-title":"Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication","volume-title":"ICPP","author":"Bulu\u00e7","year":"2008"},{"key":"2025122605561706700_ref023","volume-title":"A Cellular Computer to Implement the Kalman Filter Algorithm","author":"Cannon","year":"1969"},{"issue":"2","key":"2025122605561706700_ref024","article-title":"SCOPE: easy and efficient parallel processing of massive data sets","volume":"1","author":"Chaiken","year":"2008","journal-title":"PVLDB"},{"key":"2025122605561706700_ref025","doi-asserted-by":"crossref","DOI":"10.1145\/2213556.2213558","article-title":"What Next?: A Half-dozen Data Management Research Goals for Big Data and the Cloud","volume-title":"PODS","author":"Chaudhuri","year":"2012"},{"key":"2025122605561706700_ref026","doi-asserted-by":"crossref","DOI":"10.1145\/2723372.2750545","article-title":"From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System","volume-title":"SIGMOD","author":"Chu","year":"2015"},{"issue":"4","key":"2025122605561706700_ref027","doi-asserted-by":"crossref","DOI":"10.1137\/0217049","article-title":"Parallel Merge Sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM Journal on Computing"},{"key":"2025122605561706700_ref028","unstructured":"Michael\n              Conley\n            , AminVahdat, and GeorgePorter. TritonSort2014. http:\/\/sortbenchmark.org\/TritonSort2014.pdf."},{"issue":"1","key":"2025122605561706700_ref029","doi-asserted-by":"crossref","DOI":"10.1137\/0215006","article-title":"Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM Journal on Computing"},{"key":"2025122605561706700_ref030","doi-asserted-by":"crossref","DOI":"10.1145\/155332.155333","article-title":"LogP: Towards a Realistic Model of Parallel Computation","volume-title":"PPOPP","author":"Culler","year":"1993"},{"key":"2025122605561706700_ref031","article-title":"MapReduce: Simplified Data Processing on Large Clusters","volume-title":"OSDI","author":"Dean","year":"2004"},{"issue":"3","key":"2025122605561706700_ref032","article-title":"Parallel Matrix and Graph Algorithms","volume":"16","author":"Dekel","year":"1984","journal-title":"SIAM Journal on Computing"},{"key":"2025122605561706700_ref033","doi-asserted-by":"crossref","DOI":"10.1109\/IPDPS.2013.80","article-title":"Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication","volume-title":"IPDPS","author":"Demmel","year":"2013"},{"issue":"6","key":"2025122605561706700_ref034","doi-asserted-by":"crossref","DOI":"10.1145\/129888.129894","article-title":"Parallel Database Systems: The Future of High Performance Database Systems","volume":"35","author":"DeWitt","year":"1992","journal-title":"Communications of the ACM"},{"key":"2025122605561706700_ref035","unstructured":"EMC Corporation\n          . Data Science Revealed: A Data-Driven Glimpse into the Burgeoning New Field. http:\/\/www.emc.com\/collateral\/about\/news\/emc-data-science-study-wp.pdf."},{"issue":"4","key":"2025122605561706700_ref036","doi-asserted-by":"crossref","DOI":"10.1145\/1824777.1824786","article-title":"On Distributing Symmetric Streaming Computations","volume":"6","author":"Feldman","year":"2010","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"2025122605561706700_ref037","doi-asserted-by":"crossref","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits, and the polynomial-time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Mathematical Systems Theory"},{"issue":"1&2","key":"2025122605561706700_ref038","article-title":"Parallel Bottom-Up Processing of Datalog Queries","volume":"14","author":"Ganguly","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"2025122605561706700_ref039","volume-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"issue":"2","key":"2025122605561706700_ref040","doi-asserted-by":"crossref","DOI":"10.1137\/S0097539795294141","article-title":"Communication-Efficient Parallel Sorting","volume":"29","author":"Goodrich","year":"1999","journal-title":"SIAM Journal on Computing"},{"key":"2025122605561706700_ref041","article-title":"Sorting, Searching, and Simulation in the Mapreduce Framework","volume-title":"ISAAC","author":"Goodrich","year":"2011"},{"key":"2025122605561706700_ref042","doi-asserted-by":"crossref","DOI":"10.1145\/2902251.2902309","article-title":"Hypertree Decompositions: Questions and Answers","volume-title":"PODS","author":"Gottlob","year":"2016"},{"issue":"1","key":"2025122605561706700_ref043","doi-asserted-by":"crossref","DOI":"10.1145\/2636918","article-title":"Constraint Solving via Fractional Edge Covers","volume":"11","author":"Grohe","year":"2014","journal-title":"ACM Transactions on Algorithms"},{"key":"2025122605561706700_ref044","doi-asserted-by":"crossref","DOI":"10.1145\/2588555.2594530","article-title":"Demonstration of the Myria Big Data Management Service","volume-title":"SIGMOD","author":"Halperin","year":"2014"},{"key":"2025122605561706700_ref045","doi-asserted-by":"crossref","DOI":"10.1145\/3034786.3056110","article-title":"Output-optimal Parallel Algorithms for Similarity Joins","volume-title":"PODS","author":"Hu","year":"2017"},{"issue":"9","key":"2025122605561706700_ref046","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2011.103","article-title":"Heuristics-Based Query Processing for Large RDF Graphs Using Cloud Computing","volume":"23","author":"Husain","year":"2011","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"9","key":"2025122605561706700_ref047","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2004.03.021","article-title":"Communication Lower Bounds for Distributed-memory Matrix Multiplication","volume":"64","author":"Irony","year":"2004","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"2025122605561706700_ref048","doi-asserted-by":"crossref","DOI":"10.1145\/800076.802486","article-title":"I\/O Complexity: The Red-blue Pebble Game","volume-title":"STOC","author":"Jia-Wei","year":"1981"},{"key":"2025122605561706700_ref049","unstructured":"Jie\n              Jiang\n            , LixiongZheng, JunfengPu, XiongCheng, ChongqingZhao, Mark R.Nutter, and Jeremy D.Schaub. Tencent Sort. http:\/\/sortbenchmark.org\/TencentSort2016.pdf."},{"key":"2025122605561706700_ref050","article-title":"It\u2019s All a Matter of Degree: Using Degree Information to Optimize Multiway Joins","volume-title":"ICDT","author":"Joglekar","year":"2016"},{"issue":"11","key":"2025122605561706700_ref051","doi-asserted-by":"crossref","DOI":"10.1016\/0167-8191(93)90029-K","article-title":"Minimizing the Communication Time for Matrix Multiplication on Multiprocessors","volume":"19","author":"Johnsson","year":"1993","journal-title":"Parallel Computing"},{"key":"2025122605561706700_ref052","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24508-4","volume-title":"Boolean Function Complexity - Advances and Frontiers","author":"Jukna","year":"2012"},{"key":"2025122605561706700_ref053","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973075.76","article-title":"A Model of Computation for MapReduce","volume-title":"SODA","author":"Karloff","year":"2010"},{"key":"2025122605561706700_ref054","doi-asserted-by":"crossref","DOI":"10.1145\/3034786.3034788","article-title":"A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries","volume-title":"PODS","author":"Ketsman","year":"2017"},{"key":"2025122605561706700_ref055","doi-asserted-by":"crossref","DOI":"10.1145\/2902251.2902280","article-title":"FAQ: Questions Asked Frequently","volume-title":"PODS","author":"Khamis","year":"2016"},{"key":"2025122605561706700_ref056","article-title":"Impala: A Modern, Open-Source SQL Engine for Hadoop","volume-title":"CIDR","author":"Kornacker","year":"2015"},{"key":"2025122605561706700_ref057","article-title":"Worst-Case Optimal Algorithms for Parallel Query Processing","volume-title":"ICDT","author":"Koutris","year":"2016"},{"key":"2025122605561706700_ref058","volume-title":"Communication Complexity","author":"Kushilevitz","year":"1997"},{"issue":"3","key":"2025122605561706700_ref059","doi-asserted-by":"crossref","DOI":"10.1007\/s00778-017-0459-4","article-title":"Scalable subgraph enumeration in mapreduce: A cost-oriented approach","volume":"26","author":"Lai","year":"2017","journal-title":"The VLDB Journal"},{"key":"2025122605561706700_ref060","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"Libkin","year":"2004"},{"issue":"3","key":"2025122605561706700_ref061","article-title":"Scalable distributed subgraph enumeration","volume":"10","author":"Lai","year":"2016","journal-title":"PVLDB"},{"issue":"10","key":"2025122605561706700_ref062","doi-asserted-by":"crossref","DOI":"10.1090\/S0002-9904-1949-09320-5","article-title":"An Inequality Related to the Isoperimetric Inequality","volume":"55","author":"Loomis","year":"1949","journal-title":"Bulletin of the American Mathematical Society"},{"issue":"3","key":"2025122605561706700_ref063","article-title":"Memory-Efficient Matrix Multiplication in the BSP Model","volume":"24","author":"McColl","year":"1999","journal-title":"Algorithmica"},{"issue":"3","key":"2025122605561706700_ref064","doi-asserted-by":"crossref","DOI":"10.1145\/362875.362879","article-title":"Jr. Organizing Matrices and Matrix Operations for Paged Memory Systems","volume":"12","author":"McKellar","year":"1969","journal-title":"Communications of the ACM"},{"issue":"1","key":"2025122605561706700_ref065","article-title":"Dremel: Interactive Analysis of Web-Scale Datasets","volume":"3","author":"Melnik","year":"2010","journal-title":"PVLDB"},{"key":"2025122605561706700_ref066","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"issue":"1","key":"2025122605561706700_ref067","doi-asserted-by":"crossref","DOI":"10.1007\/s00778-009-0165-y","article-title":"The RDF-3X Engine for Scalable Management of RDF Data","volume":"19","author":"Neumann","year":"2010","journal-title":"VLDB Journal"},{"issue":"4","key":"2025122605561706700_ref068","doi-asserted-by":"crossref","DOI":"10.1145\/2590989.2590991","article-title":"Skew Strikes Back: New Developments in the Theory of Join Algorithms","volume":"42","author":"Ngo","year":"2014","journal-title":"SIGMOD Record"},{"key":"2025122605561706700_ref069","doi-asserted-by":"crossref","DOI":"10.1145\/1376616.1376726","article-title":"Pig Latin: A Not-So-Foreign Language for Data Processing","volume-title":"SIGMOD","author":"Olston","year":"2008"},{"key":"2025122605561706700_ref070","article-title":"Space-round Tradeoffs for MapReduce Computations","volume-title":"ICS","author":"Pietracaprina","year":"2012"},{"key":"2025122605561706700_ref071","volume-title":"Database management systems","author":"Ramakrishnan","year":"2003","edition":"3rd"},{"key":"2025122605561706700_ref072","doi-asserted-by":"crossref","DOI":"10.1145\/3035918.3056100","article-title":"Azure Data Lake Store: A Hyperscale Distributed File Service for Big Data Analytics","volume-title":"SIGMOD","author":"Ramakrishnan","year":"2017"},{"key":"2025122605561706700_ref073","article-title":"TritonSort: A Balanced Large-scale Sorting System","volume-title":"NSDI","author":"Rasmussen","year":"2011"},{"key":"2025122605561706700_ref074","doi-asserted-by":"crossref","DOI":"10.1145\/2935764.2935799","article-title":"Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation)","volume-title":"SPAA","author":"Roughgarden","year":"2016"},{"issue":"4","key":"2025122605561706700_ref075","doi-asserted-by":"crossref","DOI":"10.1016\/0743-7315(92)90075-X","article-title":"Parallel Sorting by Regular Sampling","volume":"14","author":"Shi","year":"1992","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"2025122605561706700_ref076","unstructured":"Sort Benchmark Home Page\n          . http:\/\/sortbenchmark.org\/."},{"key":"2025122605561706700_ref077","unstructured":"Spark SQL\n          . https:\/\/spark.apache.org\/sql\/."},{"key":"2025122605561706700_ref078","unstructured":"SPARQL Query Language for RDF\n          . https:\/\/www.w3.org\/TR\/rdf-sparql-query\/."},{"issue":"2","key":"2025122605561706700_ref079","doi-asserted-by":"crossref","DOI":"10.1006\/jcss.1997.1525","article-title":"A Query Language for NC","volume":"55","author":"Suciu","year":"1997","journal-title":"Journal of Computer and System Sciences"},{"issue":"9","key":"2025122605561706700_ref080","article-title":"Efficient Subgraph Matching on Billion Node Graphs","volume":"5","author":"Sun","year":"2012","journal-title":"PVLDB"},{"key":"2025122605561706700_ref081","article-title":"Counting triangles and the curse of the last reducer","volume-title":"WWW","author":"Suri","year":"2011"},{"key":"2025122605561706700_ref082","unstructured":"Graves\n              Thomas\n            \n          . GraySort and MinuteSort at Yahoo on Hadoop 0.23. http:\/\/sortbenchmark.org\/Yahoo2013Sort.pdf."},{"issue":"2","key":"2025122605561706700_ref083","article-title":"Hive - A Warehousing Solution Over a Map-Reduce Framework","volume":"2","author":"Thusoo","year":"2009","journal-title":"PVLDB"},{"key":"2025122605561706700_ref084","doi-asserted-by":"crossref","DOI":"10.1145\/79173.79181","article-title":"A Bridging Model for Parallel Computation","volume-title":"Communications of the ACM","author":"Valiant","year":"1990"},{"key":"2025122605561706700_ref085","article-title":"Leapfrog Triejoin: A Simple, Worst-Case Optimal Join Algorithm","volume-title":"ICDT","author":"Veldhuizen","year":"2014"},{"issue":"4","key":"2025122605561706700_ref086","doi-asserted-by":"crossref","DOI":"10.1561\/0400000014","article-title":"Algorithms and Data Structures for External Memory","volume":"2","author":"Vitter","year":"2006","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"2025122605561706700_ref087","unstructured":"Jiamang\n              Wang\n            , YongjunWu, HuaCai, ZhipengTang, ZhiqiangLv, BinLu, YangyuTao, ChaoLi, JingrenZhou, and HongTang. FuxiSort. http:\/\/sortbenchmark.org\/FuxiSort2015.pdf."},{"key":"2025122605561706700_ref088","article-title":"The Myria Big Data Management and Analytics System and Cloud Services","volume-title":"CIDR","author":"Wang","year":"2017"},{"key":"2025122605561706700_ref089","unstructured":"Reynold\n              Xin\n            , ParvizDeyhim, AliGhodsi, XiangruiMeng, and MateiZaharia. GraySort on Apache Spark by Databricks. http:\/\/sortbenchmark.org\/ApacheSpark2014.pdf."},{"key":"2025122605561706700_ref090","article-title":"Algorithms for Acyclic Database Schemes","volume-title":"VLDB","author":"Yannakakis","year":"1981"},{"key":"2025122605561706700_ref091","article-title":"Spark: Cluster Computing with Working Sets","volume-title":"HotCloud","author":"Zaharia","year":"2010"},{"issue":"4","key":"2025122605561706700_ref092","article-title":"A Distributed Graph Engine for Web Scale RDF Data","volume":"6","author":"Zeng","year":"2013","journal-title":"VLDB"}],"container-title":["Foundations and Trends in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftdbs\/article-pdf\/8\/4\/239\/11147063\/1900000055en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftdbs\/article-pdf\/8\/4\/239\/11147063\/1900000055en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T10:56:33Z","timestamp":1766746593000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftdbs\/article\/8\/4\/239\/1332143\/Algorithmic-Aspects-of-Parallel-Data-Processing"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,22]]},"references-count":92,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,2,22]]}},"URL":"https:\/\/doi.org\/10.1561\/1900000055","relation":{},"ISSN":["1931-7883","1931-7891"],"issn-type":[{"value":"1931-7883","type":"print"},{"value":"1931-7891","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,22]]}}}