Abstract
Performance in parallel database systems very much depends on how data is placed on a network of processing elements. In designing a data placement method, particularly for high performance parallel object-oriented databases, two major factors that most of the time contradict each other, particularly minimizing communication cost and maintaining load balance, must be taken in account. Our experiments' results show that it is not feasible to trade I/O balancing with low communication costs, although these two factors are critical. Therefore, an ideal data placement method must feature a reasonable I/O balancing combined with low communication whenever possible, not the other way round.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bell,D. “Difficult Data Placement Problems”, Computer Journal,vol 27,no 4,pp.315–320,1984.
Bertino, E., et. al., “Clustering Techniques in Object Bases: A Survey”, Data & Knowledge Engineering 12, pp. 255–275, 1994.
Cheng, J-b.R., and Hurson, A.R., “Effective Clustering of Complex Objects in Object-Oriented Databases”, Proceedings of the ACM SIGMOD Conference, pp-99–108, 1991.
DeWitt, D., and Gray, J., “Parallel Database Systems: The Future of High Performance Database Systems”, Communication of the ACM, vol. 35, no. 6, pp. 85–98, 1992.
Ghanderahizadeh, S., and DeWitt, D., “Hybrid-Range Partitioning Strategy: a New Declustering Strategy for Multiprocessor Database Machines”, Proceedings of the 16th VLDB Conference, Brisbane, pp. 481–492, 1990.
Ghanderahizadeh, S., and DeWitt, D., “MAGIC: A Multiattribute Declustering Mechanism for Multiprocessor Database Machines”, IEEE TPDS, vol. 5, no. 5, pp. 509–524, 1994.
Leung, C.H.C. and Taniar, D. “Parallel Query Processing in Object-Oriented Database Systems”, Australian Computer Science Communications,vol 17,no 2, pp. 119–131, 1995.
Patterson, D.A., and Hennessy, J.L., Computer Organization & Design: The Hardware/Software Interface, Morgan Kaufmann, 1994.
Taniar, D., “Parallelization Models for Path Expression Queries in Object-Oriented Databases”, Proceedings of Joint Conference on Information Sciences, Volume 3: Rough Set and Computer Science, Research Triangle Park, North Carolina, pp. 215–218, 1997.
Taniar, D., Liu, K.H., and Leung, C.H.C., “Factors Affecting Performance Speed-up of Parallel Object-Oriented Systems”, Proceedings of the 4th Australasian Conference on Parallel and Real-Time Systems PART '97, Springer-Verlag, pp. 27–38, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taniar, D. (1998). Toward an ideal data placement scheme for high performance object-oriented database systems. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037178
Download citation
DOI: https://doi.org/10.1007/BFb0037178
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64443-9
Online ISBN: 978-3-540-69783-1
eBook Packages: Springer Book Archive