This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)
A new algorithm for small-large table outer joins in parallel DBMS
Long Beach, CA, USA
March 01-March 06
ISBN: 978-1-4244-5445-7
Yu Xu, Teradata, San Diego, USA
Pekka Kostamaa, Teradata, El Segundo, USA
Large enterprises have been relying on parallel database management systems (PDBMS) to process their ever-increasing data volume and complex queries. Business intelligence tools used by enterprises frequently generate a large number of outer joins and require high performance from the underlying database systems. A common type of outer joins in business applications is the small-large table outer join studied in this paper where one table is relatively small and the other is large. We present an efficient and easy to implement algorithm called DER (Duplication and Efficient Redistribution) for small and large table outer joins. Our experimental results show that the DER algorithm significantly speeds up query elapsed time and scales linearly.
Citation:
Yu Xu, Pekka Kostamaa, "A new algorithm for small-large table outer joins in parallel DBMS," icde, pp.1018-1024, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 2010
Usage of this product signifies your acceptance of the Terms of Use.