Abstract
Database partitioning is a common technique adopted by database systems running on single or multiple physical machines. It is always crucial yet challenging for a DBA to choose an appropriate partitioning scheme for a database according to a specific query workload. In this paper, we present PEACOD, a platform that aims to ease the burden of DBAs for database partitioning design. By automating the processing of database partitioning scheme evaluation and comparison, PEACOD provides the DBAs with a conventional way to choose a suitable scheme.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
DeWitt, D., Gray, J.: Parallel database systems: the future of high performance database systems. Comm. ACM (1992)
DeCandia, G., Hastorun, D., Jampani, M., et al.: Dynamo: Amazon’s highly available key-value store. In: SOSP (2007)
Curino, C., Jones, E., Zhang, Y., Madden, S.: Schism: a Workload Driven Approach to Database Replication and Partitioning. In: VLDB (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, X., Chen, J., Cao, Y., Yang, M. (2012). PEACOD: A Platform for Evaluation and Comparison of Database Partitioning Schemes. In: Lee, Sg., Peng, Z., Zhou, X., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29035-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-29035-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29034-3
Online ISBN: 978-3-642-29035-0
eBook Packages: Computer ScienceComputer Science (R0)