{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T09:56:38Z","timestamp":1779011798469,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,14]],"date-time":"2021-07-14T00:00:00Z","timestamp":1626220800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,14]]},"DOI":"10.1145\/3472163.3472269","type":"proceedings-article","created":{"date-parts":[[2021,9,7]],"date-time":"2021-09-07T16:46:57Z","timestamp":1631033217000},"page":"222-231","source":"Crossref","is-referenced-by-count":4,"title":["On Efficiently Equi-Joining Graphs"],"prefix":"10.1145","author":[{"given":"Giacomo","family":"Bergami","sequence":"first","affiliation":[{"name":"Free University of Bozen-Bolzano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,9,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Principles of Model Checking (Representation and Mind Series)","author":"Baier Christel"},{"key":"e_1_3_2_1_2_1","unstructured":"Giacomo Bergami. 2021. A Logical Model for joining Property Graphs. https:\/\/rebrand.ly\/tech-report-joins(2021).  Giacomo Bergami. 2021. A Logical Model for joining Property Graphs. https:\/\/rebrand.ly\/tech-report-joins(2021)."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the Workshops of the EDBT\/ICDT 2017 Joint Conference (EDBT\/ICDT 2017","author":"Bergami Giacomo","year":"2017"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Giacomo Bergami Andr\u00e8 Petermann and Danilo Montesi. 2018. THoSP: an Algorithm for Nesting Property Graphs. In GRADES-NDA.  Giacomo Bergami Andr\u00e8 Petermann and Danilo Montesi. 2018. THoSP: an Algorithm for Nesting Property Graphs. In GRADES-NDA.","DOI":"10.1145\/3210259.3210267"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1366-5545(00)00022-3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"e_1_3_2_1_7_1","article-title":"Synchronization of Queries and Views Upon Schema Evolutions: A Survey","volume":"41","author":"Caruccio Loredana","year":"2016","journal-title":"ACM Trans. Database Syst."},{"key":"e_1_3_2_1_8_1","volume-title":"Fundamentals of Database Systems","author":"Elmasri Ramez","edition":"7"},{"key":"e_1_3_2_1_9_1","volume-title":"DEXA","author":"Galkin Mikhail","year":"2017"},{"key":"e_1_3_2_1_10_1","volume-title":"SMJoin: A Multi-way Join Operator for SPARQL Queries. In Proceedings of the 13th International Conference on Semantic Systems. 104\u2013111","author":"Galkin Mikhail"},{"key":"e_1_3_2_1_11_1","first-page":"4","article-title":"Holistic Top-k Simple Shortest Path Join in Graphs","volume":"24","author":"Gao Jun","year":"2012","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"e_1_3_2_1_12_1","volume-title":"Biscuit: A Framework for Near-Data Processing of Big Data Workloads. In ISCA. 153\u2013165.","author":"Gu Boncheol","year":"2016"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","volume-title":"Handbook of Product Graphs","author":"Hammack Richard","DOI":"10.1201\/b10959"},{"key":"e_1_3_2_1_14_1","volume-title":"Structure and Recognition","author":"Imrich Wilfried","edition":"2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236246"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Miray Kas Matthew Wachs Kathleen\u00a0M. Carley and L.\u00a0Richard Carley. 2013. Incremental algorithm for updating betweenness centrality in dynamically growing networks. In ASONAM. 33\u201340.  Miray Kas Matthew Wachs Kathleen\u00a0M. Carley and L.\u00a0Richard Carley. 2013. Incremental algorithm for updating betweenness centrality in dynamically growing networks. In ASONAM. 33\u201340.","DOI":"10.1145\/2492517.2492533"},{"key":"e_1_3_2_1_17_1","volume-title":"A collection of public transport network data sets for 25 cities. Scientific Data 5, 1","author":"Kujala Rainer","year":"2018"},{"key":"e_1_3_2_1_18_1","volume-title":"The G* graph database: efficiently managing large distributed dynamic graphs. Distributed and Parallel Databases 33, 4 (01","author":"Labouseur G.","year":"2015"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756039"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"J\u00f3zsef Marton G\u00e1bor Sz\u00e1rnyas and D\u00e1niel Varr\u00f3. 2017. Formalising opencypher Graph Queries in Relational Algebra. CoRR abs\/1705.02844(2017).  J\u00f3zsef Marton G\u00e1bor Sz\u00e1rnyas and D\u00e1niel Varr\u00f3. 2017. Formalising opencypher Graph Queries in Relational Algebra. CoRR abs\/1705.02844(2017).","DOI":"10.1007\/978-3-319-66917-5_13"},{"key":"e_1_3_2_1_21_1","volume-title":"Vol.\u00a02967","author":"Melnik Sergey"},{"key":"e_1_3_2_1_22_1","unstructured":"Marcus Paradies. 2019. CryoDrill: Near-Data Processing in Deep and Cold Storae Hierarchies. In CIDR.  Marcus Paradies. 2019. CryoDrill: Near-Data Processing in Deep and Cold Storae Hierarchies. In CIDR."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","volume-title":"Practical Graph Mining with R","author":"Samatova F.","DOI":"10.1201\/b15352"},{"key":"e_1_3_2_1_24_1","volume-title":"ConceptNet 5: A Large Semantic Network for Relational Knowledge","author":"Speer Robert"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183724"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Damian Szklarczyk John\u00a0H. Morris Helen Cook Michael Kuhn Stefan Wyder Milan Simonovic Alberto Santos Nadezhda\u00a0T. Doncheva Alexander Roth Peer Bork Lars\u00a0Juhl Jensen and Christian von Mering. 2017. The STRING database in 2017: quality-controlled protein-protein association networks made broadly accessible. Nucleic Acids Research 45 Database-Issue(2017) D362\u2013D368.  Damian Szklarczyk John\u00a0H. Morris Helen Cook Michael Kuhn Stefan Wyder Milan Simonovic Alberto Santos Nadezhda\u00a0T. Doncheva Alexander Roth Peer Bork Lars\u00a0Juhl Jensen and Christian von Mering. 2017. The STRING database in 2017: quality-controlled protein-protein association networks made broadly accessible. Nucleic Acids Research 45 Database-Issue(2017) D362\u2013D368.","DOI":"10.1093\/nar\/gkw937"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","volume-title":"ArnetMiner: Extraction and Mining of Academic Social Networks. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Tang Jie","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Koji Tsuda and Hiroto Saigo. 2010. Graph Classification. In Managing and Mining Graph Data. 337\u2013363.  Koji Tsuda and Hiroto Saigo. 2010. Graph Classification. In Managing and Mining Graph Data. 337\u2013363.","DOI":"10.1007\/978-1-4419-6045-0_11"},{"key":"e_1_3_2_1_29_1","volume-title":"The Anatomy of the Facebook Social Graph. CoRR","author":"Ugander Johan","year":"2011"},{"key":"e_1_3_2_1_31_1","unstructured":"Jing Wang Nikos Ntarmos and Peter Triantafillou. 2017. GraphCache: A Caching System for Graph Queries. In EDBT. 13\u201324.  Jing Wang Nikos Ntarmos and Peter Triantafillou. 2017. GraphCache: A Caching System for Graph Queries. In EDBT. 13\u201324."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Jaewon Yang and Jure Leskovec. 2012. Defining and Evaluating Network Communities Based on Ground-Truth. In ICDM. 745\u2013754.  Jaewon Yang and Jure Leskovec. 2012. Defining and Evaluating Network Communities Based on Ground-Truth. In ICDM. 745\u2013754.","DOI":"10.1109\/ICDM.2012.138"},{"key":"e_1_3_2_1_33_1","volume-title":"All-in-One: Graph Processing in RDBMSs Revisited. In Proceedings of the 2017 ACM International Conference on Management of Data. 1165\u20131180","author":"Zhao Kangfei"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Y. Zhou H. Cheng and J.\u00a0X. Yu. 2010. Clustering Large Attributed Graphs: An Efficient Incremental Approach. In ICDM. 689\u2013698.  Y. Zhou H. Cheng and J.\u00a0X. Yu. 2010. Clustering Large Attributed Graphs: An Efficient Incremental Approach. In ICDM. 689\u2013698.","DOI":"10.1109\/ICDM.2010.41"}],"event":{"name":"IDEAS 2021: 25th International Database Engineering & Applications Symposium","location":"Montreal QC Canada","acronym":"IDEAS 2021"},"container-title":["25th International Database Engineering & Applications Symposium"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472163.3472269","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472163.3472269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:00Z","timestamp":1750183800000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472163.3472269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,14]]},"references-count":33,"alternative-id":["10.1145\/3472163.3472269","10.1145\/3472163"],"URL":"https:\/\/doi.org\/10.1145\/3472163.3472269","relation":{},"subject":[],"published":{"date-parts":[[2021,7,14]]}}}