Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Multi-table joins through bitmapped join indices
ACM SIGMOD Record
A super scalar sort algorithm for RISC processors
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
High-performance sorting on networks of workstations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
An alternative storage organization for ROLAP aggregate views based on cubetrees
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Cost-based optimization of decision support queries using transient-views
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
High-dimensional index structures database support for next decade's applications (tutorial)
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
Including Group-By in Query Optimization
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
On the Computation of Multidimensional Aggregates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Answering Queries with Aggregation Using Views
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Hi-index | 0.00 |
When the relational storage method is adopted in the data warehouse system, the most time-consuming operations in OLAP query are multitable join and group-by aggregation. Based on the characteristics of the data warehouse itself and the applications run on it, one new multi-table join algorithm -- Mjoin is given in this paper. And the performance of this new Mjoin algorithm is improved greatly, compared with other traditional multitable join algorithms. In this paper, a new sorting based group-by aggregation algorithm -- MuSA is also given, based on the Mjoin algorithm. The speed of sorting is remarkably improved in this new sorting based aggregation algorithm, as the keyword mapping technology is used to compress the sort keywords in the course of sorting.