{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T22:18:25Z","timestamp":1770243505286,"version":"3.49.0"},"reference-count":65,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA2","license":[{"start":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T00:00:00Z","timestamp":1728345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"US NSF","doi-asserted-by":"crossref","award":["CCF-1815949"],"award-info":[{"award-number":["CCF-1815949"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2024,10,8]]},"abstract":"<jats:p>\n                    Online data services have stringent performance requirement and must tolerate workload fluctuation. This paper introduces P\n                    <jats:sc>it<\/jats:sc>\n                    S\n                    <jats:sc>top<\/jats:sc>\n                    , a new query language runtime design built on the idea of\n                    <jats:italic toggle=\"yes\">interruptible query processing<\/jats:italic>\n                    : the time-consuming task of data inspection for processing each query or update may be interrupted and resumed later at the boundary of fine-grained data partitions. This counter-intuitive idea enables a novel form of\n                    <jats:italic toggle=\"yes\">fine-grained concurrency<\/jats:italic>\n                    while preserving\n                    <jats:italic toggle=\"yes\">sequential consistency<\/jats:italic>\n                    . We build P\n                    <jats:sc>it<\/jats:sc>\n                    S\n                    <jats:sc>top<\/jats:sc>\n                    through modifying the language runtime of Cypher, the query language of a state-of-the-art graph database, Neo4j. Our evaluation on the Google Cloud shows that P\n                    <jats:sc>it<\/jats:sc>\n                    S\n                    <jats:sc>top<\/jats:sc>\n                    can outperform unmodified Neo4j during workload fluctuation, with reduced latency and increased throughput.\n                  <\/jats:p>","DOI":"10.1145\/3689772","type":"journal-article","created":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T03:23:04Z","timestamp":1728357784000},"page":"1729-1756","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Runtime System for Interruptible Query Processing: When Incremental Computing Meets Fine-Grained Parallelism"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0082-910X","authenticated-orcid":false,"given":"Jeff","family":"Eymer","sequence":"first","affiliation":[{"name":"SUNY Binghamton, Binghamton, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5920-7442","authenticated-orcid":false,"given":"Philip","family":"Dexter","sequence":"additional","affiliation":[{"name":"SUNY Binghamton, Binghamton, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3694-8207","authenticated-orcid":false,"given":"Joseph","family":"Raskind","sequence":"additional","affiliation":[{"name":"SUNY Binghamton, Binghamton, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2768-3898","authenticated-orcid":false,"given":"Yu David","family":"Liu","sequence":"additional","affiliation":[{"name":"SUNY Binghamton, Binghamton, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,10,8]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"[n. d.]. Github Archive. http:\/\/www.githubarchive.org."},{"key":"e_1_3_1_3_2","unstructured":"[n. d.]. Neo4j Graph Database. http:\/\/www.neo4j.org."},{"key":"e_1_3_1_4_2","unstructured":"[n. d.]. Stack Exchange Data Dump. https:\/\/archive.org\/details\/stackexchange."},{"issue":"6","key":"e_1_3_1_5_2","article-title":"Adaptive Functional Programming","volume":"28","author":"Acar Umut A.","year":"2006","unstructured":"Umut A. Acar, Guy E. Blelloch, and Robert Harper. 2006. Adaptive Functional Programming. ACM Trans. Program. Lang. Syst. 28, 6 (Nov. 2006). https:\/\/doi.org\/10.1145\/1186632.1186634 10.1145\/1186632.1186634","journal-title":"ACM Trans. Program. Lang. Syst"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1086.001.0001"},{"key":"e_1_3_1_7_2","unstructured":"akka [n. d.]. Scala Akka https:\/\/akka.io\/."},{"issue":"7","key":"e_1_3_1_8_2","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/359636.359715","article-title":"Lucid, a nonprocedural language with iteration","volume":"20","author":"Ashcroft E. A.","year":"1977","unstructured":"E. A. Ashcroft and W. W. Wadge. 1977. Lucid, a nonprocedural language with iteration. Commun. ACM 20, 7 (July 1977), 8. https:\/\/doi.org\/10.1145\/359636.359715 10.1145\/359636.359715","journal-title":"Commun. ACM"},{"key":"e_1_3_1_9_2","first-page":"225","article-title":"MonetDB\/X100: Hyper-Pipelining Query Execution","volume":"5","author":"Boncz Peter A","year":"2005","unstructured":"Peter A Boncz, Marcin Zukowski, and Niels Nes. 2005. MonetDB\/X100: Hyper-Pipelining Query Execution. In Cidr, Vol. 5. 225-237.","journal-title":"In Cidr"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687659"},{"key":"e_1_3_1_11_2","doi-asserted-by":"crossref","unstructured":"P. Caspi D. Pilaud N. Halbwachs and J. A. Plaice. 1987. LUSTRE: a declarative language for real-time programming. In POPL \u201987. 178-188. https:\/\/doi.org\/10.1145\/41625.41641 10.1145\/41625.41641","DOI":"10.1145\/41625.41641"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502045"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/1387589.1387613"},{"key":"e_1_3_1_14_2","first-page":"931","article-title":"Sloth: Being Lazyis a Virtue (when Issuing Database Queries)","volume":"14","author":"Cheung Alvin","year":"2014","unstructured":"Alvin Cheung, Samuel Madden, and Armando Solar-Lezama. 2014. Sloth: Being Lazyis a Virtue (when Issuing Database Queries). In SIGMOD \u201914. 931-942. https:\/\/doi.org\/10.1145\/2894749 10.1145\/2894749","journal-title":"SIGMOD"},{"key":"e_1_3_1_15_2","first-page":"137","volume-title":"OSDI\u201904","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat. 2004. MapReduce: Simplified Data Processing on Large Clusters. In OSDI\u201904. San Francisco, CA, 137-150. https:\/\/doi.org\/10.1145\/1327452.1327492 10.1145\/1327452.1327492"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3563320"},{"key":"e_1_3_1_17_2","unstructured":"Jeff Eymer Philip Dexter Joseph Raskind and Yu David Liu. [n. d.]. PitStop Supplementary Material (https:\/\/www.cs.binghamton.edu\/~davidl\/papers\/OOPSLA24Sup.pdf). Technical Report."},{"key":"e_1_3_1_18_2","unstructured":"Jeff Eymer Phillip Dexter Joseph Raskind and YuDavidLiu. 2024. A Runtime System for Interruptible Query Processing: When Incremental Computing Meets Fine- Grained Parallelism - Artifact. https:\/\/doi.org\/10.5281\/zenodo.13372050 10.5281\/zenodo.13372050"},{"key":"e_1_3_1_19_2","first-page":"15","volume-title":"SIGMOD\u201914","author":"Faleiro Jose M","year":"2014","unstructured":"Jose M Faleiro, Alexander Thomson, and Daniel J Abadi. 2014. Lazy evaluation of transactions in database systems. In SIGMOD\u201914. ACM, 15-26. https:\/\/doi.org\/10.1145\/2588555.2610529 10.1145\/2588555.2610529"},{"key":"e_1_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Lu Fang Khanh Nguyen Guoqing Xu Brian Demsky andShanLu. 2015. Interruptible Tasks: Treating Memory Pressure as Interrupts for Highly Scalable Data-Parallel Programs. In SOSP\u201915. 394-409. https:\/\/doi.org\/10.1145\/2815400.2815407 10.1145\/2815400.2815407","DOI":"10.1145\/2815400.2815407"},{"key":"e_1_3_1_21_2","doi-asserted-by":"crossref","unstructured":"Wei Fang ZhiHui Lu Jie Wu and ZhenYin Cao. 2012. RPPS: A Novel Resource Prediction and Provisioning Scheme in Cloud Data Center. In 2012 IEEE Ninth International Conference on Services Computing. 609-616. https:\/\/doi.org\/10.1109\/SCC.2012.47 10.1109\/SCC.2012.47","DOI":"10.1109\/SCC.2012.47"},{"key":"e_1_3_1_22_2","doi-asserted-by":"crossref","unstructured":"Nadime Francis Alastair Green Paolo Guagliardo Leonid Libkin Tobias Lindaaker Victor Marsault Stefan Plantikow Mats Rydberg Petra Selmer and Andr\u00e9s Taylor. 2018. Cypher: An Evolving Query Language for Property Graphs. In SIGMOD\u201918. 1433-1445. https:\/\/doi.org\/10.1145\/3183713.3190657 10.1145\/3183713.3190657","DOI":"10.1145\/3183713.3190657"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168654"},{"key":"e_1_3_1_25_2","doi-asserted-by":"crossref","unstructured":"Georgios Giannikis Philipp Unterbrunner Jeremy Meyer Gustavo Alonso Dietmar Fauser and Donald Kossmann. 2010. Crescando. In SIGMOD\u201910 (SIGMOD\u201910). 1227-1230. https:\/\/doi.org\/10.1145\/1807167.1807326 10.1145\/1807167.1807326","DOI":"10.1145\/1807167.1807326"},{"key":"e_1_3_1_26_2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/IISWC.2007.4362193","article-title":"Workload Analysis and Demand Prediction of Enterprise Data Center Applications","author":"Gmach Daniel","year":"2007","unstructured":"Daniel Gmach, Jerry Rolia, Ludmila Cherkasova, and Alfons Kemper. 2007. Workload Analysis and Demand Prediction of Enterprise Data Center Applications. In 2007 IEEE 10th International Symposium on Workload Characterization. 171-180. https:\/\/doi.org\/10.1109\/IISWC.2007.4362193 10.1109\/IISWC.2007.4362193","journal-title":"2007 IEEE 10th International Symposium on Workload Characterization"},{"key":"e_1_3_1_27_2","first-page":"140","volume-title":"The transaction concept: virtues and limitations","author":"Gray Jim","year":"1988","unstructured":"Jim Gray . 1988. The transaction concept: virtues and limitations. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 140-150. https:\/\/doi.org\/10.5555\/48751.48761 10.5555\/48751.48761"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352139"},{"key":"e_1_3_1_29_2","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1109\/INFCOM.2011.5934917","article-title":"Managing cost, performance, and reliability tradeoffs for energy-aware server provisioning","author":"Guenter Brian","year":"2011","unstructured":"Brian Guenter, Navendu Jain, and Charles Williams. 2011. Managing cost, performance, and reliability tradeoffs for energy-aware server provisioning. In 2011 Proceedings IEEE INFOCOM. 1332-1340. https:\/\/doi.org\/10.1109\/INFCOM.2011.5934917 10.1109\/INFCOM.2011.5934917","journal-title":"2011 Proceedings IEEE INFOCOM"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/289.291"},{"key":"e_1_3_1_31_2","article-title":"A programming model and foundation for lineage-based distributed computation","volume":"28","author":"Haller Philipp","year":"2018","unstructured":"Philipp Haller, Heather Miller, and Normen M\u00fcller. 2018. A programming model and foundation for lineage-based distributed computation. Journal of Functional Programming 28 (2018). https:\/\/doi.org\/10.1017\/S0956796818000035 10.1017\/S0956796818000035","journal-title":"Journal of Functional Programming"},{"key":"e_1_3_1_32_2","doi-asserted-by":"crossref","unstructured":"Matthew A. Hammer Khoo Yit Phang Michael Hicks and Jeffrey S. Foster. 2014. Adapton: Composable Demand-driven Incremental Computation. In Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201914). https:\/\/doi.org\/10.1145\/2666356.2594324 10.1145\/2666356.2594324","DOI":"10.1145\/2594291.2594324"},{"key":"e_1_3_1_33_2","first-page":"383","volume-title":"In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data (SIGMOD\u201905)","author":"Harizopoulos Stavros","year":"2005","unstructured":"Stavros Harizopoulos, Vladislav Shkapenyuk, and Anastassia Ailamaki. 2005. QPipe: A Simultaneously Pipelined Relational Query Engine. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data (SIGMOD\u201905). Association for Computing Machinery, New York, NY, USA, 383-394. https:\/\/doi.org\/10.1145\/1066157.1066201 10.1145\/1066157.1066201"},{"key":"e_1_3_1_34_2","volume-title":"In 30th European Conference on Object-Oriented Programming","author":"Harkes Daco C","year":"2016","unstructured":"Daco C Harkes, Danny M Groenewegen, and Eelco Visser. 2016. IceDust: Incremental and Eventual Computation of Derived Values. In 30th European Conference on Object-Oriented Programming. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2016.11 10.4230\/LIPIcs.ECOOP.2016.11"},{"key":"e_1_3_1_35_2","volume-title":"In 31st European Conference on Object-Oriented Programming","author":"Harkes Daco C","year":"2017","unstructured":"Daco C Harkes and Eelco Visser. 2017. IceDust 2: Derived Bidirectional Relations and Calculation Strategy Composition. In 31st European Conference on Object-Oriented Programming. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/DARTS.3.2.1 10.4230\/DARTS.3.2.1"},{"key":"e_1_3_1_36_2","doi-asserted-by":"crossref","unstructured":"Carl Hewitt Peter Bishop Irene Greif Brian Smith Todd Matson and Richard Steiger. 1973. Actor Induction and Meta-Evaluation. In Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL\u201973). 153-168. https:\/\/doi.org\/10.1145\/512927.512942 10.1145\/512927.512942","DOI":"10.1145\/512927.512942"},{"key":"e_1_3_1_37_2","first-page":"345","volume-title":"Shinjuku: Preemptive Scheduling for second-Scale Tail Latency (NSDI\u201919)","author":"Kaffes Kostis","year":"2019","unstructured":"Kostis Kaffes, Timothy Chong, Jack Tigar Humphries, Adam Belay, David Mazieres, and Christos Kozyrakis. 2019. Shinjuku: Preemptive Scheduling for second-Scale Tail Latency (NSDI\u201919). USENIX Association, USA, 345-359. https:\/\/doi.org\/10.5555\/3323234.3323264 10.5555\/3323234.3323264"},{"key":"e_1_3_1_38_2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/MC.2007.328","article-title":"Online Experiments: Lessons Learned","volume":"40","author":"Kohavi Ron","year":"2007","unstructured":"Ron Kohavi and Roger Longbotham. 2007. Online Experiments: Lessons Learned. IEEE Computer 40 (10 2007), 103-105. https:\/\/doi.org\/10.1109\/MC.2007.328 10.1109\/MC.2007.328","journal-title":"IEEE Computer"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.232562"},{"key":"e_1_3_1_40_2","first-page":"591","article-title":"What is Twitter, a social network or a news media?","author":"Kwak Haewoon","year":"2010","unstructured":"Haewoon Kwak, Changhyun Lee, Hosung Park, and Sue Moon. 2010. What is Twitter, a social network or a news media?. In WWW\u201910. 591-600.","journal-title":"WWW\u201910"},{"key":"e_1_3_1_41_2","doi-asserted-by":"crossref","unstructured":"Lamport. 1979. How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs. IEEE Trans. Comput. C-28 9 (1979) 690-691. https:\/\/doi.org\/10.1109\/TC.1979.1675439 10.1109\/TC.1979.1675439","DOI":"10.1109\/TC.1979.1675439"},{"key":"e_1_3_1_42_2","unstructured":"Brandon Lucia Vignesh Balaji Alexei Colin Kiwan Maeng and Emily Ruppel. 2017. Intermittent Computing: Challenges and Opportunities. In 2nd Summit on Advances in Programming Languages SNAPL 2017 May 7-10 2017 Asilomar CA USA (LIPIcs) Benjamin S. Lerner Rastislav Bodik and Shriram Krishnamurthi (Eds.) Vol. 71. 8:1-8:14. https:\/\/doi.org\/10.4230\/LIPIcs.SNAPL.2017.8 10.4230\/LIPIcs.SNAPL.2017.8"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.aba3758"},{"key":"e_1_3_1_44_2","first-page":"1","volume-title":"Proceedings of the 24th ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA\u201909)","author":"Meyerovich Leo A.","year":"2009","unstructured":"Leo A. Meyerovich, Arjun Guha, Jacob Baskin, Gregory H. Cooper, Michael Greenberg, Aleks Bromfield, and Shriram Krishnamurthi. 2009. Flapjax: A Programming Language for Ajax Applications. In Proceedings of the 24th ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA\u201909). ACM, New York, NY, USA, 1-20. https:\/\/doi.org\/10.1145\/1640089.1640091 10.1145\/1640089.1640091"},{"key":"e_1_3_1_45_2","first-page":"15","article-title":"Optimizing distributed actor systems for dynamic interactive services","author":"Newell Andrew","year":"2016","unstructured":"Andrew Newell, Gabriel Kliot, Ishai Menache, Aditya Gopalan, Soramichi Akiyama, and Mark Silberstein. 2016. Optimizing distributed actor systems for dynamic interactive services. In Proceedings of the Eleventh European Conference on Computer Systems (EuroSys\u201916). Article 38, 15 pages. https:\/\/doi.org\/10.1145\/2901318.2901343 10.1145\/2901318.2901343","journal-title":"Proceedings of the Eleventh European Conference on Computer Systems (EuroSys\u201916)"},{"key":"e_1_3_1_46_2","unstructured":"orangefs [n. d.]. The OrangeFS Project http:\/\/www.orangefs.org\/."},{"key":"e_1_3_1_47_2","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/ICDE.1988.105474","article-title":"Using common subexpressions to optimize multiple queries","author":"Park J.","year":"1988","unstructured":"J. Park and A. Segev. 1988. Using common subexpressions to optimize multiple queries. In Proceedings. Fourth International Conference on Data Engineering. 311-319. https:\/\/doi.org\/10.1109\/ICDE.1988.105474 10.1109\/ICDE.1988.105474","journal-title":"Proceedings. Fourth International Conference on Data Engineering"},{"key":"e_1_3_1_48_2","doi-asserted-by":"crossref","DOI":"10.1145\/75277.75305","article-title":"Incremental Computation via Function Caching","author":"Pugh W.","year":"1989","unstructured":"W. Pugh and T. Teitelbaum. 1989. Incremental Computation via Function Caching. In Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201989). https:\/\/doi.org\/10.1145\/75277.75305 10.1145\/75277.75305","journal-title":"Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201989)"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/356725.356729"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.5555\/1543483"},{"key":"e_1_3_1_51_2","first-page":"249","article-title":"Efficient and Extensible Algorithms for Multi Query Optimization","author":"Prasan Roy","year":"2000","unstructured":"Prasan Roy, S. Seshadri, S. Sudarshan, and Siddhesh Bhobe. 2000. Efficient and Extensible Algorithms for Multi Query Optimization. In SIGMOD\u201900. 249-260. https:\/\/doi.org\/10.1145\/342009.335419 10.1145\/342009.335419","journal-title":"SIGMOD\u201900"},{"key":"e_1_3_1_52_2","first-page":"15","article-title":"PLASMA: programmable elasticity for stateful cloud computing applications","author":"Sang Bo","year":"2020","unstructured":"Bo Sang, Pierre-Louis Roman, Patrick Eugster, Hui Lu, Srivatsan Ravi, and Gustavo Petri. 2020. PLASMA: programmable elasticity for stateful cloud computing applications. In Proceedings of the Fifteenth European Conference on Computer Systems (EuroSys\u201920). Article 42, 15 pages. https:\/\/doi.org\/10.1145\/3342195.3387553 10.1145\/3342195.3387553","journal-title":"Proceedings of the Fifteenth European Conference on Computer Systems (EuroSys\u201920)"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42203"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42203"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796814000161"},{"key":"e_1_3_1_56_2","first-page":"211","volume-title":"Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems and Applications (OOPSLA\u201907)","author":"Spring Jesper H.","year":"2007","unstructured":"Jesper H. Spring, Jean Privat, Rachid Guerraoui, and Jan Vitek. 2007. Streamflex: High-Throughput Stream Programming in Java. In Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems and Applications (OOPSLA\u201907). Association for Computing Machinery, New York, NY, USA, 211-228. https:\/\/doi.org\/10.1145\/1297027.1297043 10.1145\/1297027.1297043"},{"key":"e_1_3_1_57_2","volume-title":"Distributed Systems: Principles and Paradigms","author":"Tanenbaum Andrew S.","year":"2006","unstructured":"Andrew S. Tanenbaum and Maarten van Steen. 2006. Distributed Systems: Principles and Paradigms (2nd Edition). Prentice-Hall, Inc., USA. https:\/\/doi.org\/10.5555\/1202502 10.5555\/1202502","edition":"2"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.5555\/647478.727935"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687707"},{"key":"e_1_3_1_60_2","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/978-3-662-44202-9_15","volume-title":"ECOOP 2014 - Object-Oriented Programming","author":"Vaziri Mandana","year":"2014","unstructured":"Mandana Vaziri, Olivier Tardieu, Rodric Rabbah, Philippe Suter, and Martin Hirzel. 2014. Stream Processing with a Spreadsheet. In ECOOP 2014 - Object-Oriented Programming, Richard Jones (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 360-384. https:\/\/doi.org\/10.1007\/978-3-662-44202-9_15 10.1007\/978-3-662-44202-9_15"},{"key":"e_1_3_1_61_2","first-page":"237","article-title":"KickStarter: Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations","author":"Vora Keval","year":"2017","unstructured":"Keval Vora, Rajiv Gupta, and Guoqing Xu. 2017. KickStarter: Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations. In ASPLOS\u201917. 237-251. https:\/\/doi.org\/10.1145\/3093337.3037748 10.1145\/3093337.3037748","journal-title":"ASPLOS\u201917"},{"key":"e_1_3_1_62_2","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/502034.502057","volume-title":"SOSP\u201901","author":"Welsh Matt","year":"2001","unstructured":"Matt Welsh, David E. Culler, and Eric A. Brewer. 2001. SEDA: An Architecture for Well-Conditioned, Scalable Internet Services. In SOSP\u201901, Keith Marzullo and Mahadev Satyanarayanan (Eds.). ACM, 230-243. https:\/\/doi.org\/10.1145\/502059.502057 10.1145\/502059.502057"},{"key":"e_1_3_1_63_2","first-page":"562","article-title":"Pipelining in query execution","author":"Wilschut A.N.","year":"1990","unstructured":"A.N. Wilschut and P.M.G. Apers. 1990. Pipelining in query execution. In Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications. 562-. https:\/\/doi.org\/10.1109\/PARBSE.1990.77227 10.1109\/PARBSE.1990.77227","journal-title":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/2934664"},{"key":"e_1_3_1_65_2","first-page":"191","volume-title":"SIGMOD\u201904","author":"Zhou Jingren","year":"2004","unstructured":"Jingren Zhou and Kenneth A Ross. 2004. Buffering databse operations for enhanced instruction cache performance. In SIGMOD\u201904. ACM, 191-202. https:\/\/doi.org\/10.1145\/1007568.1007592 10.1145\/1007568.1007592"},{"key":"e_1_3_1_66_2","volume-title":"In VLDB\u201907","author":"Zukowski Marcin","year":"2007","unstructured":"Marcin Zukowski, Sandor Heman, Niels Nes, and Peter Boncz. 2007. Cooperative Scans: Dynamic Bandwidth Sharing in a DBMS. In VLDB\u201907. VLDB Endowment. https:\/\/doi.org\/10.5555\/1325851.1325934 10.5555\/1325851.1325934"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689772","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T09:05:22Z","timestamp":1770195922000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,8]]},"references-count":65,"journal-issue":{"issue":"OOPSLA2","published-print":{"date-parts":[[2024,10,8]]}},"alternative-id":["10.1145\/3689772"],"URL":"https:\/\/doi.org\/10.1145\/3689772","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,8]]},"assertion":[{"value":"2024-04-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}