{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:34Z","timestamp":1775638474510,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2008815"],"award-info":[{"award-number":["2008815"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0012160"],"award-info":[{"award-number":["DE-SC0012160"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3452840","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"804-816","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["COMPASS: Online Sketch-based Query Optimization for In-Memory Databases"],"prefix":"10.1145","author":[{"given":"Yesdaulet","family":"Izenov","sequence":"first","affiliation":[{"name":"University of California Merced, Merced, CA, USA"}]},{"given":"Asoke","family":"Datta","sequence":"additional","affiliation":[{"name":"University of California Merced, Merced, CA, USA"}]},{"given":"Florin","family":"Rusu","sequence":"additional","affiliation":[{"name":"University of California Merced, Merced, CA, USA"}]},{"given":"Jun Hyung","family":"Shin","sequence":"additional","affiliation":[{"name":"University of California Merced, Merced, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"10","volume-title":"Tracking Join and Self-Join Sizes in Limited Storage. In PODS","author":"Alon N.","year":"1999","unstructured":"N. Alon , P. B. Gibbons , Y. Matias , and M. Szegedy . Tracking Join and Self-Join Sizes in Limited Storage. In PODS 1999 , pages 10 -- 20 . N. Alon, P. B. Gibbons, Y. Matias, and M. Szegedy. Tracking Join and Self-Join Sizes in Limited Storage. In PODS 1999, pages 10--20."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335420"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319894"},{"key":"e_1_3_2_2_4_1","first-page":"34","volume-title":"An Overview of Query Optimization in Relational Systems. In PODS","author":"Chaudhuri S.","year":"1998","unstructured":"S. Chaudhuri . An Overview of Query Optimization in Relational Systems. In PODS 1998 , pages 34 -- 43 . S. Chaudhuri. An Overview of Query Optimization in Relational Systems. In PODS 1998, pages 34--43."},{"key":"e_1_3_2_2_5_1","first-page":"13","volume-title":"Sketching Streams Through the Net: Distributed Approximate Query Tracking. In VLDB","author":"Cormode G.","year":"2005","unstructured":"G. Cormode and M. Garofalakis . Sketching Streams Through the Net: Distributed Approximate Query Tracking. In VLDB 2005 , pages 13 -- 24 . G. Cormode and M. Garofalakis. Sketching Streams Through the Net: Distributed Approximate Query Tracking. In VLDB 2005, pages 13--24."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000004"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1331939.1331940"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564699"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_32"},{"issue":"9","key":"e_1_3_2_2_10_1","first-page":"1044","volume":"12","author":"Dutt A.","year":"2019","unstructured":"A. Dutt , C. Wang , A. Nazi , S. Kandula , V. Narasayya , and S. Chaudhuri . Selectivity Estimation for Range Predicates Using Lightweight Models. PVLDB , 12 ( 9 ): 1044 -- 1057 , 2019 . A. Dutt, C. Wang, A. Nazi, S. Kandula, V. Narasayya, and S. Chaudhuri. Selectivity Estimation for Range Predicates Using Lightweight Models. PVLDB, 12(9):1044--1057, 2019.","journal-title":"Selectivity Estimation for Range Predicates Using Lightweight Models. PVLDB"},{"key":"e_1_3_2_2_11_1","volume-title":"Multi-Attribute Selectivity Estimation Using Deep Learning. CoRR, arXiv:1903.09999v2","author":"Hasan S.","year":"2019","unstructured":"S. Hasan , S. Thirumuruganathan , J. Augustine , N. Koudas , and G. Das . Multi-Attribute Selectivity Estimation Using Deep Learning. CoRR, arXiv:1903.09999v2 , 2019 . S. Hasan, S. Thirumuruganathan, J. Augustine, N. Koudas, and G. Das. Multi-Attribute Selectivity Estimation Using Deep Learning. CoRR, arXiv:1903.09999v2, 2019."},{"key":"e_1_3_2_2_12_1","first-page":"1477","volume-title":"GPU-Accelerated Kernel Density Models for Multidimensional Selectivity Estimation. In SIGMOD","author":"Heimel M.","year":"2015","unstructured":"M. Heimel , M. Kiefer , and V. Markl . Self-Tuning , GPU-Accelerated Kernel Density Models for Multidimensional Selectivity Estimation. In SIGMOD 2015 , pages 1477 -- 1492 . M. Heimel, M. Kiefer, and V. Markl. Self-Tuning, GPU-Accelerated Kernel Density Models for Multidimensional Selectivity Estimation. In SIGMOD 2015, pages 1477--1492."},{"issue":"1","key":"e_1_3_2_2_13_1","first-page":"40","volume":"35","author":"Idreos S.","year":"2012","unstructured":"S. Idreos , F. Groffen , N. Nes , S. Manegold , S. Mullender , and M. Kersten . MonetDB: Two Decades of Research in Column-oriented Database Architectures. IEEE Data Engineering Bulletin , 35 ( 1 ): 40 -- 45 , 2012 . S. Idreos, F. Groffen, N. Nes, S. Manegold, S. Mullender, and M. Kersten. MonetDB: Two Decades of Research in Column-oriented Database Architectures. IEEE Data Engineering Bulletin, 35(1):40--45, 2012.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/119995.115835"},{"key":"e_1_3_2_2_15_1","volume-title":"Online Sketch-based Query Optimization. CoRR, arXiv:2102.02440","author":"Izenov Y.","year":"2021","unstructured":"Y. Izenov , A. Datta , F. Rusu , and J. H. Shin . Online Sketch-based Query Optimization. CoRR, arXiv:2102.02440 , 2021 . Y. Izenov, A. Datta, F. Rusu, and J. H. Shin. Online Sketch-based Query Optimization. CoRR, arXiv:2102.02440, 2021."},{"key":"e_1_3_2_2_16_1","first-page":"106","volume-title":"Efficient Mid-query Re-optimization of Sub-optimal Query Execution Plans. In SIGMOD","author":"Kabra N.","year":"1998","unstructured":"N. Kabra and D. J. DeWitt . Efficient Mid-query Re-optimization of Sub-optimal Query Execution Plans. In SIGMOD 1998 , pages 106 -- 117 . N. Kabra and D. J. DeWitt. Efficient Mid-query Re-optimization of Sub-optimal Query Execution Plans. In SIGMOD 1998, pages 106--117."},{"key":"e_1_3_2_2_17_1","first-page":"615","volume-title":"Keulen. ROX: Run-time Optimization of XQueries. In SIGMOD","author":"Kader A. R.","year":"2009","unstructured":"A. R. Kader , P. Boncz , S. Manegold , and M. van Keulen. ROX: Run-time Optimization of XQueries. In SIGMOD 2009 , pages 615 -- 626 . A. R. Kader, P. Boncz, S. Manegold, and M. van Keulen. ROX: Run-time Optimization of XQueries. In SIGMOD 2009, pages 615--626."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151112"},{"key":"e_1_3_2_2_19_1","volume-title":"Learned Cardinalities:Estimating Correlated Joins with Deep Learning. In CIDR","author":"Kipf A.","year":"2019","unstructured":"A. Kipf , T. Kipf , B. Radke , V. Leis , P. Boncz , and A. Kemper . Learned Cardinalities:Estimating Correlated Joins with Deep Learning. In CIDR 2019 . A. Kipf, T. Kipf, B. Radke, V. Leis, P. Boncz, and A. Kemper. Learned Cardinalities:Estimating Correlated Joins with Deep Learning. In CIDR 2019."},{"key":"e_1_3_2_2_20_1","volume-title":"Estimating Cardinalities with Deep Sketches. CoRR, arXiv:1904.08223v1","author":"Kipf A.","year":"2019","unstructured":"A. Kipf , D. Vorona , J. Muller , T. Kipf , B. Radke , V. Leis , P. Boncz , T. Neumann , and A. Kemper . Estimating Cardinalities with Deep Sketches. CoRR, arXiv:1904.08223v1 , 2019 . A. Kipf, D. Vorona, J. Muller, T. Kipf, B. Radke, V. Leis, P. Boncz, T. Neumann, and A. Kemper. Estimating Cardinalities with Deep Sketches. CoRR, arXiv:1904.08223v1, 2019."},{"key":"e_1_3_2_2_21_1","first-page":"489","volume-title":"The Case for Learned Index Structures. In SIGMOD","author":"Kraska T.","year":"2018","unstructured":"T. Kraska , A. Beutel , E. H. Chi , J. Dean , and N. Polyzotis . The Case for Learned Index Structures. In SIGMOD 2018 , pages 489 -- 504 . T. Kraska, A. Beutel, E. H. Chi, J. Dean, and N. Polyzotis. The Case for Learned Index Structures. In SIGMOD 2018, pages 489--504."},{"key":"e_1_3_2_2_22_1","volume-title":"Learning to Optimize Join Queries With Deep Reinforcement Learning. CoRR, arXiv:1808.03196v2","author":"Krishnan S.","year":"2018","unstructured":"S. Krishnan , Z. Yang , K. Goldberg , J. Hellerstein , and I. Stoica . Learning to Optimize Join Queries With Deep Reinforcement Learning. CoRR, arXiv:1808.03196v2 , 2018 . S. Krishnan, Z. Yang, K. Goldberg, J. Hellerstein, and I. Stoica. Learning to Optimize Join Queries With Deep Reinforcement Learning. CoRR, arXiv:1808.03196v2, 2018."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_3_2_2_24_1","volume-title":"Cardinality Estimation Done Right: Index-Based Join Sampling. In CIDR","author":"Leis V.","year":"2017","unstructured":"V. Leis , B. Radke , A. Gubichev , A. Kemper , and T. Neumann . Cardinality Estimation Done Right: Index-Based Join Sampling. In CIDR 2017 . V. Leis, B. Radke, A. Gubichev, A. Kemper, and T. Neumann. Cardinality Estimation Done Right: Index-Based Join Sampling. In CIDR 2017."},{"key":"e_1_3_2_2_25_1","first-page":"643","article-title":"Query Optimization Through the Looking Glass, and What We Found Running the Jo","volume":"27","author":"Leis V.","year":"2018","unstructured":"V. Leis , B. Radke , A. Gubichev , A. Mirchev , P. Boncz , A. Kemper , and T. Neumann . Query Optimization Through the Looking Glass, and What We Found Running the Jo in Order Benchmark. VLDB Journal , 27 : 643 -- 668 , 2018 . V. Leis, B. Radke, A. Gubichev, A. Mirchev, P. Boncz, A. Kemper, and T. Neumann. Query Optimization Through the Looking Glass, and What We Found Running the Join Order Benchmark. VLDB Journal, 27:643--668, 2018.","journal-title":"Order Benchmark. VLDB Journal"},{"key":"e_1_3_2_2_26_1","first-page":"53","volume-title":"Cardinality Estimation Using Neural Networks. In CASCON","author":"Liu H.","year":"2015","unstructured":"H. Liu , M. Xu , Z. Yu , V. Corvinelli , and C. Zuzarte . Cardinality Estimation Using Neural Networks. In CASCON 2015 , pages 53 -- 59 . H. Liu, M. Xu, Z. Yu, V. Corvinelli, and C. Zuzarte. Cardinality Estimation Using Neural Networks. In CASCON 2015, pages 53--59."},{"key":"e_1_3_2_2_27_1","volume-title":"CIDR","author":"Malik T.","year":"2007","unstructured":"T. Malik , R. C. Burns , and N. V. Chawla . A Black-Box Approach to Query Cardinality Estimation . In CIDR 2007 . T. Malik, R. C. Burns, and N. V. Chawla. A Black-Box Approach to Query Cardinality Estimation. In CIDR 2007."},{"issue":"11","key":"e_1_3_2_2_28_1","article-title":"Neo","volume":"12","author":"Marcus R.","year":"2019","unstructured":"R. Marcus , P. Negi , H. Mao , C. Zhang , M. Alizadeh , T. Kraska , O. Papaemmanouil , and N. Tatbul . Neo : A Learned Query Optimizer. VLDB Journal , 12 ( 11 ), 2019 . R. Marcus, P. Negi, H. Mao, C. Zhang, M. Alizadeh, T. Kraska, O. Papaemmanouil, and N. Tatbul. Neo: A Learned Query Optimizer. VLDB Journal, 12(11), 2019.","journal-title":"A Learned Query Optimizer. VLDB Journal"},{"key":"e_1_3_2_2_29_1","volume-title":"Deep Reinforcement Learning for Join Order Enumeration. In aiDM","author":"Marcus R.","year":"2018","unstructured":"R. Marcus and O. Papaemmanouil . Deep Reinforcement Learning for Join Order Enumeration. In aiDM 2018 . R. Marcus and O. Papaemmanouil. Deep Reinforcement Learning for Join Order Enumeration. In aiDM 2018."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.421.0098"},{"issue":"11","key":"e_1_3_2_2_31_1","first-page":"1016","article-title":"Improved Selectivity Estimation by Combining Knowledge from Sampling and Synopses","volume":"9","author":"Muller M.","year":"2018","unstructured":"M. Muller , G. Moerkotte , and O. Kolb . Improved Selectivity Estimation by Combining Knowledge from Sampling and Synopses . PVLDB , 9 ( 11 ): 1016 -- 1028 , 2018 . M. Muller, G. Moerkotte, and O. Kolb. Improved Selectivity Estimation by Combining Knowledge from Sampling and Synopses. PVLDB, 9(11):1016--1028, 2018.","journal-title":"PVLDB"},{"key":"e_1_3_2_2_32_1","first-page":"37","volume-title":"Worst-Case Optimal Join Algorithms. In PODS","author":"Ngo H. Q.","year":"2012","unstructured":"H. Q. Ngo , E. Porat , C. R\u00e9 , and A. Rudra . Worst-Case Optimal Join Algorithms. In PODS 2012 , pages 37 -- 48 . H. Q. Ngo, E. Porat, C. R\u00e9, and A. Rudra. Worst-Case Optimal Join Algorithms. In PODS 2012, pages 37--48."},{"key":"e_1_3_2_2_33_1","volume-title":"An Empirical Analysis of Deep Learning for Cardinality Estimation. CoRR, arXiv:1905.06425v2","author":"Ortiz J.","year":"2019","unstructured":"J. Ortiz , M. Balazinska , J. Gehrke , and S. Sathiya Keerthi . An Empirical Analysis of Deep Learning for Cardinality Estimation. CoRR, arXiv:1905.06425v2 , 2019 . J. Ortiz, M. Balazinska, J. Gehrke, and S. Sathiya Keerthi. An Empirical Analysis of Deep Learning for Cardinality Estimation. CoRR, arXiv:1905.06425v2, 2019."},{"key":"e_1_3_2_2_34_1","first-page":"486","volume-title":"Selectivity Estimation Without the Attribute Value Independence Assumption. In VLDB","author":"Poosala V.","year":"1997","unstructured":"V. Poosala and Y. E. Ioannidis . Selectivity Estimation Without the Attribute Value Independence Assumption. In VLDB 1997 , pages 486 -- 495 . V. Poosala and Y. E. Ioannidis. Selectivity Estimation Without the Attribute Value Independence Assumption. In VLDB 1997, pages 486--495."},{"key":"e_1_3_2_2_35_1","first-page":"381","volume-title":"Sketching Sampled Data Streams. In ICDE","author":"Rusu F.","year":"2009","unstructured":"F. Rusu and A. Dobra . Sketching Sampled Data Streams. In ICDE 2009 , pages 381 -- 392 . F. Rusu and A. Dobra. Sketching Sampled Data Streams. In ICDE 2009, pages 381--392."},{"key":"e_1_3_2_2_36_1","first-page":"187","volume-title":"Statistical Analysis of Sketch Estimators. In SIGMOD","author":"Rusu F.","year":"2007","unstructured":"F. Rusu and A. Dobra . Statistical Analysis of Sketch Estimators. In SIGMOD 2007 , pages 187 -- 198 . F. Rusu and A. Dobra. Statistical Analysis of Sketch Estimators. In SIGMOD 2007, pages 187--198."},{"key":"e_1_3_2_2_37_1","volume-title":"Sketches for Size of Join Estimation. TODS, 33(15)","author":"Rusu F.","year":"2008","unstructured":"F. Rusu and A. Dobra . Sketches for Size of Join Estimation. TODS, 33(15) , 2008 . F. Rusu and A. Dobra. Sketches for Size of Join Estimation. TODS, 33(15), 2008."},{"key":"e_1_3_2_2_38_1","volume-title":"Exact Selectivity Computation for Modern In-Memory Database Query Optimization. CoRR, arXiv:1901.01488v1","author":"Shin J. H.","year":"2019","unstructured":"J. H. Shin , F. Rusu , and A. Suhan . Exact Selectivity Computation for Modern In-Memory Database Query Optimization. CoRR, arXiv:1901.01488v1 , 2019 . J. H. Shin, F. Rusu, and A. Suhan. Exact Selectivity Computation for Modern In-Memory Database Query Optimization. CoRR, arXiv:1901.01488v1, 2019."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300088"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824051"},{"key":"e_1_3_2_2_41_1","first-page":"1","volume-title":"Cardinality Estimation with Local Deep Learning Models. In aiDM","author":"Woltmann L.","year":"2019","unstructured":"L. Woltmann , C. Hartmann , M. Thiele , D. Habich , and W. Lehner . Cardinality Estimation with Local Deep Learning Models. In aiDM 2019 , pages 1 -- 8 . L. Woltmann, C. Hartmann, M. Thiele, D. Habich, and W. Lehner. Cardinality Estimation with Local Deep Learning Models. In aiDM 2019, pages 1--8."},{"key":"e_1_3_2_2_42_1","volume-title":"A Survey and An Empirical Evaluation","author":"Sampling-Based Cardinality W. Wu.","year":"2012","unstructured":"W. Wu. Sampling-Based Cardinality Estimation Algorithms : A Survey and An Empirical Evaluation , 2012 . W. Wu. Sampling-Based Cardinality Estimation Algorithms: A Survey and An Empirical Evaluation, 2012."},{"key":"e_1_3_2_2_43_1","volume-title":"Selectivity Estimation with Deep Likelihood Models. CoRR, arXiv:1905.04278v2","author":"Yang Z.","year":"2019","unstructured":"Z. Yang , E. Liang , A. Kamsetty , C. Wu , Y. Duan , X. Chen , P. Abbeel , J. M. Hellerstein , S. Krishnan , and I. Stoica . Selectivity Estimation with Deep Likelihood Models. CoRR, arXiv:1905.04278v2 , 2019 . Z. Yang, E. Liang, A. Kamsetty, C. Wu, Y. Duan, X. Chen, P. Abbeel, J. M. Hellerstein, S. Krishnan, and I. Stoica. Selectivity Estimation with Deep Likelihood Models. CoRR, arXiv:1905.04278v2, 2019."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463701"},{"key":"e_1_3_2_2_45_1","unstructured":"P. Boncz. The IMDB Dataset. http:\/\/homepages.cwi.nl\/ boncz\/job\/imdb.tgz.  P. Boncz. The IMDB Dataset. http:\/\/homepages.cwi.nl\/ boncz\/job\/imdb.tgz."},{"key":"e_1_3_2_2_46_1","unstructured":"Y. Izenov. The COMPASS Query Optimizer. https:\/\/github.com\/yizenov\/compass_query_optimizer.  Y. Izenov. The COMPASS Query Optimizer. https:\/\/github.com\/yizenov\/compass_query_optimizer."},{"key":"e_1_3_2_2_47_1","unstructured":"M. Kiefer. join-kde. https:\/\/github.com\/martinkiefer\/join-kde.  M. Kiefer. join-kde. https:\/\/github.com\/martinkiefer\/join-kde."},{"key":"e_1_3_2_2_48_1","volume-title":"Is Query Optimization a Solved Problem? https:\/\/wp.sigmod.org\/?p=1075","author":"Lohman G.","year":"2014","unstructured":"G. Lohman . Is Query Optimization a Solved Problem? https:\/\/wp.sigmod.org\/?p=1075 , 2014 . G. Lohman. Is Query Optimization a Solved Problem? https:\/\/wp.sigmod.org\/?p=1075, 2014."},{"key":"e_1_3_2_2_49_1","unstructured":"G. Rahn. Join Order Benchmark (JOB). https:\/\/github.com\/gregrahn\/join-order-benchmark.  G. Rahn. Join Order Benchmark (JOB). https:\/\/github.com\/gregrahn\/join-order-benchmark."},{"key":"e_1_3_2_2_50_1","unstructured":"F. Rusu. Sketches for Size of Join Estimation. https:\/\/faculty.ucmerced.edu\/frusu\/Projects\/Sketches.  F. Rusu. Sketches for Size of Join Estimation. https:\/\/faculty.ucmerced.edu\/frusu\/Projects\/Sketches."},{"key":"e_1_3_2_2_51_1","unstructured":"StackExchange. Distance Between Two Permutations? https:\/\/math.stackexchange.com\/questions\/2492954\/distance-between-two-permutations.  StackExchange. Distance Between Two Permutations? https:\/\/math.stackexchange.com\/questions\/2492954\/distance-between-two-permutations."},{"key":"e_1_3_2_2_52_1","unstructured":"Apache Calcite. https:\/\/calcite.apache.org.  Apache Calcite. https:\/\/calcite.apache.org."},{"key":"e_1_3_2_2_53_1","unstructured":"MapD. www.omnisci.com.  MapD. www.omnisci.com."},{"key":"e_1_3_2_2_54_1","unstructured":"MonetDB. www.monetdb.org.  MonetDB. www.monetdb.org."},{"key":"e_1_3_2_2_55_1","unstructured":"PostgreSQL. www.postgresql.org.  PostgreSQL. www.postgresql.org."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452840","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3452840","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3452840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:05Z","timestamp":1750195685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":55,"alternative-id":["10.1145\/3448016.3452840","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3452840","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}