{"id":3338,"date":"2018-05-15T09:58:58","date_gmt":"2018-05-15T07:58:58","guid":{"rendered":"\/?page_id=3338"},"modified":"2018-05-15T10:15:13","modified_gmt":"2018-05-15T08:15:13","slug":"ioana-manolescu","status":"publish","type":"page","link":"\/program\/keynote-speakers\/ioana-manolescu\/","title":{"rendered":"Ioana Manolescu"},"content":{"rendered":"
INRIA, Paris-Saclay, Paris, France<\/p>\n<\/div>\n<\/div><\/div>
<\/p>\n<\/div>\n<\/div><\/div>
<\/p>\n
Abstract:<\/strong><\/p>\n RDF graphs comprise highly complex data, both from a structural and from a semantic perspective. This makes them hard to discover and learn, and hinders their usability.<\/p>\n An elegant basis for summarizing graphs is provided by the graph quotient formalism. In a nutshell, a graph quotient specifies a way to view some graph nodes as equivalent to each other, and represents a graph through its equivalence classes based on this equivalence.<\/p>\n I will present work carried in my last team over the last few years, on quotient summarization of semantic-rich RDF graph. In particular, I will introduce a set of summaries particularly suited for the heterogeneous structure of RDF graphs, and discuss novel results at the interplay of summarization and saturation with RDF Schema rules.<\/p>\n <\/p>\n Bio:<\/strong><\/p>\n Ioana Manolescu is the lead of the CEDAR Inria team, focusing on rich data analytics at cloud scale. She is a member of the PVLDB Endowment Board of Trustees, and a co-president of the ACM SIGMOD Jim Gray PhD dissertation committee. Recently, she has been a general chair of the IEEE ICDE 2018 conference, an associate editor for PVLDB 2017 and 2018, and the\u00a0 program chair of SSDBBM 2016. She has co-authored more than 130 articles in international journals and conferences, and contributed to several books.\u00a0 Her main research interests include data models and algorithms for computational fact-checking, performance optimizations for semistructured data and the Semantic Web, and distributed architectures for complex large data.<\/p>\n<\/div>\n<\/div><\/div><\/div><\/div><\/div><\/div>","protected":false},"excerpt":{"rendered":" INRIA, Paris-Saclay, Paris, France Structural Summarization of Semantic Graphs Abstract: RDF graphs comprise highly complex data, both from a structural and from a semantic perspective. This makes them hard to discover and learn, and hinders their usability. An elegant basis for summarizing graphs is provided by the graph quotient formalism. In a nutshell, a […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":1591,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"yoast_head":"\n