Abstract
Partitioning is the process of dividing a logical database into distinct independent datasets. Partitions are database objects itself and can be managed independently. The main reason to apply data partitioning is to achieve data-level parallelism Data-level parallelism and thus to enable performance gains. Nowadays, multi-core CPUs that are capable to process several distinct data areas in parallel harness partitioned data structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Transparent in IT means that something is completely invisible to the user, not that the user can inspect the implementation through the cover. Except of their effects like improvements in speed or usability, transparent components should not be noticeable at all.
- 2.
NP-complete means that the problem can not be solved in polynomial time.
- 3.
Based on the assumption that the companies’ customers mainly live nowadays and are between 0 and 100 years old.
- 4.
A hash function maps a potentially large amount of data with often variable length to a smaller value of fixed length. In the figurative sense, hash functions generate a digital fingerprint of the input data.
Reference
R. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, ed. by R. Miller, J. Thatcher (Plenum Press, New York, 1972), pp. 85–103
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Plattner, H. (2014). Partitioning. In: A Course in In-Memory Data Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55270-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-55270-0_9
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)