{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T22:38:16Z","timestamp":1789684696671,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1740850,CCF-1909790, CCF-1813165"],"award-info":[{"award-number":["CCF-1740850,CCF-1909790, CCF-1813165"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"DOI":"10.1145\/3375395.3387665","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T15:10:29Z","timestamp":1590765029000},"page":"457-467","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["How the Degeneracy Helps for Triangle Counting in Graph Streams"],"prefix":"10.1145","author":[{"given":"Suman K.","family":"Bera","sequence":"first","affiliation":[{"name":"University of California, Santa Cruz, Santa Cruz, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[{"name":"University of California, Santa Cruz, Santa Cruz, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Gerold Alsmeyer. 2011. Chebyshev's Inequality .Springer Berlin Heidelberg Berlin Heidelberg 239--240.  Gerold Alsmeyer. 2011. Chebyshev's Inequality .Springer Berlin Heidelberg Berlin Heidelberg 239--240.","DOI":"10.1007\/978-3-642-04898-2_167"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the International Conference on Information and Knowledge Management (CIKM). 529--538","author":"Arifuzzaman S.","unstructured":"S. Arifuzzaman , M. Khan , and M. Marathe . 2013. Patric: A parallel algorithm for counting triangles in massive networks . In Proceedings of the International Conference on Information and Knowledge Management (CIKM). 529--538 . S. Arifuzzaman, M. Khan, and M. Marathe. 2013. Patric: A parallel algorithm for counting triangles in massive networks. In Proceedings of the International Conference on Information and Knowledge Management (CIKM). 529--538."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. 10th Conference on Innovations in Theoretical Computer Science.","author":"Assadi Sepehr","year":"2018","unstructured":"Sepehr Assadi , Michael Kapralov , and Sanjeev Khanna . 2018 . A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling . In Proc. 10th Conference on Innovations in Theoretical Computer Science. Sepehr Assadi, Michael Kapralov, and Sanjeev Khanna. 2018. A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. In Proc. 10th Conference on Innovations in Theoretical Computer Science."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.113"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.43"},{"key":"e_1_3_2_1_7_1","volume-title":"Workshop on Large-scale Data Mining: Theory and Applications (LDMTA)","volume":"10","author":"Avron H.","year":"2010","unstructured":"H. Avron . 2010 . Counting triangles in large graphs using randomized matrix trace estimation . In Workshop on Large-scale Data Mining: Theory and Applications (LDMTA) , Vol. 10 . 10--9. H. Avron. 2010. Counting triangles in large graphs using randomized matrix trace estimation. In Workshop on Large-scale Data Mining: Theory and Applications (LDMTA), Vol. 10. 10--9."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 623--632","author":"Bar-Yossef Ziv","unstructured":"Ziv Bar-Yossef , Ravi Kumar , and D. Sivakumar . 2002. Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs . In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 623--632 . Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar. 2002. Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 623--632."},{"key":"e_1_3_2_1_9_1","volume-title":"Conference on Innovations in Theoretical Computer Science Proc. 11th.","author":"Bera Suman","unstructured":"Suman Bera , Noujan Pashanasangi , and C. Seshadhri . 2020. Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six . In Conference on Innovations in Theoretical Computer Science Proc. 11th. Suman Bera, Noujan Pashanasangi, and C. Seshadhri. 2020. Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. In Conference on Innovations in Theoretical Computer Science Proc. 11th."},{"key":"e_1_3_2_1_10_1","volume-title":"Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. In 34th Symposium on Theoretical Aspects of Computer Science (STACS","volume":"66","author":"Suman","year":"2017","unstructured":"Suman K. Bera and Amit Chakrabarti. 2017 . Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017 ), Vol. 66 . 11:1--11:14. Suman K. Bera and Amit Chakrabarti. 2017. Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Vol. 66. 11:1--11:14."},{"key":"e_1_3_2_1_11_1","volume-title":"Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. arXiv preprint arXiv:1905.00566","author":"Bera Suman K","year":"2019","unstructured":"Suman K Bera , Amit Chakrabarti , and Prantar Ghosh . 2019. Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. arXiv preprint arXiv:1905.00566 ( 2019 ). Suman K Bera, Amit Chakrabarti, and Prantar Ghosh. 2019. Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. arXiv preprint arXiv:1905.00566 (2019)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_21"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142388"},{"key":"e_1_3_2_1_14_1","volume-title":"Fall","author":"Chakrabarti Amit","year":"2011","unstructured":"Amit Chakrabarti . [n.d.]. CS49: Data Stream Algorithms Lecture Notes , Fall 2011 . http:\/\/www.cs.dartmouth.edu\/ ac\/Teach\/data-streams-lecnotes.pdf Amit Chakrabarti. [n.d.]. CS49: Data Stream Algorithms Lecture Notes, Fall 2011. http:\/\/www.cs.dartmouth.edu\/ ac\/Teach\/data-streams-lecnotes.pdf"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/69.3.653"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the International Conference on Knowledge Discovery and Data Mining (SIGKDD). 672--680","author":"Chu S.","unstructured":"S. Chu and J. Cheng . 2011. Triangle listing in massive networks and its applications . In Proceedings of the International Conference on Knowledge Discovery and Data Mining (SIGKDD). 672--680 . S. Chu and J. Cheng. 2011. Triangle listing in massive networks and its applications. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (SIGKDD). 672--680."},{"key":"e_1_3_2_1_20_1","volume-title":"Independent set size approximation in graph streams. arXiv preprint arXiv:1702.08299","author":"Cormode Graham","year":"2017","unstructured":"Graham Cormode , Jacques Dark , and Christian Konrad . 2017a. Independent set size approximation in graph streams. arXiv preprint arXiv:1702.08299 ( 2017 ). Graham Cormode, Jacques Dark, and Christian Konrad. 2017a. Independent set size approximation in graph streams. arXiv preprint arXiv:1702.08299 (2017)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.07.025"},{"key":"e_1_3_2_1_22_1","volume-title":"25th European Symposium on Algorithms, ESA","author":"Cormode Graham","year":"2017","unstructured":"Graham Cormode , Hossein Jowhari , Morteza Monemizadeh , and Shanmugavelayutham Muthukrishnan . 2017 b. The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs . In 25th European Symposium on Algorithms, ESA 2017. Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 29. Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, and Shanmugavelayutham Muthukrishnan. 2017b. The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs. In 25th European Symposium on Algorithms, ESA 2017. Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 29."},{"key":"e_1_3_2_1_23_1","volume-title":"Conference on the World Wide Web (WWW). 589--598","author":"Danisch M.","unstructured":"M. Danisch , O. D. Balalau , and M. Sozio . 2018. Listing k-cliques in Sparse Real-World Graphs . In Conference on the World Wide Web (WWW). 589--598 . M. Danisch, O. D. Balalau, and M. Sozio. 2018. Listing k-cliques in Sparse Real-World Graphs. In Conference on the World Wide Web (WWW). 589--598."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398503"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"T. Eden A. Levi D. Ron and C Seshadhri. 2015. Approximately counting triangles in sublinear time. In Foundations of Computer Science (FOCS). 614--633.  T. Eden A. Levi D. Ron and C Seshadhri. 2015. Approximately counting triangles in sublinear time. In Foundations of Computer Science (FOCS). 614--633.","DOI":"10.1109\/FOCS.2015.44"},{"key":"e_1_3_2_1_26_1","volume-title":"44th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Eden Talya","year":"2017","unstructured":"Talya Eden , Dana Ron , and C Seshadhri . 2017 . Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Talya Eden, Dana Ron, and C Seshadhri. 2017. Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_27_1","unstructured":"T. Eden D. Ron and C. Seshadhri. 2018a. Faster sublinear approximations of k-cliques for low arboricity graphs. arxiv: cs.DS\/1811.04425  T. Eden D. Ron and C. Seshadhri. 2018a. Faster sublinear approximations of k-cliques for low arboricity graphs. arxiv: cs.DS\/1811.04425"},{"key":"e_1_3_2_1_28_1","volume-title":"Symposium on Theory of Computing (STOC). 722--734","author":"Eden T.","unstructured":"T. Eden , D. Ron , and C. Seshadhri . 2018b. On approximating the number of k-cliques in sublinear time . In Symposium on Theory of Computing (STOC). 722--734 . T. Eden, D. Ron, and C. Seshadhri. 2018b. On approximating the number of k-cliques in sublinear time. In Symposium on Theory of Computing (STOC). 722--734."},{"key":"e_1_3_2_1_29_1","volume-title":"Symposium on Discrete Algorithms (SODA).","author":"Eden T.","unstructured":"T. Eden , D. Ron , and C. Seshadhri . 2020. Faster sublinear approximation of the number of k-cliques in low-arboricity graphs . In Symposium on Discrete Algorithms (SODA). T. Eden, D. Ron, and C. Seshadhri. 2020. Faster sublinear approximation of the number of k-cliques in low-arboricity graphs. In Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_30_1","volume-title":"Arboricity and bipartite subgraph listing algorithms. Information processing letters","author":"Eppstein David","year":"1994","unstructured":"David Eppstein . 1994. Arboricity and bipartite subgraph listing algorithms. Information processing letters , Vol. 51 , 4 ( 1994 ), 207--211. David Eppstein. 1994. Arboricity and bipartite subgraph listing algorithms. Information processing letters, Vol. 51, 4 (1994), 207--211."},{"key":"e_1_3_2_1_31_1","first-page":"48","article-title":"Streaming algorithms for estimating the matching size in planar graphs and beyond","volume":"14","author":"Esfandiari Hossein","year":"2018","unstructured":"Hossein Esfandiari , Mohammadtaghi Hajiaghayi , Vahid Liaghat , Morteza Monemizadeh , and Krzysztof Onak . 2018 . Streaming algorithms for estimating the matching size in planar graphs and beyond . ACM Transactions on Algorithms (TALG) , Vol. 14 , 4 (2018), 48 . Hossein Esfandiari, Mohammadtaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, and Krzysztof Onak. 2018. Streaming algorithms for estimating the matching size in planar graphs and beyond. ACM Transactions on Algorithms (TALG), Vol. 14, 4 (2018), 48.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2794080"},{"key":"e_1_3_2_1_33_1","first-page":"3","article-title":"Triangle counting in streamed graphs via small vertex covers","volume":"2","author":"Garcia-Soriano David","year":"2014","unstructured":"David Garcia-Soriano and Konstantin Kutzkov . 2014 . Triangle counting in streamed graphs via small vertex covers . Tc , Vol. 2 (2014), 3 . David Garcia-Soriano and Konstantin Kutzkov. 2014. Triangle counting in streamed graphs via small vertex covers. Tc, Vol. 2 (2014), 3.","journal-title":"Tc"},{"key":"e_1_3_2_1_34_1","volume-title":"International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, 159--167","author":"Goel G.","unstructured":"G. Goel and J. Gustedt . 2006. Bounded arboricity to determine the local structure of sparse graphs . In International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, 159--167 . G. Goel and J. Gustedt. 2006. Bounded arboricity to determine the local structure of sparse graphs. In International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, 159--167."},{"key":"e_1_3_2_1_35_1","volume-title":"Conference on the World Wide Web (WWW). 441--449","author":"Jain S.","unstructured":"S. Jain and C. Seshadhri . 2017. A Fast and Provable Method for Estimating Clique Counts Using Tur\u00e1n's Theorem . In Conference on the World Wide Web (WWW). 441--449 . S. Jain and C. Seshadhri. 2017. A Fast and Provable Method for Estimating Clique Counts Using Tur\u00e1n's Theorem. In Conference on the World Wide Web (WWW). 441--449."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487678"},{"key":"e_1_3_2_1_37_1","volume-title":"Computing and Combinatorics","author":"Jowhari Hossein","unstructured":"Hossein Jowhari and Mohammad Ghodsi . 2005. New streaming algorithms for counting triangles in graphs . In Computing and Combinatorics . Springer , 710--716. Hossein Jowhari and Mohammad Ghodsi. 2005. New streaming algorithms for counting triangles in graphs. In Computing and Combinatorics. Springer, 710--716."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.116"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_53"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.625260"},{"key":"e_1_3_2_1_42_1","volume-title":"Advances in Computers.","author":"Kushilevitz Eyal","unstructured":"Eyal Kushilevitz . 1997. Communication complexity . In Advances in Computers. Vol. 44 . 331--360. Eyal Kushilevitz. 1997. Communication complexity. In Advances in Computers. Vol. 44. 331--360."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08404-6_27"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_57"},{"key":"e_1_3_2_1_45_1","volume-title":"Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. 401--411","author":"McGregor Andrew","unstructured":"Andrew McGregor , Sofya Vorotnikova , and Hoa T. Vu . 2016. Better Algorithms for Counting Triangles in Data Streams . In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. 401--411 . Andrew McGregor, Sofya Vorotnikova, and Hoa T. Vu. 2016. Better Algorithms for Counting Triangles in Data Streams. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. 401--411."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772778"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00108"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"T. Schank and D. Wagner. 2005 b. Finding Counting and Listing All Triangles in Large Graphs an Experimental Study. In Experimental and Efficient Algorithms. 606--609.  T. Schank and D. Wagner. 2005 b. Finding Counting and Listing All Triangles in Large Graphs an Experimental Study. In Experimental and Efficient Algorithms. 606--609.","DOI":"10.1007\/11427186_54"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.056109"},{"key":"e_1_3_2_1_53_1","volume-title":"Proceedings of the International Conference on Data Mining (ICDM)","volume":"4","author":"Seshadhri C.","unstructured":"C. Seshadhri , A. Pinar , and T. G. Kolda . 2013. Fast Triangle Counting through Wedge Sampling. arXiv:1202.5230 . In Proceedings of the International Conference on Data Mining (ICDM) , Vol. 4 . 5. http:\/\/arxiv.org\/abs\/1202.5230 C. Seshadhri, A. Pinar, and T. G. Kolda. 2013. Fast Triangle Counting through Wedge Sampling. arXiv:1202.5230. In Proceedings of the International Conference on Data Mining (ICDM), Vol. 4. 5. http:\/\/arxiv.org\/abs\/1202.5230"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1077-6"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_3_2_1_56_1","volume-title":"Proceedings of the International Conference on Information and Knowledge Management (CIKM). ACM, 781--786","author":"Tangwongsan K.","unstructured":"K. Tangwongsan , A. Pavan , and S. Tirthapura . 2013. Parallel Triangle Counting in Massive Streaming Graphs . In Proceedings of the International Conference on Information and Knowledge Management (CIKM). ACM, 781--786 . K. Tangwongsan, A. Pavan, and S. Tirthapura. 2013. Parallel Triangle Counting in Massive Streaming Graphs. In Proceedings of the International Conference on Information and Knowledge Management (CIKM). ACM, 781--786."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.72"},{"key":"e_1_3_2_1_58_1","volume-title":"Proceedings of the International Conference on Knowledge Discovery and Data Mining (SIGKDD). 837--846","author":"Tsourakakis C. E.","unstructured":"C. E. Tsourakakis , U. Kang , G.L. Miller , and C. Faloutsos . 2009. Doulion: counting triangles in massive graphs with a coin . In Proceedings of the International Conference on Knowledge Discovery and Data Mining (SIGKDD). 837--846 . C. E. Tsourakakis, U. Kang, G.L. Miller, and C. Faloutsos. 2009. Doulion: counting triangles in massive graphs with a coin. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (SIGKDD). 837--846."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00245"},{"key":"e_1_3_2_1_60_1","volume-title":"Collective dynamics of 'small-world' networks. nature","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz . 1998. Collective dynamics of 'small-world' networks. nature , Vol. 393 , 6684 ( 1998 ), 440. Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of 'small-world' networks. nature, Vol. 393, 6684 (1998), 440."}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387665","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375395.3387665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:49Z","timestamp":1750199569000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387665"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":60,"alternative-id":["10.1145\/3375395.3387665","10.1145\/3375395"],"URL":"https:\/\/doi.org\/10.1145\/3375395.3387665","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}