[{"command":"insert","method":null,"selector":".course-modal-ajax-placeholder-952880","data":"\u003Cdiv class=\u0022container content-rte\u0022\u003E\n  \u003Cdiv class=\u0022row\u0022\u003E\n    \u003Cdiv class=\u0022box col-md-6 bg-primary text-white\u0022\u003E\n      \u003Ch2 class=\u0022h1 text-left\u0022\u003E  Fondements des langages d\u0026#039;interrogation de donn\u00e9es\n\u003C\/h2\u003E\n                  \u003Cdiv class=\u0022field-spacing\u0022\u003E\n        \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EECTS :\n          2.5\n        \u003C\/div\u003E\n      \u003C\/div\u003E\n                  \u003Cdiv class=\u0022field-spacing\u0022\u003E\n        \u003Cdiv class=\u0022field__label h3 dash\u0022\u003ESemestre calendaire :\n          Semester 1\n        \u003C\/div\u003E\n      \u003C\/div\u003E\n            \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003ED\u00e9tail du volume horaire\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                          \u003Cspan class=\u0022field__label h4 mt-5 \u0022\u003ECours magistraux :\u003C\/span\u003E\n                                      \u003Cspan\u003E21\u003C\/span\u003E\n                      \u003C\/div\u003E\n                                                                                        \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003ELangue d\u0026#039;enseignement\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003EAnglais\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EEnseignement \u00e0 distance\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003Enon\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n      \u003C\/div\u003E\n    \u003Cdiv class=\u0022box col-md-6\u0022\u003E\n            \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EPr\u00e9requis\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003E\u003Cp\u003ENotions de logique\u003C\/p\u003E\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n                \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EObjectifs d\u0026#039;apprentissage\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003E\u003Cp\u003EThe course aims to provide a principled introduction to query processing, its logical foundations, and the recent query language evolution. It will cover the basics of graph processing: relational querying, Datalog for expanding its abilities to handle graphs, and Cypher, the most commonly currently used graph query language.\u003C\/p\u003E\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EOrganisation g\u00e9n\u00e9rale et modalit\u00e9s p\u00e9dagogiques\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003E\u003Cp\u003EIt introduces key notions from first-order logic and gives a gentle overview of the fundamentals of the relational data model, with a focus on relational algebra and calculus. It then delves deeper into an analysis of the logical foundations of query languages. As such, it provides a detailed presentation of Datalog [6], which is a recursive query language that extends relational algebra with recursion, and that has been used to express a wide spectrum of modern data management tasks. We cover the standard Datalog language, its extension with negation, as well as application-specific dialects (with aggregates, custom predicates, and internalized transitive closure). Focusing on some of these fragments, we survey their various semantics [1, 8, 2]. We then discuss corresponding evaluation techniques and optimizations [5]. In the second part of the course, we concentrate on the connections between Datalog and graph query languages [7, 2]. We illustrate these through practical, interactive hands-on examples centered around Neo4j\u2019s Cypher query language. We will unravel basic and advanced features of the language through a real-world application scenario. Finally, we will outline current research advances in designing constraint and schema languages for graph databases [4, 3].\u003C\/p\u003E\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n                        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EBibliographie\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003E\u003Cp\u003E[1] S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.\u003Cbr\u003E\n[2] R. Angles, M. Arenas, P. Barcel \u0301o, A. Hogan, J. L. Reutter, and D. Vrgoc. Foundations of Modern Query Languages for Graph Databases. ACM Comput. Surv., 50(5):68:1\u201368:40, 2017.\u003Cbr\u003E\n[3] R. Angles, A. Bonifati, S. Dumbrava, G. Fletcher, et al. PG-Schema: Schemas for property graphs. Proc. ACM Manag. Data, 1(2):198:1\u2013198:25, 2023.\u003Cbr\u003E\n[4] R. Angles, A. Bonifati, S. Dumbrava, G. Fletcher, et al. PG-Keys: Keys for property graphs. In SIGMOD Conference, pages 2423\u2013 2436. ACM, 2021.\u003Cbr\u003E\n[5] F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic Sets and Other Strange Ways to Implement Logic Programs. In PODS, pages 1\u201315, 1986.\u003Cbr\u003E\n[6] S. Ceri, G. Gottlob, and L. Tanca. What You Always Wanted to Know About Datalog (And Never Dared to Ask). IEEE Transactions on Knowledge and Data Engineering, pages 146\u2013166, 1989.\u003Cbr\u003E\n[7 J. L. Reutter, M. Romero, and M. Y. Vardi. Regular Queries on Graph Databases. Theory of Computing Systems, 61(1):31\u201383, 2017.\u003Cbr\u003E\n[8] M. Y. Vardi. A Theory of Regular Queries. In PODS, pages 1\u20139, 2016.\u003C\/p\u003E\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003ENature de l\u0026#039;\u00e9valuation\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003EEvaluation Continue non Int\u00e9grale\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n      \u003C\/div\u003E\n  \u003C\/div\u003E\n\u003C\/div\u003E\n","settings":null}]