Algorithms for Big Data [electronic resource] : DFG Priority Program 1736 / edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck.

Algorithms for Large and Complex Networks Algorithms for Large-scale Network Analysis and the NetworKit Toolkit -- Generating Synthetic Graph Data from Random Network Models -- Sampling Efficiency for the Link Assessment Problem -- A Custom Hardware Architecture for the Link Assessment Problem -- Graph-based Methods for Rational Drug Design -- Recent Advances in Practical Data Reduction -- Skeleton-based Clustering by Quasi-Threshold Editing -- The Space Complexity of Undirected Graph Exploration -- Algorithms for Big Data and their Applications Scalable Cryptography -- Distributed Data Streams -- Energy-Efficient Scheduling -- The GENO Software Stack -- Laue Algorithms for Big Data Problems in de Novo Genome Assembly -- Scalable Text Index Construction. Big Data, Scalability, Algorithms, Applications, Graphs, Networks, Parallelism, Distributed, Memory Hierarchy, Algorithm Engineering, Network Analysis, Random Graphs, Graph Clustering, Data Streams, Cryptography, Energy Efficiency, Text Indices.

Open Access

This open access book surveys the progress in addressing selected challenges related to the growth of big data in combination with increasingly complicated hardware. It emerged from a research program established by the German Research Foundation (DFG) as priority program SPP 1736 on Algorithmics for Big Data where researchers from theoretical computer science worked together with application experts in order to tackle problems in domains such as networking, genomics research, and information retrieval. Such domains are unthinkable without substantial hardware and software support, and these systems acquire, process, exchange, and store data at an exponential rate. The chapters of this volume summarize the results of projects realized within the program and survey-related work. This is an open access book.