{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:33:52Z","timestamp":1761806032141,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095268","type":"print"},{"value":"9783032095275","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-09527-5_19","type":"book-chapter","created":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:29:24Z","timestamp":1761805764000},"page":"349-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Querying or\u00a0Similarity Search? Both!"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9669-9158","authenticated-orcid":false,"given":"Vicente","family":"Calisto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9834-8376","authenticated-orcid":false,"given":"Sebasti\u00e1n","family":"Ferrada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2286-741X","authenticated-orcid":false,"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2186-0312","authenticated-orcid":false,"given":"Juan L.","family":"Reutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2086-2117","authenticated-orcid":false,"given":"Juan Pablo","family":"S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5854-2652","authenticated-orcid":false,"given":"Domagoj","family":"Vrgo\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,29]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.106842","volume":"217","author":"AA Amer","year":"2021","unstructured":"Amer, A.A., Abdalla, H.I., Nguyen, L.: Enhancing recommendation systems performance using highly-effective similarity measures. Knowl.-Based Syst. 217, 106842 (2021). https:\/\/doi.org\/10.1016\/j.knosys.2021.106842","journal-title":"Knowl.-Based Syst."},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Angles, R., et al.: TelarKG: a knowledge graph of Chile\u2019s constitutional process. In: Proceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), Santiago AA Chile, pp.\u00a01\u20135. ACM (2024). https:\/\/doi.org\/10.1145\/3661304.3661899","DOI":"10.1145\/3661304.3661899"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3639294","volume":"2","author":"D Arroyuelo","year":"2024","unstructured":"Arroyuelo, D., Bustos, B., G\u00f3mez-Brand\u00f3n, A., Hogan, A., Navarro, G., Reutter, J.: Worst-case-optimal similarity joins on graph databases. Proc. ACM Manag. Data 2(1), 1\u201326 (2024)","journal-title":"Proc. ACM Manag. Data"},{"key":"19_CR4","unstructured":"Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching in fixed dimension. In: Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (SODA\u201994), pp. 573\u2013583 (1994)"},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/110859440","volume":"42","author":"A Atserias","year":"2013","unstructured":"Atserias, A., Grohe, M., Marx, D.: Size bounds and query plans for relational joins. SIAM J. Comput. 42(4), 1737\u20131767 (2013)","journal-title":"SIAM J. Comput."},{"key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006","volume":"87","author":"M Aum\u00fcller","year":"2020","unstructured":"Aum\u00fcller, M., Bernhardsson, E., Faithfull, A.: ANN-benchmarks: a benchmarking tool for approximate nearest neighbor algorithms. Inf. Syst. 87, 101374 (2020). https:\/\/doi.org\/10.1016\/j.is.2019.02.006","journal-title":"Inf. Syst."},{"key":"19_CR7","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B., et\u00a0al.: Modern Information Retrieval, vol.\u00a0463. ACM Press, New York (1999)"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Bawa, M., Condie, T., Ganesan, P.: LSH forest: self-tuning indexes for similarity search. In: Proceedings 14th International Conference on World Wide Web (WWW), p.\u00a0651. ACM Press (2005). https:\/\/doi.org\/10.1145\/1060745.1060840","DOI":"10.1145\/1060745.1060840"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Bonifati, A., Martens, W., Timm, T.: Navigating the maze of Wikidata query logs. In: The World Wide Web Conference, pp. 127\u2013138 (2019)","DOI":"10.1145\/3308558.3313472"},{"issue":"9","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","volume":"30","author":"E Ch\u00e1vez","year":"2008","unstructured":"Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Effective proximity retrieval by ordering permutations. IEEE Trans. Pattern Anal. Mach. Intell. 30(9), 1647\u20131658 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M.: PAC nearest neighbor queries: approximate and controlled search in high-dimensional and metric spaces. In: Proceedings 16th International Conference on Data Engineering (ICDE), pp. 244\u2013255 (2000)","DOI":"10.1109\/ICDE.2000.839417"},{"key":"19_CR13","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB), pp. 426\u2013435 (1997)"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/PL00009449","volume":"22","author":"KL Clarkson","year":"1999","unstructured":"Clarkson, K.L.: Nearest neighbor queries in metric spaces. Discrete Comput. Geometry 22(1), 63\u201393 (1999)","journal-title":"Discrete Comput. Geometry"},{"key":"19_CR15","unstructured":"Core, C.: Chroma - the open-source embedding database (2024). https:\/\/github.com\/chroma-core\/chroma"},{"key":"19_CR16","unstructured":"Cyganiak, R., Wood, D., Lanthaler, M., Klyne, G., Carroll, J.J., McBride, B.: RDF 1.1 Concepts and Abstract Syntax. W3C Recommendation, W3C (2014)"},{"key":"19_CR17","unstructured":"Discussion on the pgvector project. https:\/\/github.com\/pgvector\/pgvector\/issues\/259"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"QH Duong","year":"2016","unstructured":"Duong, Q.H., Liao, B., Fournier-Viger, P., Dam, T.L.: An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowl.-Based Syst. 104, 106\u2013122 (2016)","journal-title":"Knowl.-Based Syst."},{"key":"19_CR19","unstructured":"Engels, J., Landrum, B., Yu, S., Dhulipala, L., Shun, J.: Approximate nearest neighbor search with window filters. arXiv preprint arXiv:2402.00943 (2024)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-68204-4_8","volume-title":"The Semantic Web \u2013 ISWC 2017","author":"S Ferrada","year":"2017","unstructured":"Ferrada, S., Bustos, B., Hogan, A.: IMGpedia: a linked dataset with content-based analysis of Wikimedia images. In: d\u2019Amato, C., et al. (eds.) ISWC 2017. LNCS, vol. 10588, pp. 84\u201393. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68204-4_8"},{"key":"19_CR21","unstructured":"Garcia-Molina, H., Ullman, J., Widom, J.: Database Systems: The Complete Book. Pearson Education India (2008)"},{"key":"19_CR22","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB\u201999, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, pp. 518\u2013529. Morgan Kaufmann (1999). http:\/\/www.vldb.org\/conf\/1999\/P49.pdf"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Gollapudi, S., et\u00a0al.: Filtered-diskann: graph algorithms for approximate nearest neighbor search with filters. In: Proceedings of the ACM Web Conference 2023, pp. 3406\u20133416 (2023)","DOI":"10.1145\/3543507.3583552"},{"issue":"8","key":"19_CR24","doi-asserted-by":"publisher","first-page":"3549","DOI":"10.1109\/TKDE.2020.3028705","volume":"34","author":"Q Guo","year":"2022","unstructured":"Guo, Q., et al.: A survey on knowledge graph-based recommender systems. IEEE Trans. Knowl. Data Eng. 34(8), 3549\u20133568 (2022). https:\/\/doi.org\/10.1109\/TKDE.2020.3028705","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR25","unstructured":"Guo, R., et\u00a0al.: Manu: a cloud native vector database management system. arXiv preprint arXiv:2206.13843 (2022)"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data - SIGMOD \u201984, Boston, Massachusetts, p.\u00a047. ACM Press (1984). https:\/\/doi.org\/10.1145\/602259.602266","DOI":"10.1145\/602259.602266"},{"key":"19_CR27","unstructured":"Harris, S., Seaborne, A., Prud\u2019hommeaux, E.: SPARQL 1.1 Query Language (2013). https:\/\/www.w3.org\/TR\/sparql11-query"},{"issue":"2","key":"19_CR28","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst. 24(2), 265\u2013318 (1999)","journal-title":"ACM Trans. Database Syst."},{"key":"19_CR29","unstructured":"Hjaltason, G.R., Samet, H.: Incremental similarity search in multimedia databases. Technical report CS-TR-4199, University of Maryland, Computer Science Department (2000)"},{"key":"19_CR30","doi-asserted-by":"publisher","unstructured":"Hogan, A., et al.: Knowledge Graphs. No.\u00a022 in Synthesis Lectures on Data, Semantics, and Knowledge, Springer (2021). https:\/\/doi.org\/10.2200\/S01125ED1V01Y202109DSK022, https:\/\/kgbook.org\/","DOI":"10.2200\/S01125ED1V01Y202109DSK022"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Hogan, A., Riveros, C., Rojas, C., Soto, A.: A worst-case optimal join algorithm for SPARQL. In: Proceedings of the 18th International Semantic Web Conference (ISWC), pp. 258\u2013275 (2019)","DOI":"10.1007\/978-3-030-30793-6_15"},{"key":"19_CR32","unstructured":"Lewis, P., et al.: Retrieval-augmented generation for knowledge-intensive NLP tasks. In: Proceeding 34th International Conference on Neural Information Processing Systems, Red Hook, NY, USA. Curran Associates Inc. (2020)"},{"issue":"4","key":"19_CR33","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2018","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-030-00668-6_23","volume-title":"The Semantic Web \u2013 ISWC 2018","author":"S Malyshev","year":"2018","unstructured":"Malyshev, S., Kr\u00f6tzsch, M., Gonz\u00e1lez, L., Gonsior, J., Bielefeldt, A.: Getting the most out of Wikidata: semantic technology usage in Wikipedia\u2019s knowledge graph. In: Vrande\u010di\u0107, D., et al. (eds.) ISWC 2018, Part II. LNCS, vol. 11137, pp. 376\u2013394. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00668-6_23"},{"key":"19_CR35","unstructured":"Millennium Institute for Foundational Research on Data: MillenniumDB. The link to the repository can be found at: https:\/\/anonymous.4open.science\/r\/WCO-SimilaritySearch-2025"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Ngo, H.Q.: Worst-case optimal join algorithms: Techniques, results, and open problems. In: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS), pp. 111\u2013124 (2018)","DOI":"10.1145\/3196959.3196990"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Nguyen, D., Aref, M., Bravenboer, M., Kollias, G., Ngo, H.Q., R\u00e9, C., Rudra, A.: Join processing for graph patterns: an old dog with new tricks. In: Proceedings of the 3rd International Workshop on Graph Data Management Experiences and Systems (GRADES), pp. 2:1\u20132:8 (2015)","DOI":"10.1145\/2764947.2764948"},{"issue":"5","key":"19_CR38","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1007\/s00778-024-00864-x","volume":"33","author":"JJ Pan","year":"2024","unstructured":"Pan, J.J., Wang, J., Li, G.: Survey of vector database management systems. VLDB J. 33(5), 1591\u20131615 (2024)","journal-title":"VLDB J."},{"issue":"7","key":"19_CR39","doi-asserted-by":"publisher","first-page":"3580","DOI":"10.1109\/TKDE.2024.3352100","volume":"36","author":"S Pan","year":"2024","unstructured":"Pan, S., Luo, L., Wang, Y., Chen, C., Wang, J., Wu, X.: Unifying large language models and knowledge graphs: a roadmap. IEEE Trans. Knowl. Data Eng. 36(7), 3580\u20133599 (2024)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR40","doi-asserted-by":"publisher","unstructured":"Paraschakis, D., Ros, R., Borg, M., Runeson, P.: Fuserank (demo): filtered vector search in multimodal structured data. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 404\u2013408. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-70371-3_29","DOI":"10.1007\/978-3-031-70371-3_29"},{"key":"19_CR41","doi-asserted-by":"publisher","unstructured":"Pelillo, M., Hancock, E.R. (eds.): Similarity-Based Pattern Recognition, LNCS, vol. 7005. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24471-1","DOI":"10.1007\/978-3-642-24471-1"},{"key":"19_CR42","unstructured":"PostgreSQL Global Development Group: pgvector - open-source vector similarity search for postgres (2024). https:\/\/github.com\/pgvector\/pgvector"},{"key":"19_CR43","unstructured":"Prokhorenkova, L., Shekhovtsov, A.: Graph-based nearest neighbor search: from practice to theory. In: Proceedings of the 37th International Conference on Machine Learning, (ICML). Proceedings of Machine Learning Research, vol.\u00a0119, pp. 7803\u20137813 (2020)"},{"key":"19_CR44","doi-asserted-by":"publisher","unstructured":"Reimers, N., Gurevych, I.: Sentence-BERT: sentence Embeddings using Siamese BERT-Networks (2019). https:\/\/doi.org\/10.48550\/ARXIV.1908.10084","DOI":"10.48550\/ARXIV.1908.10084"},{"key":"19_CR45","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann (2006)"},{"key":"19_CR46","doi-asserted-by":"crossref","unstructured":"Schneider, P., Schopf, T., Vladika, J., Galkin, M., Simperl, E., Matthes, F.: A decade of knowledge graphs in natural language processing: a survey. In: Proceedings of the 2nd Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics and the 12th International Joint Conference on Natural Language Processing, vol.\u00a01, pp. 601\u2013614 (2022)","DOI":"10.18653\/v1\/2022.aacl-main.46"},{"key":"19_CR47","unstructured":"Veldhuizen, T.L.: Triejoin: a simple, worst-case optimal join algorithm. In: Proceedings of the 17th International Conference on Database Theory (ICDT), pp. 96\u2013106 (2014)"},{"issue":"10","key":"19_CR48","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrande\u010di\u0107","year":"2014","unstructured":"Vrande\u010di\u0107, D., Kr\u00f6tzsch, M.: Wikidata: a free collaborative knowledgebase. Commun. ACM 57(10), 78\u201385 (2014)","journal-title":"Commun. ACM"},{"key":"19_CR49","doi-asserted-by":"publisher","unstructured":"Vrgo\u010d, D., et al.: MillenniumDB: an open-source graph database system. Data Intell. 5(3), 560\u2013610 (2023). https:\/\/doi.org\/10.1162\/dint_a_00229, https:\/\/direct.mit.edu\/dint\/article\/5\/3\/560\/117375\/MillenniumDB-An-Open-Source-Graph-Database-System","DOI":"10.1162\/dint_a_00229"},{"key":"19_CR50","doi-asserted-by":"publisher","unstructured":"Vrgo\u010d, D., et al.: MillenniumDB: a multi-modal, multi-model graph database. In: Companion of the 2024 International Conference on Management of Data. SIGMOD \u201924, New York, NY, USA, pp. 496\u2013499. Association for Computing Machinery (2024). https:\/\/doi.org\/10.1145\/3626246.3654757","DOI":"10.1145\/3626246.3654757"},{"key":"19_CR51","doi-asserted-by":"crossref","unstructured":"Wang, J., et\u00a0al.: Milvus: a purpose-built vector data management system. In: Proceedings of the 2021 International Conference on Management of Data, pp. 2614\u20132627 (2021)","DOI":"10.1145\/3448016.3457550"},{"key":"19_CR52","doi-asserted-by":"crossref","unstructured":"Wang, M., Wang, H., Qi, G., Zheng, Q.: Richpedia: a large-scale, comprehensive multi-modal knowledge graph. Big Data Res. 22, article 100159 (2020)","DOI":"10.1016\/j.bdr.2020.100159"},{"key":"19_CR53","doi-asserted-by":"crossref","unstructured":"Wang, X., Meng, B., Chen, H., Meng, Y., Lv, K., Zhu, W.: TIVA-KG: a multimodal knowledge graph with text, image, video and audio. In: Proceeding of the 31st ACM International Conference on Multimedia, pp. 2391\u20132399 (2023)","DOI":"10.1145\/3581783.3612266"},{"key":"19_CR54","unstructured":"Yianilos, P.: Locally lifting the curse of dimensionality for nearest neighbor search. In: Proceeding of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 361\u2013370 (2000)"},{"key":"19_CR55","doi-asserted-by":"crossref","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search - The Metric Space Approach, Advances in Database Systems, vol.\u00a032. Kluwer (2006)","DOI":"10.1007\/0-387-29151-2"},{"key":"19_CR56","doi-asserted-by":"publisher","unstructured":"Zheng, W., Zou, L., Peng, W., Yan, X., Song, S., Zhao, D.: Semantic SPARQL similarity search over RDF knowledge graphs. Proc. VLDB Endowment 9(11), 840\u2013851 (2016). https:\/\/doi.org\/10.14778\/2983200.2983201","DOI":"10.14778\/2983200.2983201"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09527-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:29:49Z","timestamp":1761805789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09527-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,29]]},"ISBN":["9783032095268","9783032095275"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09527-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,29]]},"assertion":[{"value":"29 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semweb2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iswc2025.semanticweb.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}