Abstract
The performance of OLAP queries can be improved drastically if the warehouse data is properly selected and indexed. The problems of selecting and materializing views and indexing data have been studied extensively in the data warehousing environment. On the other hand, data partitioning can also greatly increase the performance of queries. Data partitioning has advantage over data selection and indexing since the former one does not require additional storage requirement. In this paper,we show that it is beneficial to integrate the data partitioning and indexing (join indexes)techniques for improving the performance of data warehousing queries.We present a data warehouse tuning strategy, called PartJoin, that decomposes the fact and dimension tables of a star schema and then selects join indexes. This solution takes advantage of these two techniques, i.e., data partitioning and indexing. Finally,we present the results of an experimental evaluation that demonstrates the effectiveness of our strategy in reducing the query processing cost and providing an economical utilisation of the storage space.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Bellatreche, K. Karlapalem, and Q. Li.Evaluation of indexing materialized views in data warehousing environments.Proceedings of the International Conference on Data Warehousing and Knowledge Discovery (DAWAK’ 2000),pages 57–66, September 2000.
L. Bellatreche, K. Karlapalem, and M. Mohania.What can partitioning do for your data warehouses and data marts? Proceedings of the International Database Engineering and Application Symposium (IDEAS’ 2000), pages 437–445,September 2000.
L. Bellatreche, M. Schneider, M. Mohania, and B. Bhargava.Partjoin:An efficient storage and query execution for data warehouses.extended version,available at http://www.imerir.com/.ladjel, January 2002.
S. Chaudhuri and V. Narasayya.An efficient cost-driven index selection tool for microsoft sql server. Proceedings of the International Conference on Very Large Databases, pages 146–155,August 1997.
OLAP Council. Apb-1 olap benchmark, release ii.http://www.olapcouncil.org/research/bmarkly.htm,1998.
S. Guo, S. Wei, and M.A. Weiss.On satisfiability, equivalence, and implication problems involving conjunctive queries in database systems.IEEE Transactions on Knowledge and Data Engineering, 8(4):604–612,August 1996.
P.O 'Neil and D. Quass.Improved query performance with variant indexes.Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 38–49, May 1997.
M.T. Özsu and P. Valduriez. Principles of Distributed Database Systems:Second Edition.Prentice Hall,1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellatreche, L., Schneider, M., Mohania, M., Bhargava, B. (2002). PartJoin:An Efficient Storage and Query Execution for Data Warehouses. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2002. Lecture Notes in Computer Science, vol 2454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46145-0_29
Download citation
DOI: https://doi.org/10.1007/3-540-46145-0_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44123-6
Online ISBN: 978-3-540-46145-6
eBook Packages: Springer Book Archive