Abstract
In the following, we discuss how to achieve parallelism in in-memory and traditional database management systems. Pipelined parallelism and data parallelism are two approaches to speed up query processing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
G.M. Amdahl, Validity of the single processor approach to achieving large scale computing capabilities, in Proceedings of the April 18–20, 1967, Spring Joint Computer Conference, AFIPS ’67 (Spring) (ACM, New York, 1967), pp. 483–485
L. Dagum, R. Menon, Openmp: an industry-standard api for shared-memory programming. IEEE Comput. Sci. Eng. 5(1), 46–55 (1998)
J. Dean, S. Ghemawat, Mapreduce: simplified data processing on large clusters. Comm. ACM 51(1), 107–113 (2008)
W. Gropp, E. Lusk, A. Skjellum, Using MPI: Portable Parallel Programming with the Message-Passing Interface (MIT Press, Cambridge, MA, 1994)
J.L. Gustafson, Reevaluating amdahl’s law. Commun. ACM 31(5), 532–533 (1988)
J.L. Hennessy, D.A. Patterson, Computer Architecture: A Quantitative Approach, 5th edn. (Elsevier Science, Burlington, 2011)
K. Li, Shared virtual memory on loosely coupled multiprocessors. Ph.D. thesis, New Haven, 1986 (AAI8728365)
G. Moore, Cramming more components onto integrated circuits. Electronics 38, 114 ff. (1965)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Plattner, H. (2014). Parallel Data Processing. In: A Course in In-Memory Data Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55270-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-55270-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-55269-4
Online ISBN: 978-3-642-55270-0
eBook Packages: Business and EconomicsBusiness and Management (R0)