{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T08:14:27Z","timestamp":1790410467932,"version":"4.1.0"},"reference-count":67,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T00:00:00Z","timestamp":1548720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["FOR 1306 Stratosphere"],"award-info":[{"award-number":["FOR 1306 Stratosphere"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["Proteus (ref. 687691) and Streamline (ref. 688191)"],"award-info":[{"award-number":["Proteus (ref. 687691) and Streamline (ref. 688191)"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003413","name":"Bundesministerium f\u00fcr Wissenschaft und Forschung","doi-asserted-by":"publisher","award":["Berlin Big Data Center BBDC (ref. 01IS14013A),"],"award-info":[{"award-number":["Berlin Big Data Center BBDC (ref. 01IS14013A),"]}],"id":[{"id":"10.13039\/501100003413","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Oracle Labs"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2019,3,31]]},"abstract":"<jats:p>Parallel dataflow engines such as Apache Hadoop, Apache Spark, and Apache Flink are an established alternative to relational databases for modern data analysis applications. A characteristic of these systems is a scalable programming model based on distributed collections and parallel transformations expressed by means of second-order functions such as map and reduce. Notable examples are Flink\u2019s DataSet and Spark\u2019s RDD programming abstractions. These programming models are realized as EDSLs\u2014domain specific languages embedded in a general-purpose host language such as Java, Scala, or Python. This approach has several advantages over traditional external DSLs such as SQL or XQuery. First, syntactic constructs from the host language (e.g., anonymous functions syntax, value definitions, and fluent syntax via method chaining) can be reused in the EDSL. This eases the learning curve for developers already familiar with the host language. Second, it allows for seamless integration of library methods written in the host language via the function parameters passed to the parallel dataflow operators. This reduces the effort for developing analytics dataflows that go beyond pure SQL and require domain-specific logic.<\/jats:p>\n          <jats:p>At the same time, however, state-of-the-art parallel dataflow EDSLs exhibit a number of shortcomings. First, one of the main advantages of an external DSL such as SQL\u2014the high-level, declarative Select-From-Where syntax\u2014is either lost completely or mimicked in a non-standard way. Second, execution aspects such as caching, join order, and partial aggregation have to be decided by the programmer. Optimizing them automatically is very difficult due to the limited program context available in the intermediate representation of the DSL.<\/jats:p>\n          <jats:p>In this article, we argue that the limitations listed above are a side effect of the adopted type-based embedding approach. As a solution, we propose an alternative EDSL design based on quotations. We present a DSL embedded in Scala and discuss its compiler pipeline, intermediate representation, and some of the enabled optimizations. We promote the algebraic type of bags in union representation as a model for distributed collections and its associated structural recursion scheme and monad as a model for parallel collection processing. At the source code level, Scala\u2019s comprehension syntax over a bag monad can be used to encode Select-From-Where expressions in a standard way. At the intermediate representation level, maintaining comprehensions as a first-class citizen can be used to simplify the design and implementation of holistic dataflow optimizations that accommodate for nesting and control-flow. The proposed DSL design therefore reconciles the benefits of embedded parallel dataflow DSLs with the declarativity and optimization potential of external DSLs like SQL.<\/jats:p>","DOI":"10.1145\/3281629","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T13:16:22Z","timestamp":1548767782000},"page":"1-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Representations and Optimizations for Embedded Parallel Dataflow Languages"],"prefix":"10.1145","volume":"44","author":[{"given":"Alexander","family":"Alexandrov","sequence":"first","affiliation":[{"name":"TU Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georgi","family":"Krastev","sequence":"additional","affiliation":[{"name":"TU Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Volker","family":"Markl","sequence":"additional","affiliation":[{"name":"TU Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,1,29]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Proceedings of the International Workshop on End-to-end Management of Big Data (BigData\u201912)","author":"Ackermann Stefan","year":"2012","unstructured":"Stefan Ackermann , Vojin Jovanovic , Tiark Rompf , and Martin Odersky . 2012 . Jet: An embedded DSL for high performance big data processing . In Proceedings of the International Workshop on End-to-end Management of Big Data (BigData\u201912) . Stefan Ackermann, Vojin Jovanovic, Tiark Rompf, and Martin Odersky. 2012. Jet: An embedded DSL for high performance big data processing. In Proceedings of the International Workshop on End-to-end Management of Big Data (BigData\u201912)."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824076"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2949741.2949754"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750543"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/278283.278285"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742797"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807148"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402755.3402761"},{"key":"e_1_2_2_9_1","volume-title":"Bird and Oege de Moor","author":"Richard","year":"1997","unstructured":"Richard S. Bird and Oege de Moor . 1997 . Algebra of Programming. Prentice Hall . Richard S. Bird and Oege de Moor. 1997. Algebra of Programming. Prentice Hall."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/42675.42676"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733016"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/181550.181564"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00024-Q"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/800296.811515"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806638"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500586"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"e_1_2_2_19_1","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201904)","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat . 2004 . MapReduce: Simplified data processing on large clusters . In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201904) . 137--150. Jeffrey Dean and Sanjay Ghemawat. 2004. MapReduce: Simplified data processing on large clusters. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201904). 137--150."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350245"},{"key":"e_1_2_2_22_1","volume-title":"IEEE International Congress on Big Data (BigData Congress) (BIGDATA CONGRESS)","author":"Fegaras L.","unstructured":"L. Fegaras and M. H. Noor . 2018. Compile-time code generation for embedded data-intensive query languages . In IEEE International Congress on Big Data (BigData Congress) (BIGDATA CONGRESS) , San Francisco, CA. 1--8. L. Fegaras and M. H. Noor. 2018. Compile-time code generation for embedded data-intensive query languages. In IEEE International Congress on Big Data (BigData Congress) (BIGDATA CONGRESS), San Francisco, CA. 1--8."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247601"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223789"},{"key":"e_1_2_2_25_1","first-page":"768","article-title":"Cluster analysis of multivariate data: Efficiency versus interpretability of classification","volume":"21","author":"Forgy E.","year":"1965","unstructured":"E. Forgy . 1965 . Cluster analysis of multivariate data: Efficiency versus interpretability of classification . Biometrics 21 , 3 (1965), 768 -- 769 . E. Forgy. 1965. Cluster analysis of multivariate data: Efficiency versus interpretability of classification. Biometrics 21, 3 (1965), 768--769.","journal-title":"Biometrics"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38735"},{"key":"e_1_2_2_27_1","first-page":"4","article-title":"Query optimization in the IBM DB2 family","volume":"16","author":"Gassner Peter","year":"1993","unstructured":"Peter Gassner , Guy M. Lohman , K. Bernhard Schiefer , and Yun Wang . 1993 . Query optimization in the IBM DB2 family . IEEE Data Eng. Bull. 16 , 4 (1993), 4 -- 18 . Peter Gassner, Guy M. Lohman, K. Bernhard Schiefer, and Yun Wang. 1993. Query optimization in the IBM DB2 family. IEEE Data Eng. Bull. 16, 4 (1993), 4--18.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_2_28_1","volume-title":"Towards a common format for computational material science data. arXiv preprint arXiv:1607.04738","author":"Ghiringhelli Luca M","year":"2016","unstructured":"Luca M Ghiringhelli , Christian Carbogno , Sergey Levchenko , Fawzi Mohamed , Georg Huhs , Martin L\u00fcders , Micael Oliveira , and Matthias Scheffler . 2016. Towards a common format for computational material science data. arXiv preprint arXiv:1607.04738 ( 2016 ). Luca M Ghiringhelli, Christian Carbogno, Sergey Levchenko, Fawzi Mohamed, Georg Huhs, Martin L\u00fcders, Micael Oliveira, and Matthias Scheffler. 2016. Towards a common format for computational material science data. arXiv preprint arXiv:1607.04738 (2016)."},{"key":"e_1_2_2_29_1","volume-title":"A List of Successes That Can Change the World\u2014Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday (Lecture Notes in Computer Science), Sam Lindley, Conor McBride, Philip W","author":"Gibbons Jeremy","unstructured":"Jeremy Gibbons . 2016. Comprehending ringads\u2014For Phil Wadler, on the occasion of his 60th birthday . In A List of Successes That Can Change the World\u2014Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday (Lecture Notes in Computer Science), Sam Lindley, Conor McBride, Philip W . Trinder, and Donald Sannella (Eds.), Vol. 9600 . 132--151. Jeremy Gibbons. 2016. Comprehending ringads\u2014For Phil Wadler, on the occasion of his 60th birthday. In A List of Successes That Can Change the World\u2014Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday (Lecture Notes in Computer Science), Sam Lindley, Conor McBride, Philip W. Trinder, and Donald Sannella (Eds.), Vol. 9600. 132--151."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628136.2628138"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_2_2_32_1","volume-title":"Proceedings of the 22nd International Symposium on Implementation and Application of Functional Languages (IFL\u201910)","volume":"6647","author":"Giorgidze George","year":"2010","unstructured":"George Giorgidze , Torsten Grust , Tom Schreiber , and Jeroen Weijers . 2010 . Haskell boards the ferry\u2014Database-supported program execution for Haskell . In Proceedings of the 22nd International Symposium on Implementation and Application of Functional Languages (IFL\u201910) (Lecture Notes in Computer Science), Jurriaan Hage and Marco T. Moraz\u00e1n (Eds.) , Vol. 6647 . 1--18. George Giorgidze, Torsten Grust, Tom Schreiber, and Jeroen Weijers. 2010. Haskell boards the ferry\u2014Database-supported program execution for Haskell. In Proceedings of the 22nd International Symposium on Implementation and Application of Functional Languages (IFL\u201910) (Lecture Notes in Computer Science), Jurriaan Hage and Marco T. Moraz\u00e1n (Eds.), Vol. 6647. 1--18."},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Torsten Grust. 1999. Comprehending Queries. Ph.D. Dissertation. Universit\u00e4t Konstanz.  Torsten Grust. 1999. Comprehending Queries. Ph.D. Dissertation. Universit\u00e4t Konstanz.","DOI":"10.1007\/978-3-322-84823-9_7"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559982"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920866"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008705026446"},{"key":"e_1_2_2_37_1","volume-title":"Proceedings of the10th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201912)","author":"Guo Zhenyu","year":"2012","unstructured":"Zhenyu Guo , Xuepeng Fan , Rishan Chen , Jiaxing Zhang , Hucheng Zhou , Sean McDirmid , Chang Liu , Wei Lin , Jingren Zhou , and Lidong Zhou . 2012 . Spotting code optimizations in data-parallel pipelines through PeriSCOPE . In Proceedings of the10th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201912) , Chandu Thekkath and Amin Vahdat (Eds.). 121--133. Zhenyu Guo, Xuepeng Fan, Rishan Chen, Jiaxing Zhang, Hucheng Zhou, Sean McDirmid, Chang Liu, Wei Lin, Jingren Zhou, and Lidong Zhou. 2012. Spotting code optimizations in data-parallel pipelines through PeriSCOPE. In Proceedings of the10th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201912), Chandu Thekkath and Amin Vahdat (Eds.). 121--133."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/242224.242477"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350244"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291201.1291209"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2658761.2658771"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596551"},{"key":"e_1_2_2_44_1","unstructured":"Aljoscha Krettek. 2015. Using Meta-Programming to Analyze and Rewrite Domain-Specific Program Code. Master\u2019s thesis. TU Berlin.  Aljoscha Krettek. 2015. Using Meta-Programming to Analyze and Rewrite Domain-Specific Program Code. Master\u2019s thesis. TU Berlin."},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500000190"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814204.2814208"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3122831.3122835"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142552"},{"key":"e_1_2_2_50_1","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases, Umeshwar Dayal, Kyu-Young Whang, David B","author":"Moerkotte Guido","unstructured":"Guido Moerkotte and Thomas Neumann . 2006. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products . In Proceedings of the 32nd International Conference on Very Large Data Bases, Umeshwar Dayal, Kyu-Young Whang, David B . Lomet, Gustavo Alonso, Guy M. Lohman, Martin L. Kersten, Sang Kyun Cha, and Young-Kuk Kim (Eds.). 930--941. Guido Moerkotte and Thomas Neumann. 2006. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products. In Proceedings of the 32nd International Conference on Very Large Data Bases, Umeshwar Dayal, Kyu-Young Whang, David B. Lomet, Gustavo Alonso, Guy M. Lohman, Martin L. Kersten, Sang Kyun Cha, and Young-Kuk Kim (Eds.). 930--941."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847538.2847541"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868294.1868314"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_2_2_56_1","volume-title":"Software for Parallel Computation","author":"Skillicorn David B.","unstructured":"David B. Skillicorn . 1993. The Bird-Meertens formalism as a parallel model . In Software for Parallel Computation . Springer , 120--133. David B. Skillicorn. 1993. The Bird-Meertens formalism as a parallel model. In Software for Parallel Computation. Springer, 120--133."},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/PMMP.1993.315549"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2584665"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224221"},{"key":"e_1_2_2_60_1","volume-title":"Proceedings of the 3rd International Workshop on Database Programming Languages: Bulk Types and Persistent Data, Paris C. Kanellakis and Joachim W. Schmidt (Eds.). 9--19","author":"Tannen Val","unstructured":"Val Tannen , Peter Buneman , and Shamim A. Naqvi . 1991. Structural recursion as a query language . In Proceedings of the 3rd International Workshop on Database Programming Languages: Bulk Types and Persistent Data, Paris C. Kanellakis and Joachim W. Schmidt (Eds.). 9--19 . Val Tannen, Peter Buneman, and Shamim A. Naqvi. 1991. Structural recursion as a query language. In Proceedings of the 3rd International Workshop on Database Programming Languages: Bulk Types and Persistent Data, Paris C. Kanellakis and Joachim W. Schmidt (Eds.). 9--19."},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687609"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/TENCON.1989.176921"},{"key":"e_1_2_2_63_1","volume-title":"Proceedings of the 3rd International Workshop on Database Programming Languages: Bulk Types and Persistent Data, Paris C. Kanellakis and Joachim W. Schmidt (Eds.). 55--68","author":"Trinder Philip W.","year":"1991","unstructured":"Philip W. Trinder . 1991 . Comprehensions, a query notation for DBPLs . In Proceedings of the 3rd International Workshop on Database Programming Languages: Bulk Types and Persistent Data, Paris C. Kanellakis and Joachim W. Schmidt (Eds.). 55--68 . Philip W. Trinder. 1991. Comprehensions, a query notation for DBPLs. In Proceedings of the 3rd International Workshop on Database Programming Languages: Bulk Types and Persistent Data, Paris C. Kanellakis and Joachim W. Schmidt (Eds.). 55--68."},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2735359"},{"key":"e_1_2_2_65_1","volume-title":"Notes on Monads and Ringads (Sept","author":"Wadler Philip","year":"1990","unstructured":"Philip Wadler . 1990. Notes on Monads and Ringads (Sept . 1990 ). Internal document, Computing Science Dept. Glasgow University . Philip Wadler. 1990. Notes on Monads and Ringads (Sept. 1990). Internal document, Computing Science Dept. Glasgow University."},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91592"},{"key":"e_1_2_2_67_1","volume-title":"Proceedings of the 1995 International Symposium on Logic Programming, John W. Lloyd (Ed.). 18--32","author":"Wadler Philip","year":"1995","unstructured":"Philip Wadler . 1995 . How to declare an imperative . In Proceedings of the 1995 International Symposium on Logic Programming, John W. Lloyd (Ed.). 18--32 . Philip Wadler. 1995. How to declare an imperative. In Proceedings of the 1995 International Symposium on Logic Programming, John W. Lloyd (Ed.). 18--32."},{"key":"e_1_2_2_68_1","volume-title":"Proceedings of HotCloud.","author":"Zaharia Matei","year":"2010","unstructured":"Matei Zaharia , Mosharaf Chowdhury , Michael J. Franklin , Scott Shenker , and Ion Stoica . 2010 . Spark: Cluster computing with working sets . In Proceedings of HotCloud. Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin, Scott Shenker, and Ion Stoica. 2010. Spark: Cluster computing with working sets. In Proceedings of HotCloud."},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0280-z"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3281629","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3281629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:10Z","timestamp":1750208530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3281629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,29]]},"references-count":67,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3,31]]}},"alternative-id":["10.1145\/3281629"],"URL":"https:\/\/doi.org\/10.1145\/3281629","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,29]]},"assertion":[{"value":"2018-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-01-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}