https://peertube.watch/videos/watch/ba79aac3-d9c9-47e6-8cd1-718af16f8a0b The talk will present G-CORE and its most striking features. G-CORE is a graph query language proposal developed by Linked Data Benchmark Council (LDBC). It is a closed graph query language that includes graph pattern matching, inclusive extended regular path expressions, graph construction (graph projection and graph aggregation), and (weighted) shortest path finding. The query language queries graphs and returns a graph. Hence, it supports views and correlated sub-queries, which have proven their worth in the relational databases. To ensure that the query language is practically usable on large data, G-CORE builds on previous complexity results and carefully select useful features, but restricted in such ways that the resulting language is polynomial in data complexity. As such, G-CORE connects the practical work done in industrial proposals with the foundational research on graph databases; in fact, it can be considered as a bridge between these two worlds. Speaker: Hannes Voigt, Track: Graph Processing, Room: H.2214, When: Saturday 3 February 2018, 13:30–14:05 (Brussels time), Schedule: FOSDEM 2018 event page, Licence: Creative Commons Attribution 2.0 Belgium (CC BY 2.0 BE) (as stated in the FOSDEM video archive). Attribution: “G-CORE: The LDBC Graph Query Language Proposal” by Hannes Voigt, FOSDEM 2018. Original recording: 2018/H.2214/gcore_query_language.webm from the FOSDEM video archive. This channel is an unofficial mirror; FOSDEM is a free and non-commercial event organised by the community for the community. Sun, 11 Oct 2026 02:56:05 GMT https://validator.w3.org/feed/docs/rss2.html PeerTube - https://peertube.watch https://peertube.watch/lazy-static/avatars/3b284627-b75f-409e-ac2e-10f4c2946f43.png https://peertube.watch/videos/watch/ba79aac3-d9c9-47e6-8cd1-718af16f8a0b All rights reserved, unless otherwise specified in the terms specified at https://peertube.watch/about and potential licenses granted by each content's rightholder.