[{"year":"2025","quality_controlled":"1","title":"Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite","date_created":"2025-07-02T11:46:06Z","publisher":"Springer Nature Switzerland","abstract":[{"text":"Despite the advantages that the virtual knowledge graph paradigm has brought to many application domains, state-of-the-art systems still do not support popular graph database management systems like Neo4j. Their query rewriting algorithms focus on languages like conjunctive queries and their unions, which were developed for relational data and are poorly suited for graph data. Moreover, they also limit the expressiveness of the ontology languages that admit rewritings, restricting them to those that enjoy the so-called FO-rewritability property. Rewritings have thus focused on the DL-Lite family of Description Logics. In this paper, we propose a technique for rewriting a family of navigational queries for a suitably tailored fragment of ELHI. Leveraging navigational features in the target query language, we can include some widely-used axiom shapes not supported by DL-Lite. We implemented a proof-of-concept prototype that rewrites into Cypher queries, and tested it on a real-world cognitive neuroscience use case with promising results.","lang":"eng"}],"publication":"The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}","language":[{"iso":"eng"}],"keyword":["Ontology-based Data Access","Property Graphs","Navigational Queries"],"citation":{"ieee":"B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite,” in <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, Portorož, Slovenia, 2025, vol. 15718, pp. 342--361, doi: <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>.","chicago":"Löhnert, Bianca, Nikolaus Augsten, Cem Okulmus, and Magdalena Ortiz. “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.” In <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, 15718:342--361. Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">https://doi.org/10.1007/978-3-031-94575-5_19</a>.","ama":"Löhnert B, Augsten N, Okulmus C, Ortiz M. Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite. In: <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>. Vol 15718. Lecture Notes in Computer Science. Springer Nature Switzerland; 2025:342--361. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>","short":"B. Löhnert, N. Augsten, C. Okulmus, M. Ortiz, in: The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}, Springer Nature Switzerland, 2025, pp. 342--361.","bibtex":"@inproceedings{Löhnert_Augsten_Okulmus_Ortiz_2025, series={Lecture Notes in Computer Science}, title={Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite}, volume={15718}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>}, booktitle={The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}}, publisher={Springer Nature Switzerland}, author={Löhnert, Bianca and Augsten, Nikolaus and Okulmus, Cem and Ortiz, Magdalena}, year={2025}, pages={342--361}, collection={Lecture Notes in Computer Science} }","mla":"Löhnert, Bianca, et al. “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.” <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, vol. 15718, Springer Nature Switzerland, 2025, pp. 342--361, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>.","apa":"Löhnert, B., Augsten, N., Okulmus, C., &#38; Ortiz, M. (2025). Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite. <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, <i>15718</i>, 342--361. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">https://doi.org/10.1007/978-3-031-94575-5_19</a>"},"page":"342--361","intvolume":"     15718","publication_status":"published","publication_identifier":{"isbn":["9783031945748","9783031945755"],"issn":["0302-9743","1611-3349"]},"main_file_link":[{"url":"https://arxiv.org/abs/2405.18181","open_access":"1"}],"conference":{"start_date":"2025-06-01","name":"22th European Semantic Web Conference (ESWC 2025)","location":"Portorož, Slovenia","end_date":"2025-06-05"},"doi":"10.1007/978-3-031-94575-5_19","author":[{"first_name":"Bianca","last_name":"Löhnert","full_name":"Löhnert, Bianca"},{"full_name":"Augsten, Nikolaus","last_name":"Augsten","first_name":"Nikolaus"},{"first_name":"Cem","orcid":"0000-0002-7742-0439","last_name":"Okulmus","full_name":"Okulmus, Cem","id":"114410"},{"full_name":"Ortiz, Magdalena","last_name":"Ortiz","first_name":"Magdalena"}],"volume":15718,"date_updated":"2025-07-02T11:55:19Z","oa":"1","status":"public","type":"conference","series_title":"Lecture Notes in Computer Science","user_id":"114410","department":[{"_id":"888"}],"_id":"60497"},{"year":"2025","place":"Cham","citation":{"ama":"Pandit G, Röder M, Ngonga Ngomo A-C. Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">10.1007/978-3-031-94575-5_4</a>","chicago":"Pandit, Gaurav, Michael Röder, and Axel-Cyrille Ngonga Ngomo. “Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">https://doi.org/10.1007/978-3-031-94575-5_4</a>.","ieee":"G. Pandit, M. Röder, and A.-C. Ngonga Ngomo, “Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2025.","apa":"Pandit, G., Röder, M., &#38; Ngonga Ngomo, A.-C. (2025). Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings. In <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">https://doi.org/10.1007/978-3-031-94575-5_4</a>","mla":"Pandit, Gaurav, et al. “Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">10.1007/978-3-031-94575-5_4</a>.","short":"G. Pandit, M. Röder, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","bibtex":"@inbook{Pandit_Röder_Ngonga Ngomo_2025, place={Cham}, title={Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_4\">10.1007/978-3-031-94575-5_4</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Pandit, Gaurav and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}, year={2025} }"},"publication_status":"published","publication_identifier":{"isbn":["9783031945748","9783031945755"],"issn":["0302-9743","1611-3349"]},"title":"Evaluating Approximate Nearest Neighbour Search Systems on Knowledge Graph Embeddings","doi":"10.1007/978-3-031-94575-5_4","publisher":"Springer Nature Switzerland","date_updated":"2026-01-06T09:55:26Z","date_created":"2026-01-06T09:53:58Z","author":[{"first_name":"Gaurav","last_name":"Pandit","full_name":"Pandit, Gaurav"},{"first_name":"Michael","orcid":"https://orcid.org/0000-0002-8609-8277","last_name":"Röder","full_name":"Röder, Michael","id":"67199"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"_id":"63507","user_id":"67199","department":[{"_id":"574"},{"_id":"923"}]},{"date_created":"2026-01-12T17:24:11Z","author":[{"full_name":"Kapoor, Sourabh","last_name":"Kapoor","first_name":"Sourabh"},{"first_name":"Arnab","last_name":"Sharma","id":"67200","full_name":"Sharma, Arnab"},{"first_name":"Michael","id":"67199","full_name":"Röder, Michael","orcid":"https://orcid.org/0000-0002-8609-8277","last_name":"Röder"},{"first_name":"Caglar","id":"43817","full_name":"Demir, Caglar","last_name":"Demir"},{"first_name":"Axel-Cyrille","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo"}],"publisher":"Springer Nature Switzerland","date_updated":"2026-01-12T17:24:49Z","doi":"10.1007/978-3-031-94575-5_15","title":"Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031945748","9783031945755"]},"publication_status":"published","citation":{"short":"S. Kapoor, A. Sharma, M. Röder, C. Demir, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","bibtex":"@inproceedings{Kapoor_Sharma_Röder_Demir_Ngonga Ngomo_2025, place={Cham}, title={Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Kapoor, Sourabh and Sharma, Arnab and Röder, Michael and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","mla":"Kapoor, Sourabh, et al. “Robustness Evaluation of Knowledge Graph Embedding Models Under Non-Targeted Attacks.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>.","apa":"Kapoor, S., Sharma, A., Röder, M., Demir, C., &#38; Ngonga Ngomo, A.-C. (2025). Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">https://doi.org/10.1007/978-3-031-94575-5_15</a>","ieee":"S. Kapoor, A. Sharma, M. Röder, C. Demir, and A.-C. Ngonga Ngomo, “Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks,” 2025, doi: <a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>.","chicago":"Kapoor, Sourabh, Arnab Sharma, Michael Röder, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Robustness Evaluation of Knowledge Graph Embedding Models Under Non-Targeted Attacks.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">https://doi.org/10.1007/978-3-031-94575-5_15</a>.","ama":"Kapoor S, Sharma A, Röder M, Demir C, Ngonga Ngomo A-C. Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_15\">10.1007/978-3-031-94575-5_15</a>"},"year":"2025","place":"Cham","department":[{"_id":"574"},{"_id":"923"}],"user_id":"67199","_id":"63575","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","type":"conference","status":"public"}]