Title: Top-K Shortest Path in Large Typed RDF Graphs Challenge ESWC2016 Challenge http://2016.eswc-conferences.org/call-challenges May 29th, 2016 - June 2nd, 2016 Anissaras, Crete, Greece Website: https://bitbucket.org/ipapadakis/eswc2016-challenge
Overview: The advent of SPARQL 1.1 introduced property paths as a new graph matching paradigm that allows the employment of Kleene star * (and it's variant +) unary operators to build SPARQL queries that are agnostic of the underlying RDF graph structure. The ability to express path patterns that are agnostic of the underlying graph structure is certainly a step forward. Still though, it is impossible to retrieve the actual paths through a property path sparql query. In this challenge, we ask for a system capable of returning the actual paths between two URIs in a RDF graph ranked by their length. This is of evident interest for big data approaches, because it enlarges the scope for picking up tuples / data while concurrently establishing a route between them that may be interpreted in different ways. Organizing Committee: - Ioannis Papadakis - Michalis Stefanidakis - Phivos Mylonas - Brigitte Endres-Niggemeyer Program Committee: - Sherif Sakr, Senior Researcher in the Software Systems Research Group at National ICT Australia (NICTA), ATP lab, Sydney, Australia - Emanuele Della Valle, Assistant Professor at the Department of Electronics, Information and Bioengineering of the Politecnico di Milano - Heiko Paulheim, Assistant Professor at the University of Mannheim, head of Data and Web Science Group - Dimitrios Tsoumakos, Assistant Professor, Faculty of Informatics and Information Science, Ionian University, member of Computing Systems Laboratory, NTUA - Guohui Xiao, Assistant professor, Free University of Bozen-Bolzano, member of KRDB Research Centre for Knowledge and Data - Axel-Cyrille Ngonga Ngomo, Department of Computer Science at the University of Leipzig, member of Semantic Abstraction Group - Olivier Corby, Researcher at Inria & I3S - Prof. Dr. Jens Lehmann, Computer Science Institute, University of Bonn, Knowledge Discovery Department, Fraunhofer IAIS Important Dates: - Challenge papers submission deadline: Friday March 11th, 2016 - Challenge paper reviews due: Tuesday April 5th, 2016 - Notifications sent to participants: Friday April 8th, 2016 - Test data published: Friday April 8th, 2016 - Camera ready papers due: Sunday April 24th, 2016 ------------------------------------------------------------------------------ Site24x7 APM Insight: Get Deep Visibility into Application Performance APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month Monitor end-to-end web transactions and take corrective actions now Troubleshoot faster and improve end-user experience. Signup Now! http://pubads.g.doubleclick.net/gampad/clk?id=267308311&iu=/4140 _______________________________________________ Dbpedia-discussion mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/dbpedia-discussion
