Multi-table joins through bitmapped join indices
ACM SIGMOD Record
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Data warehousing and OLAP for decision support
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Materialized views and data warehouses
ACM SIGMOD Record
Caching multidimensional queries using chunks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Bitmap index design and evaluation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Improving OLAP Performance by Multidimensional Hierarchical Clustering
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
On the Use of Bit Filters in Shared Nothing Partitioned Systems
IWIA '05 Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems
Star join revisited: Performance internals for cluster architectures
Data & Knowledge Engineering
Hi-index | 0.00 |
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.