[et_pb_section fb_built=”1″ _builder_version=”3.22″][et_pb_row _builder_version=”3.22″ background_size=”initial” background_position=”top_left” background_repeat=”repeat”][et_pb_column type=”1_4″ _builder_version=”3.0.47″][et_pb_text _builder_version=”3.22.1″ background_color=”#072c72″ border_color_all=”#3255c9″ text_orientation=”right” background_layout=”dark” custom_padding=”20px|15px|15px|” z_index_tablet=”500″]<\/p>\n
2021<\/em><\/p>\n PhD\/ DIAI Projects<\/em><\/p>\n @ED 386 : Sciences Math\u00e9matiques de Paris Centre<\/span><\/p>\n [\/et_pb_text][et_pb_text _builder_version=”3.22.1″ text_orientation=”right” z_index_tablet=”500″]<\/p>\n PhD student <\/p>\n Supervisors <\/p>\n [\/et_pb_text][\/et_pb_column][et_pb_column type=”3_4″ _builder_version=”3.0.47″][et_pb_text _builder_version=”3.22.1″ z_index_tablet=”500″]<\/p>\n (Former title: Query analytics in Cypher)<\/em><\/p>\n In a graph database, data is stored as a \u201cgraph\u201d, or a collection of nodes, representing the entities, connected together by edges, representing relationships between the entities. Additional information about the entities and their relationships can be attached to the nodes and edges. This powerful model, popularized by Neo4j in 2010, is now a staple in various industries such as biology, social networks and banking. By putting the links between the data points front and center, graph databases allow users to reason not only about individual elements but also about the structure of the graph. Accordingly, the goal of a typical graph query is to find a \u201cpath\u201d connecting specific nodes.<\/p>\n Because graph traversals inherently rely on transitivity, traditional query languages are not suitable in the graph context, and thus new languages have been created. In the theoretical community, the basic building blocks of a graph language are the Regular Path Queries (RPQs), which define path constraints by way of regular expressions. The expressive power and complexity of RPQs and their extensions (by union, conjunction, two-way navigation, data value comparisons and path properties for example) have been studied since the 1990s but their properties are barely beginning to be understood.<\/p>\n In 2019, a new International Organisation for Standardization (ISO) group was created to oversee the standardization of practical graph languages. This led to two new standards: SQL\/PGQ and GQL. The idea of SQL\/PGQ is to add a view-based pattern matching mechanism to SQL and interpret the relational The goal of this project is to define a theoretical language for graph databases, akin to relational algebra for SQL, that reflects the essential aspects of GQL and SQL\/PGQ while being simple enough for theoretical study.<\/p>\n <\/p>\n Bienvenue (irif.fr)<\/a><\/p>\n <\/p>\n [\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row custom_margin=”120px||” _builder_version=”3.22.1″ locked=”off”][et_pb_column type=”4_4″ _builder_version=”3.22.1″][et_pb_divider _builder_version=”3.22.1″][\/et_pb_divider][et_pb_text admin_label=”\u00c0 lire aussi” _builder_version=”3.22.1″ z_index_tablet=”500″ locked=”off”]<\/p>\n [\/et_pb_text][et_pb_blog posts_number=”4″ include_categories=”63″ show_author=”off” show_date=”off” show_pagination=”off” module_id=”page_type_blog” _builder_version=”3.22.1″ header_level=”h4″ border_width_bottom_fullwidth=”1px” border_color_bottom_fullwidth=”rgba(51,51,51,0.18)” custom_padding=”||50px|” z_index_tablet=”500″ locked=”off”][\/et_pb_blog][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":" 2021 PhD\/ DIAI Projects @ED 386 : Sciences Math\u00e9matiques de Paris CentrePhD studentAlexandra ROGOVA (IRIF, DI ENS) SupervisorsAm\u00e9lie GHEERBRANT (IRIF, UPC),Leonid LIBKIN (Laboratory for Foundations of Computer Science, University of Edinburgh) Project Summary (Former title: Query analytics in Cypher) In a graph database, data is stored as a \u201cgraph\u201d, or a collection of nodes,… Lire la suite Design principles of property graph languages<\/span><\/a><\/p>\n","protected":false},"author":560,"featured_media":2263,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":""},"categories":[57,63,1,24],"tags":[],"class_list":["post-1709","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-57","category-diai","category-diip","category-phd-scholarships"],"_links":{"self":[{"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/posts\/1709","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/users\/560"}],"replies":[{"embeddable":true,"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/comments?post=1709"}],"version-history":[{"count":9,"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/posts\/1709\/revisions"}],"predecessor-version":[{"id":2279,"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/posts\/1709\/revisions\/2279"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/media\/2263"}],"wp:attachment":[{"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/media?parent=1709"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/categories?post=1709"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wordpress-test.app.u-pariscite.fr\/diip\/wp-json\/wp\/v2\/tags?post=1709"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
Alexandra ROGOVA<\/strong>
(IRIF, DI ENS)<\/p>\n
Am\u00e9lie GHEERBRANT<\/strong> (IRIF, UPC),
Leonid LIBKIN<\/strong> (Laboratory for Foundations of Computer Science, University of Edinburgh)<\/p>\nProject Summary<\/strong><\/h3>\n
data as a graph only when necessary, whereas GQL is standalone and stores the data as a native graph. While this standardization work is a step in the right direction, there is one crucial ingredient missing: a corresponding theoretical model.<\/p>\nOther projects
<\/span><\/h2>\n