An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs

DOI10.3390/a9010007zbMath1461.68026OpenAlexW2225118578MaRDI QIDQ1736757

Roberto de Virgilio, Alfredo Cuzzocrea, Mirel Cosulschi

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a9010007

zbMATH Keywords

MapReduce algorithmsBFS-traversals of RDF graphseffective and efficient algorithms for big data processing

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15) Internet topics (68M11) Computational aspects of data analysis and big data (68T09)

Related Items (1)

Algorithms for managing, querying and processing big data in cloud environments

Uses Software

• MapReduce
• Hadoop
• rapidminer
• SAPPER
• Apache Pig
• Bigtable
• Apache Spark
• Amazon EC2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evaluating entity linking with Wikipedia
• A unified approach to parallel depth-first traversals of general trees
• Breadth-first traversal of trees and integer sorting in parallel
• Space/time trade-offs in hash coding with allowable errors
• Statistical significance of the Netflix challenge
• Coopetition against an Amazon

This page was built for publication: An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs