Abstract
This paper describes and evaluates new methods for relation declustering in parallel databases. To process queries in parallel, relations are partitioned across multiple processors, typically by using the value of one single attribute. This kind of declustering has resulted in poor performance in the presence of data skew. Alternatively, the work contained herein proposes several strategies to decluster a relation through the use of multiple attributes. To demonstrate the validity of our approach, a thorough performance evaluation is done. The findings demonstrate the effectiveness of this kind of partitioning methods as opposed to traditional ones. In addition we analyze the performance of the different strategies relative to the speed-up and scale-up metrics.
To sum up, performance results reveal that multi-dimensional declustering methods constitute a very promising alternative to conventional one-dimensional methods to partition relations in parallel database systems.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Barrena, “Técnicas de Particionamiento Multidimensional Basadas en Indices Multiatributos en Bases de Datos Paralelas”. Doctoral Dissertation. Madrid. Dic, 1995.
M. Barrena et al., “Multi-dimensional Declustering Methods for Parallel Database Systems”, Tech. Report. University of Extremadura. 1996.
H. Boral et al., “Prototyping Bubba, A Highly Parallel Database System”, IEEE Trans. on Knowledge and Data Engineering, pp: 4–24, vol 2(1), March 1990.
D. DeWitt, and J. Gray “Parallel Database Systems: The Future of High Performance Database Systems”, CACM, Vol 35, No. 6, June 1992.
S. Ghandeharizadeh et al. “MAGIC: A Multiattribute Declustering Mechanism for Multiprocessor Database Machines”, IEEE Tr. P&D. Syst., Vol. 5, No. 2, May 1994.
Lomet D. B. et al. “The hB-Tree: A Multi-attribute Indexing Method with Good Guaranteed Performance”. ACM Trans. on Database Systems, Vol. 15, Nℴ 4, Dec. 1990
H. Lu et al. “Query Processing in Parallel Relational Database Systems”. IEEE Computer Society Press, Los Alamitos, Calif. 1994.
A. Polo et al., “Multi-dimensional Partitioning for Masivelly Parallel Database Systems”.Proc. 3th Euromicro Workshop on Parallel and Distributed Processing. IEEE CS Press. Jan. 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barrena, M., Hernández, J., Martínez, J.M., Polo, A., de Miguel, P., Nieto, M. (1996). Multi-dimensional declustering methods for parallel database systems. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024788
Download citation
DOI: https://doi.org/10.1007/BFb0024788
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive