Algorithms for Big Data: Graphs and PageRank

Autor:	Prado, Sergio García
Jazyk:	Spanish; Castilian
Rok vydání:	2017
Předmět:	Computer Science - Data Structures and Algorithms
Druh dokumentu:	Working Paper
Popis:	This work consists of a study of a set of techniques and strategies related with algorithm's design, whose purpose is the resolution of problems on massive data sets, in an efficient way. This field is known as Algorithms for Big Data. In particular, this work has studied the Streaming Algorithms, which represents the basis of the data structures of sublinear order $o(n)$ in space, known as Sketches. In addition, it has deepened in the study of problems applied to Graphs on the Semi-Streaming model. Next, the PageRank algorithm was analyzed as a concrete case study. Finally, the development of a library for the resolution of graph problems, implemented on the top of the intensive mathematical computation platform known as TensorFlow has been started. Comment: in Spanish, 143 pages, final degree project (bachelor's thesis)
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1708.07829 Zobrazit plný text záznamu View this record from Arxiv