skip to main content
10.1145/1007568.1007609acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article

Integrating vertical and horizontal partitioning into automated physical database design

Published:13 June 2004Publication History

ABSTRACT

In addition to indexes and materialized views, horizontal and vertical partitioning are important aspects of physical design in a relational database system that significantly impact performance. Horizontal partitioning also provides manageability; database administrators often require indexes and their underlying tables partitioned identically so as to make common operations such as backup/restore easier. While partitioning is important, incorporating partitioning makes the problem of automating physical design much harder since: (a) The choices of partitioning can strongly interact with choices of indexes and materialized views. (b) A large new space of physical design alternatives must be considered. (c) Manageability requirements impose a new constraint on the problem. In this paper, we present novel techniques for designing a scalable solution to this integrated physical design problem that takes both performance and manageability into account. We have implemented our techniques and evaluated it on Microsoft SQL Server. Our experiments highlight: (a) the importance of taking an integrated approach to automated physical design and (b) the scalability of our techniques.

References

  1. Agrawal, R., Ramakrishnan, S. Fast Algorithms for Mining Association Rules in Large Databases. Proc. of VLDB 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Agrawal, S., Chaudhuri, S., and Narasayya. V. Automated Selection of Materialized Views and Indexes for SQL Databases. Proceedings of VLDB 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Ailamaki A., Dewitt D. J., Hill M. D., and Skounakis M. Weaving Relations for Cache Performance. VLDB 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Chaudhuri, S., Narasayya, V. An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server. VLDB 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Chaudhuri, S., and Narasayya, V. AutoAdmin "What-If" Index Analysis Utility. Proc. of ACM SIGMOD 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Chaudhuri, S., and Narasayya, V. Index Merging. Proceedings of ICDE 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cornell D. W., Yu P. S. An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases. IEEE Transactions on Software Engg, Vol 16, No 2, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. De P., Park J. S., and Pirkul H. An Integrated Model of Record Segmentation and Access Path Selection for Databases. Information Systems, Vol 13 No. 1, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Gupta H., Harinarayan V., Rajaramana A., and Ullman J. D. Index Selection for OLAP. Proc. ICDE 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Navathe S., Ra M. Vertical Partitioning for Database Design: A Graphical Algorithm. Proc. of SIGMOD 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. http://otn.oracle.com/products/oracle9i/index.html.Google ScholarGoogle Scholar
  12. http://research.microsoft.com/~gray/dbgen/.Google ScholarGoogle Scholar
  13. http://www.olapcouncil.org/research/bmarkco.htm.Google ScholarGoogle Scholar
  14. Papadomanolakis, E., and Ailamaki A. AutoPart: Automating Schema Design for Large Scientific Databases Using Data Partitioning. CMU Technical Report. CMU-CS-03-159, July 2003.Google ScholarGoogle Scholar
  15. Program for TPC-D data generation with Skew. ftp://ftp.research.microsoft.com/users/viveknar/TPCDSkew/.Google ScholarGoogle Scholar
  16. Ramamurthy R., Dewitt D. J., and Su Q. A Case for Fractured Mirrors. Proceedings of VLDB 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Rao, J., Zhang, C., Lohman, G., and Megiddo, N. Automating Physical Database Design in a Parallel Database. Proceedings of the ACM SIGMOD 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Sacca D., and Wiederhold G. Database Partitioning in a Cluster of Processors. ACM TODS, Vol 10, No 1, Mar 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Stohr T., Martens H., and Rahm E., Multi-Dimensional Aware Database Allocation for Parallel Data Warehouses. Proceedings of VLDB 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. TPC Benchmark H. Decision Support. http://www.tpc.orgGoogle ScholarGoogle Scholar
  21. Valentin, G., Zuliani, M., Zilio, D., and Lohman, G. DB2 Advisor: An Optimizer That is Smart Enough to Recommend Its Own Indexes. Proceedings of ICDE 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Zeller, B., and Kemper, A. Experience Report. Exploiting Advanced Database Optimization Features for Large-Scale SAP R/3 Installations. Proceedings of VLDB 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Zilio, D. Physical Database Design Decision Algorithms and Concurrent Reoganization for Parallel Database Systems. PhD Thesis, Dept. of Comp. Sc., Univ. of Toronto, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Zilio, D., Jhingran, A., Padmanabhan, S. Partitioning Key Selection for Shared-Nothing Parallel Database System. IBM Research Report RC 19820. 1994.Google ScholarGoogle Scholar
  1. Integrating vertical and horizontal partitioning into automated physical database design

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data
        June 2004
        988 pages
        ISBN:1581138598
        DOI:10.1145/1007568

        Copyright © 2004 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 13 June 2004

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate785of4,003submissions,20%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader