Year: 2016
Type: dissertation
Abstract: Graphs have been increasingly important to represent data such as the World Wide Web, social networks, biological networks.With the explosion of information, big data leads to big graphs.These big graphs are often stored in a distributed system, leading to many difficulties in proposing efficient algorithms for processing big graphs.While many distributed programming models for graphs have been proposed, MapReduce and Pregel have been shown to be scalable to deal with big data as well as big graphs.Nonetheless, to obtain scalability, these models offer restricted forms in which users specify their programs.Hence, it is non-trivial for users to write their complicated programs as well as to obtain efficient ones.
Authors: LE, Duc Tung, レ, ダック タン, LE, Duc Tung
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6987552895
