Abstract
A data warehouse is a large database integrating data from a number of enterprise independent source application databases over a long period of time [8]. A data warehouse is organized around major subjects (entities) of an enterprise and not around its functions. For example, in a banking environment which has two independent source databases, one for savings account functions and the other for chequing account functions, a data warehouse that integrates these two databases has the following basic structure: bt (customised (C), accounttype (A), time (T), balance).
This research was supported by the Natural Science and Engineering Research Council (NSERC) of Canada under an operating grant (OGP-0194134) and a University of Windsor startup grant.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ramon Barquin and Herb Edelstein. Planning and Designing the Data Warehouse. Prentice Hall, 1997.
S. Chakravarthy, J. Muthuraj, R. Varadarajan, and S. B. Navathe. An Objective Function for Vertically Partitioning Relations in Distributed Databases and its Analysis. Distributed and Parallel Databases, 2(1): 183–207, 1993.
C. I. Ezeife and Ken Barker. Distributed Object Based Design: Vertical Fragmentation of Classes. Submitted to Journal of DAPSs, 1996.
C.I. Ezeife. A Uniform Approach For Selecting Views and Indexes in a Data Warehouse. Proceedings of the International Database Engineering and Applications Symposium, Montreal, Canada, IEEE, 1997.
J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. Proceedings of the 12th International Conference on Data Engineering, pages 152–159, 1996.
Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, and Jeffrey Ullman. Index Selection for OLAP. In International Conference on Data Engineering, Burmingham, U.K, 1997.
Venky Harinarayan, Anand Rajaraman, and Jeffrey Ullman. Implementing Data Cubes Efficiently. In ACM SIGMOD International Conference on Management of Data, June 1996.
W. H. Inmon. Building the Data Warehouse. John Wiley & Sons, Inc., second edition, 1996.
W.T. McCormick, P.J. Schweitzer, and T.W. White. Problem Decomposition and Data Reorganization by a Clustering Technique. Operations Research, 20(5), 1972.
Inderpal S. Mumick, Dalian Quass, and Barinderpal S. Mumick. Maintenance of Data Cubes and Summary Tables in a Warehouse. Working Paper, 1996.
S.B. Navathe, S. Ceri, G. Wiederhold, and J. Dou. Vertical Partitioning Algorithms for Database Design. ACM Transactions on Database Systems, 9(4), 1984.
M.T. Ozsu and P. Valduriez. Principles of Distributed Database Systems. Prentice Hall, 1991.
J. Widom. Research Problems in Data Warehousing. In Proceedings of the 4th International Conference on Information and Knowledge Management (CIKM), November 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ezeife, C.I. (1997). Accommodating Dimension Hierarchies in a Data Warehouse View/Index Selection Scheme. In: Wojtkowski, W.G., Wojtkowski, W., Wrycza, S., Zupančič, J. (eds) Systems Development Methods for the Next Century. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5915-3_17
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5915-3_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7712-2
Online ISBN: 978-1-4615-5915-3
eBook Packages: Springer Book Archive