Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Algorithms for big data
Bast H., Korzen C., Meyer U., Penschuck M., Springer International Publishing, Cham, Switzerland, 2023. 299 pp. Type: Book (3031215338)
Date Reviewed: Feb 7 2024

This book is an output from the German Research Foundation’s priority programme SPP 1736 on “Algorithms for Big Data.” SPP 1736 funded 15 projects, and a few projects with their own funding were also associated with the programme. There are eight papers under the broad heading “Algorithms for Large and Complex Networks,” and six under the broad heading “Algorithms for Big Data and Their Applications.”

As might be expected, the papers differ substantially in the breadth of their applicability. One of potentially wider applicability is Albers’ paper on energy-efficient scheduling. We assume that a processor running at speed s takes energy sα (typically α=2,3) and ask how best to schedule jobs, particularly in an online setting where we don’t know the future load. However, the author points out that the offline setting is more relevant than one might think, as it covers predicting the future from the past. There are variants with heterogenous processors, and where machines can be powered down (but powering up costs energy).

Some papers are software-oriented, for example, Angriman et al.’s paper on the NetworKit toolkit for large-scale network analysis. There’s also Giesen et al.’s paper “The GENO Software Stack”--GENO (generic optimization) is a domain-specific language (DSL) for mathematical optimization. One component is autoBLAS, a compiler that translates formal linear algebra expressions into optimized BLAS calls--again, this might have wider applicability.

In their paper “Scalable Cryptography,” Hofheinz and Kiltz raise an interesting question relevant to big data. With plausible parameters, PKCS is secure against 280 attacks. However, if we assume 230 users (many fewer than the number of mobile phones) and 230 ciphertexts, our provable security drops to 220--trivial. This team’s work is the first identity-based encryption (IBE) scheme whose security properties do not degrade in the number of ciphertexts.

There are also papers on genome assembly, scalable text indices, and much else.

This book covers a wide range of topics in big data research. If I were running a master’s program in big data, I would use this book as a source for dissertations. It’s hard to envisage anyone (except perhaps a starting PhD student wanting to get a feel for the range of big data research) reading the entire book, but the individual papers will have their own readerships.

Reviewer:  J. H. Davenport Review #: CR147703
Bookmark and Share
  Featured Reviewer  
Algorithms (B.2.4 ... )
Algorithm Design And Analysis (G.4 ... )
Algorithms (I.5.3 ... )
Algorithms (I.1.2 )
Data (E )
Would you recommend this review?
Other reviews under "Algorithms": Date
Integer summing algorithms on reconfigurable meshes
Nakano K., Wada R. Theoretical Computer Science 197(1-2): 57-77, 1998. Type: Article
Dec 1 1998
Bit-level two’s complement matrix multiplication
Grover R., Shang W., Li Q. Integration, the VLSI Journal 33(1): 3-21, 2002. Type: Article
Oct 2 2003
 New approach to design for reusability of arithmetic cores in systems-on-chip
Margala M., Wang H. Integration, the VLSI Journal 38(2): 185-203, 2004. Type: Article
Aug 17 2005

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy