RDFPath: path query processing on large RDF graphs with MapReduce

Abstract: The MapReduce programming model has gained traction in different application areas in recent years, ranging from the analysis of log files to the computation of the RDFS closure. Yet, for most users the MapReduce abstraction is too low-level since even simple computations have to be expressed as Map and Reduce phases. In this paper we propose RDFPath, an expressive RDF path query language geared towards casual users that benefits from the scaling properties of the MapReduce framework by automatically transforming declarative path queries into MapReduce jobs. Our evaluation on a real world data set shows the applicability of RDFPath for investigating typical graph properties like shortest paths

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Edition: Postprint
• Language: Englisch
• Notes: García-Castro R., Fensel D., Antoniou G. (eds) The Semantic Web: ESWC 2011 Workshops. ESWC 2011. Lecture Notes in Computer Science, vol 7117, isbn: 978-3-642-25952-4 ; cc_by_nc_nd http://creativecommons.org/licenses/by-nc-nd/4.0/deed.de cc

Classification and Topics

• Classification: Informatik
• Keyword: Hadoop ; RDF ; Semantic Web

Contributors, Places and Time

• Event: Veröffentlichung
• (where): Freiburg
• (who): Universität
• (when): 2012
• Creator: Przyjaciel-Zablocki, Martin ; Schätzle, Alexander ; Hornung, Thomas Daniel ; Lausen, Georg
• Contributor: Albert-Ludwigs-Universität Freiburg ; Institut für Informatik ; Technische Fakultät

Further information

• DOI: 10.1007/978-3-642-25953-1_5
• URN: urn:nbn:de:bsz:25-freidok-122687
• Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 25.03.2025, 1:56 PM CET