The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Integrating vertical and horizontal partitioning into automated physical database design
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. 1.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Automated Selection of Materialized Views and Indexes in SQL Databases
Agrawal, S., Chaudhuri, S., & Narasayya, V. R. (2000) · Cited by 546
Self-citationAn Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
Chaudhuri, S., & Narasayya, V. R. (1997) · Cited by 355
Self-citationAutoAdmin “what-if” index analysis utility
Chaudhuri, S., & Narasayya, V. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276337 · Cited by 255
Self-citationDatabase partitioning in a cluster of processors
Saccà, D., & Wiederhold, G. C. M. (1985) · ACM Transactions on Database Systems · doi:10.1145/3148.3161 · Cited by 136
Sevcik, K. C., & Zilio, D. C. (1998) · TSpace (University of Toronto) · Cited by 44
Cited by
Automatic Database Management System Tuning Through Large-scale Machine Learning
Van Aken, D., Pavlo, A., Gordon, G. J., & Zhang, B. (2017) · Proceedings of the 2017 ACM International Conference on Management of Data · doi:10.1145/3035918.3064029 · Cited by 573
Schism: a workload-driven approach to database replication and partitioning
Curino, C., Jones, E., Zhang, Y., & Madden, S. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920853 · Cited by 539
Split learning for health: Distributed deep learning without sharing raw patient data
Vepakomma, P., Gupta, O., Swedish, T., & Raskar, R. (2018) · arXiv · doi:10.48550/arxiv.1812.00564 · Cited by 513
An End-to-End Automatic Cloud Database Tuning System Using Deep Reinforcement Learning
Zhang, J., Liu, Y., Zhou, K., Li, G., Xiao, Z., Cheng, B., Xing, J., Wang, Y., Cheng, T., Liu, L., et al. (2019) · Proceedings of the 2019 International Conference on Management of Data · doi:10.1145/3299869.3300085 · Cited by 318
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
Pavlo, A., Curino, C., & Zdonik, S. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213844 · Cited by 291
HYRISE: a main memory hybrid storage engine
Grund, M., Krüger, J., Plattner, H., Zeier, A., Cudre-Mauroux, P., & Madden, S. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1921071.1921077 · Cited by 256
Size Bounds for Factorised Representations of Query Results
Olteanu, D., & Závodný, J. (2015) · ACM Transactions on Database Systems · doi:10.1145/2656335 · Cited by 116
Ma, Y., Dey, T., Bogart, C., Amreen, S., Valiev, M., Tutko, A., Kennard, D., Zaretzki, R., & Mockus, A. (2021) · Empirical Software Engineering · doi:10.1007/s10664-020-09905-9 · Cited by 49
Metadata
- Authors
- Agrawal, S., Narasayya, V., & Yang, B.
- Venue
- Proceedings of the 2004 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2004-06-13
- Pages
- 359-370
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W1997375126
- Cited by
- 411
- References
- 6
- FWCI
- 5.55
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.