Abstract
Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processing techniques in such systems. However, although many applications associated with object databases also have stringent performance requirements, there has been much less work investigating parallel object database systems. An important feature for the performance of object databases is the speed at which relationships can be explored. In queries, this depends upon the effectiveness of different join algorithms into which queries that follow relationships can be compiled. This paper presents the results of empirical evaluations of four parallel join algorithms, two value based and two pointer based. The experiments have been run on Polar, a parallel ODMG object database system.
Chapter PDF
Similar content being viewed by others
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
R. Braumandl, J. Claussen, A. Kemper, and D. Kossmann. Functional-join processing. VLDB Journal, 8(3+4):156–177, 2000.
M. Carey, D. J. DeWitt, and J. F. Naughton. The OO7 benchmark. In ACM SIGMOD, pages 12–21, 1993.
D. J. DeWitt, D. F. Lieuwen, and M. Mehta. Pointer-based join techniques for object-oriented databases. In Proc. of the 2nd Int. Conference on Parallel and Distributed Information Systems (PDIS), pages 172–181. IEEE-CS, 1993.
D. J. DeWitt, J. F. Naughton, J. C. Shafer, and S. Venkataraman. Parallelising OODBMS traversals: A performance evaluation. VLDB Journal, 5(1):3–18, January 1996.
L. Fegaras and D. Maier. Optimizing object queries using an effective calculus. ACM Transactions on Database Systems, December 2000.
G. Graefe. Encapsulation of parallelism in the Volcano query processing system. In ACM SIGMOD, pages 102–111, 1990.
G. Graefe. Iterators, schedulers, and distributed-memory parallelism. Software-Practice and Experience, 26(4):427–452, April 1996.
E. Shekita and M. J. Carey. A performance evaluation of pointer-based joins. In ACM SIGMOD, pages 300–311, Atlantic City, NJ, May 1990.
J. Smith, S. F. M. Sampaio, P. Watson, and N. W. Paton. Polar: An architecture for a parallel ODMG compliant object database. In Conference on Information and Knowledge Management (CIKM), pages 352–359. ACM press, 2000.
S. Y. W. Su, S. Ranka, and X. He. Performance analysis of parallel query processing algorithms for object-oriented databases. IEEE TDKE, 12(6):979–997, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Mendes Sampaio, S.F., Smith, J., Paton, N.W., Watson, P. (2001). An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_41
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive