Skip to main content

Applying Vertical Fragmentation Techniques in Logical Design of Multidimensional Databases

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1874))

Abstract

In the context of multidimensional databases implemented on relational DBMSs through star schemes, the most effective technique to enhance performances consists of materializing redundant aggregates called views. In this paper we investigate the problem of vertical fragmentation of views aimed at minimizing the workload response time. Each view includes several measures which not necessarily are always requested together; thus, the system performance may be increased by partitioning the views into smaller tables. On the other hand, drill-across queries involve measures taken from two or more views; in this case the access costs may be decreased by unifying these views into larger tables. After formalizing the fragmentation problem as a 0–1 integer linear programming problem, we define a cost function and outline a branch-and-bound algorithm to minimize it. Finally, we demonstrate the usefulness of our approach by presenting a set of experimental results based on the TPC-D benchmark.

This research was partially supported by MURST - Interdata Project.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balas, E., Toth, P.: Branch and bound methods. In: Lawler, E. et al. (eds.): The traveling salesman problem. John Wiley & Sons (1985) 361–397

    Google Scholar 

  2. Agrawal, R., Gupta, A., Sarawagi, S.: Modeling multidimensional databases. IBM Research Report (1995)

    Google Scholar 

  3. Baralis, E., Paraboschi, S., Teniente, E.: Materialized view selection in multidimensional database. Proc. 23rd Int. Conf. on Very Large Data Bases, Athens, Greece (1997) 156–165

    Google Scholar 

  4. Beasley, J.E.: An Algorithm for Set Covering Problems. European Journal of Operational Research 31 (1987) 85–93

    Article  MATH  MathSciNet  Google Scholar 

  5. Cardenas, A.F.: Analysis and performance of inverted database structures. Comm. ACM 18(5) (1975) 253–263

    Article  MATH  MathSciNet  Google Scholar 

  6. Chu, W.W., Ieong, I.T.: A transaction-based approach to vertical partitioning for relational database system. IEEE Trans. on Software Eng. 19(8) (1993) 804–812

    Article  Google Scholar 

  7. Datta, A., Moon, B., Thomas, H.: A case for parallelism in data warehousing and OLAP. Proc. IEEE First Int. Workshop on Data Warehouse Design and OLAP Technology (1998)

    Google Scholar 

  8. Golfarelli, M., Rizzi, S.: Designing the data warehouse: key steps and crucial issues. Journal of Computer Science and Information Management 2(3) (1999)

    Google Scholar 

  9. Golfarelli, M., Rizzi, S.: View Materialization for Nested GPSJ Queries. To appear on Proc. DMDW’2000, Stockholm (2000)

    Google Scholar 

  10. Gray, J., Bosworth, A., Lyman, A., Pirahesh, H.: Data-Cube: a relational aggregation operator generalizing group-by, cross-tab and sub-totals. Technical Report MSR-TR-95-22, Microsoft Research (1995)

    Google Scholar 

  11. Gyssens, M., Lakshmanan, L.V.S.: A foundation for multi-dimensional databases. Proc. 23rd Very Large Database Conf., Athens, Greece (1997) 106–115

    Google Scholar 

  12. Harinarayan, V., Rajaraman, A., Ullman, J.: Implementing Data Cubes Efficiently. Proc. of ACM Sigmod Conf., Montreal, Canada (1996)

    Google Scholar 

  13. Kimball, R.: The data warehouse toolkit. John Wiley & Sons (1996)

    Google Scholar 

  14. Lin, X., Orlowska, M., Zhang, Y.: A graph-based cluster approach for vertical partitioning in database design. Data & Knowledge Engineering 11 (1993) 151–169

    Article  MATH  Google Scholar 

  15. Munneke, D., Wahlstrom, K., Mohania, M.: Fragmentation of multidimensional databases. Proc. 10th Australasian Database Conf., Auckland (1999) 153–164

    Google Scholar 

  16. Özsu, M.T., Valduriez, P.: Principles of distributed database systems. Prentice-Hall Int. Editors (1991)

    Google Scholar 

  17. Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization. Prentice Hall, Englewood Cliffs (1982)

    MATH  Google Scholar 

  18. Raab, F. (ed.): TPC Benchmark(tm) D (Decision Support), Proposed Revision 1.0. Transaction Processing Performance Council, San Jose, CA 95112 (1995)

    Google Scholar 

  19. Yang, J., Karlaplem, K., Li, Q.: Algorithms for Materialized View Design in Data Warehousing Environments. Proc. 23rd Int. Conf. on Very Large Databases, Athens, Greece (1997) 136–145

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golfarelli, M., Maio, D., Rizzi, S. (2000). Applying Vertical Fragmentation Techniques in Logical Design of Multidimensional Databases. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2000. Lecture Notes in Computer Science, vol 1874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44466-1_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-44466-1_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67980-6

  • Online ISBN: 978-3-540-44466-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics