English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

espanolEste articulo presenta una comparativa del rendimiento de las herramientas Hadoop y Giraph para de procesamiento de grandes volumenes de informacion o Big Data con el fin mostrar su utilidad para el procesamiento de Big Graph. El analisis y procesamiento de grandes volumenes de informacion representa un verdadero desafio en la actualidad. Ya existen metodologias y herramientas libres para el procesamiento de Big Data como las mencionadas: Hadoop para el procesamiento de grandes volumenes de datos, principalmente no estructurados, y Giraph para el procesamiento de grandes grafos o Big Graph. En esta comparativa, este trabajo presenta un analisis del costo en tiempo de ejecucion practico de la implementacion del algoritmo PageRank, el cual permite clasificar paginas Web segun su relevancia, y de algoritmos para encontrar un arbol de expansion minima en un grafo. Los experimentos muestran que el uso de Giraph para el procesamiento de Big Graph reduce el tiempo de ejecucion en un 25% respecto a los resultados con el uso de Hadoop. EnglishThis article presents a comparison of the performance of the tools Hadoop y Giraph for the analysis and processing of large volumes of information or Big Data, with the aim of showing their usefulness for Big Graph processing. The analysis and processing of large volumes of information represents a real challenge nowadays. There already exist Big Data methodologies and free processing tools such as those mentioned above: Hadoop for processing large volumes of data, mainly non-related data, and recently Giraph for processing large graphs or Big Graph. In this comparison, this paper presents an analysis of the execution time cost for the practical implementation of the PageRank algorithm, which classifies Web pages according to their relevance, and of algorithms to find the minimum spanning tree in a graph. Experiments show that the use of Giraph for processing Big Graphs reduces the execution time by 25% with respect to the results obtained using Hadoop.

Ejemplos de Aplicabilidad de Giraph y Hadoop para el Procesamiento de Grandes Grafos