{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T11:25:32Z","timestamp":1769513132347,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031367083","type":"print"},{"value":"9783031367090","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36709-0_12","type":"book-chapter","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T18:03:02Z","timestamp":1689271382000},"page":"223-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing k-Bisimulations for\u00a0Large Graphs: A Comparison and\u00a0Efficiency Analysis"],"prefix":"10.1007","author":[{"given":"Jannik","family":"Rau","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1062-8451","authenticated-orcid":false,"given":"David","family":"Richerby","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-9245","authenticated-orcid":false,"given":"Ansgar","family":"Scherp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-11964-9_14","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"W Beek","year":"2014","unstructured":"Beek, W., Rietveld, L., Bazoobandi, H.R., Wielemaker, J., Schlobach, S.: LOD laundromat: a uniform way of publishing other people\u2019s dirty data. In: Mika, P., Tudorache, T., Bernstein, A., Welty, C., Knoblock, C., Vrande\u010di\u0107, D., Groth, P., Noy, N., Janowicz, K., Goble, C. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 213\u2013228. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11964-9_14"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009040101","volume":"5","author":"C Bizer","year":"2009","unstructured":"Bizer, C., Schultz, A.: The Berlin SPARQL benchmark. Int. J. Semant. Web Inf. Syst. 5(2), 1\u201324 (2009). https:\/\/doi.org\/10.4018\/jswis.2009040101","journal-title":"Int. J. Semant. Web Inf. Syst."},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S1571-0661(05)80390-1","volume":"68","author":"S Blom","year":"2002","unstructured":"Blom, S., Orzan, S.: A distributed algorithm for strong bisimulation reduction of state spaces. Electron. Notes Theor. Comput. Sci. 68(4), 523\u2013538 (2002). https:\/\/doi.org\/10.1016\/S1571-0661(05)80390-1","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"12_CR4","unstructured":"Blume, T., Rau, J., Richerby, D., Scherp, A.: Time and memory efficient parallel algorithm for structural graph summaries and two extensions to incremental summarization and $$k$$-bisimulation for long $$k$$-chaining. CoRR abs\/2111.12493 (2021). arxiv:2111.12493"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Blume, T., Richerby, D., Scherp, A.: Incremental and parallel computation of structural graph summaries for evolving graphs. In: CIKM, pp. 75\u201384. ACM (2020). https:\/\/doi.org\/10.1145\/3340531.3411878","DOI":"10.1145\/3340531.3411878"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.tcs.2020.12.019","volume":"854","author":"T Blume","year":"2021","unstructured":"Blume, T., Richerby, D., Scherp, A.: FLUID: a common model for semantic structural graph summaries based on equivalence relations. Theor. Comput. Sci. 854, 136\u2013158 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.12.019","journal-title":"Theor. Comput. Sci."},{"key":"12_CR7","unstructured":"Bonifati, A., Dumbrava, S., Kondylakis, H.: Graph summarization. CoRR abs\/2004.14794 (2020). https:\/\/arxiv.org\/abs\/2004.14794"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Buneman, P., Staworko, S.: RDF graph alignment with bisimulation. Proc. VLDB Endow. 9(12), 1149\u20131160 (2016). https:\/\/doi.org\/10.14778\/2994509.2994531","DOI":"10.14778\/2994509.2994531"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00778-018-0528-3","volume":"28","author":"\u0160 \u010cebiri\u0107","year":"2018","unstructured":"\u010cebiri\u0107, \u0160, Goasdou\u00e9, F., Kondylakis, H., Kotzinos, D., Manolescu, I., Troullinou, G., Zneika, M.: Summarizing semantic graphs: a survey. VLDB J. 28(3), 295\u2013327 (2018). https:\/\/doi.org\/10.1007\/s00778-018-0528-3","journal-title":"VLDB J."},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Ciglan, M., N\u00f8rv\u00e5g, K., Hluch\u00fd, L.: The semsets model for ad-hoc semantic list search. In: WWW, pp. 131\u2013140. ACM (2012). https:\/\/doi.org\/10.1145\/2187836.2187855","DOI":"10.1145\/2187836.2187855"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Consens, M.P., Fionda, V., Khatchadourian, S., Pirr\u00f2, G.: S+EPPs: construct and explore bisimulation summaries, plus optimize navigational queries; all on existing SPARQL systems. Proc. VLDB Endow. 8(12), 2028\u20132031 (2015). https:\/\/doi.org\/10.14778\/2824032.2824128","DOI":"10.14778\/2824032.2824128"},{"issue":"5","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1007\/s00778-020-00611-y","volume":"29","author":"F Goasdou\u00e9","year":"2020","unstructured":"Goasdou\u00e9, F., Guzewicz, P., Manolescu, I.: RDF graph summarization for first-sight structure discovery. VLDB J. 29(5), 1191\u20131218 (2020). https:\/\/doi.org\/10.1007\/s00778-020-00611-y","journal-title":"VLDB J."},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Hellings, J., Fletcher, G.H.L., Haverkort, H.J.: Efficient external-memory bisimulation on dags. In: SIGMOD, pp. 553\u2013564. ACM (2012). https:\/\/doi.org\/10.1145\/2213836.2213899","DOI":"10.1145\/2213836.2213899"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-030-30796-7_11","volume-title":"The Semantic Web \u2013 ISWC 2019","author":"J-M Herrera","year":"2019","unstructured":"Herrera, J.-M., Hogan, A., K\u00e4fer, T.: BTC-2019: the 2019 billion triple challenge dataset. In: Ghidini, C., et al. (eds.) ISWC 2019. LNCS, vol. 11779, pp. 163\u2013180. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30796-7_11"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"PC Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86(1), 43\u201368 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90025-D","journal-title":"Inf. Comput."},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for indexing paths in graph-structured data. In: ICDE, pp. 129\u2013140. IEEE (2002). https:\/\/doi.org\/10.1109\/ICDE.2002.994703","DOI":"10.1109\/ICDE.2002.994703"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Luo, Y., Fletcher, G.H.L., Hidders, J., Bra, P.D., Wu, Y.: Regularities and dynamics in bisimulation reductions of big graphs. In: Workshop on Graph Data Management Experiences and Systems, p. 13. CWI\/ACM (2013). https:\/\/doi.org\/10.1145\/2484425.2484438","DOI":"10.1145\/2484425.2484438"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Luo, Y., Fletcher, G.H.L., Hidders, J., Wu, Y., Bra, P.D.: External memory k-bisimulation reduction of big graphs. In: CIKM, pp. 919\u2013928. ACM (2013). https:\/\/doi.org\/10.1145\/2505515.2505752","DOI":"10.1145\/2505515.2505752"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-90636-8_7","volume-title":"Formal Aspects of Component Software","author":"J Martens","year":"2021","unstructured":"Martens, J., Groote, J.F., van den Haak, L., Hijma, P., Wijs, A.: A linear parallel algorithm to compute bisimulation and relational coarsest partitions. In: Sala\u00fcn, G., Wijs, A. (eds.) FACS 2021. LNCS, vol. 13077, pp. 115\u2013133. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90636-8_7"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-49257-7_18","volume-title":"Database Theory \u2014 ICDT\u201999","author":"T Milo","year":"1999","unstructured":"Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Buneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277\u2013295. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49257-7_18"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Nestorov, S., Ullman, J.D., Wiener, J.L., Chawathe, S.S.: Representative objects: concise representations of semistructured, hierarchical data. In: ICDE, pp. 79\u201390. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/ICDE.1997.581741","DOI":"10.1109\/ICDE.1997.581741"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Neumann, T., Moerkotte, G.: Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins. In: ICDE, pp. 984\u2013994. IEEE (2011). https:\/\/doi.org\/10.1109\/ICDE.2011.5767868","DOI":"10.1109\/ICDE.2011.5767868"},{"issue":"6","key":"12_CR23","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987). https:\/\/doi.org\/10.1137\/0216062","journal-title":"SIAM J. Comput."},{"key":"12_CR24","unstructured":"Rau, J., Richerby, D., Scherp, A.: Single-purpose algorithms vs. a generic graph summarizer for computing k-bisimulations on large graphs. CoRR abs\/2204.05821 (2022). https:\/\/doi.org\/10.48550\/arXiv.2204.05821"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Sch\u00e4tzle, A., Neu, A., Lausen, G., Przyjaciel-Zablocki, M.: Large-scale bisimulation of RDF graphs. In: Workshop on Semantic Web Information Management, pp. 1:1\u20131:8. ACM (2013). https:\/\/doi.org\/10.1145\/2484712.2484713","DOI":"10.1145\/2484712.2484713"},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"139","DOI":"10.3233\/SW-150176","volume":"7","author":"P Stutz","year":"2016","unstructured":"Stutz, P., Strebel, D., Bernstein, A.: Signal\/Collect12. Semant. Web 7(2), 139\u2013166 (2016). https:\/\/doi.org\/10.3233\/SW-150176","journal-title":"Semant. Web"},{"issue":"9","key":"12_CR27","doi-asserted-by":"publisher","first-page":"2076","DOI":"10.1109\/TKDE.2012.134","volume":"25","author":"T Tran","year":"2013","unstructured":"Tran, T., Ladwig, G., Rudolph, S.: Managing structured and semistructured RDF data using structure indexes. IEEE Trans. Knowl. Data Eng. 25(9), 2076\u20132089 (2013). https:\/\/doi.org\/10.1109\/TKDE.2012.134","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR28","unstructured":"Vaigh, C.B.E., Goasdou\u00e9, F.: A well-founded graph-based summarization framework for description logics. In: Description Logics, vol. 2954. CEUR-WS.org (2021). http:\/\/ceur-ws.org\/Vol-2954\/paper-8.pdf"},{"key":"12_CR29","unstructured":"Wikimedia Foundation: Wikidata (2022). https:\/\/www.wikidata.org\/"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36709-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T18:04:11Z","timestamp":1689271451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36709-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031367083","9783031367090"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36709-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leicester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.78","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}