Chapter

Data Warehousing and Knowledge Discovery

Volume 3589 of the series Lecture Notes in Computer Science pp 200-209

Ad Hoc Star Join Query Processing in Cluster Architectures

  • Josep Aguilar-SaboritAffiliated withComputer Architecture Department, Universitat Politecnica de Catalunya
  • , Victor Muntés-MuleroAffiliated withComputer Architecture Department, Universitat Politecnica de Catalunya
  • , Calisto ZuzarteAffiliated withIBM Toronto Lab.
  • , Josep-L. Larriba-PeyAffiliated withComputer Architecture Department, Universitat Politecnica de Catalunya

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Processing of large amounts of data in data warehouses is increasingly being done in cluster architectures to achieve scalability. In this paper we look into the problem of ad hoc star join query processing in clusters architectures. We propose a new technique, the Star Hash Join (SHJ), which exploits a combination of multiple bit filter strategies in such architectures. SHJ is a generalization of the Pushed Down Bit Filters for clusters. The objectives of the technique are to reduce (i) the amount of data communicated, (ii) the amount of data spilled to disk during the execution of intermediate joins in the query plan, and (iii) amount of memory used by auxiliary data structures such as bit filters.