The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
Abstract
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applications that scale without sacrificing ACID guarantees [7, 9]. The performance of these DBMSs is predicated on the existence of an optimal database design that is tailored for the unique characteristics of OLTP workloads. Deriving such designs for modern DBMSs is difficult, especially for enterprise-class OLTP systems, since they impose extra challenges: the use of stored procedures, the need for load balancing in the presence of time-varying skew, complex schemas, and deployments with larger number of partitions.
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
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Scalable SQL and NoSQL data stores
Cattell, R. (2011) · ACM SIGMOD Record · doi:10.1145/1978915.1978919 · Cited by 1,358
The end of an architectural era: (it's time for a complete rewrite)
Stonebraker, M. R., Madden, S. R., Abadi, D. J., Harizopoulos, S., Hachem, N. I., & Helland, P. (2007) · Cited by 558
Automated Selection of Materialized Views and Indexes in SQL Databases
Agrawal, S., Chaudhuri, S., & Narasayya, V. R. (2000) · Cited by 546
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
Self-citationH-store: a high-performance, distributed main memory transaction processing system
Kallman, R., Kimura, H., Natkins, J., Pavlo, A., Rasin, A., Zdonik, S., Jones, E. P. C., Madden, S., Stonebraker, M., Zhang, Y., et al. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454211 · Cited by 520
Self-citationIntegrating vertical and horizontal partitioning into automated physical database design
Agrawal, S., Narasayya, V., & Yang, B. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007609 · Cited by 411
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
Chaudhuri, S., & Narasayya, V. R. (1997) · Cited by 355
OLTP through the looking glass, and what we found there
Harizopoulos, S., Abadi, D. J., Madden, S. R., & Stonebraker, M. R. (2008) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1376616.1376713 · Cited by 316
Tuning database configuration parameters with iTuned
Duan, S., Thummala, V., & Babu, S. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687767 · Cited by 267
AutoAdmin “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
Physical database design for relational databases
Finkelstein, S., Schkolnick, M., & Tiberio, P. (1988) · ACM Transactions on Database Systems · doi:10.1145/42201.42205 · Cited by 225
Low overhead concurrency control for partitioned main memory databases
Jones, E. P. C., Abadi, D. J., & Madden, S. R. (2010) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/1807167.1807233 · Cited by 146
Fast updates on read-optimized databases using multi-core CPUs
Krueger, J., Kim, C., Grund, M., Satish, N., Schwalb, D., Chhugani, J., Plattner, H., Dubey, P. K., & Zeier, A. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/2047485.2047491 · Cited by 133
Distribution Design of Logical Database Schemas
Ceri, S., Navathe, S. B., & Wiederhold, G. C. M. (1983) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1983.234957 · Cited by 119
10 rules for scalable performance in 'simple operation' datastores
Stonebraker, M. R., & Cattell, R. G. G. (2011) · Communications of the ACM · doi:10.1145/1953122.1953144 · Cited by 114
Sevcik, K. C., & Zilio, D. C. (1998) · TSpace (University of Toronto) · Cited by 44
Transaction routing for distributed OLTP systems: Survey and recent results
Nikolaou, C. N., Marazakis, M., & Georgiannakis, G. Y. (1997) · Information Sciences · doi:10.1016/s0020-0255(96)00173-9 · Cited by 17
Cited by
In-Memory Big Data Management and Processing: A Survey
Zhang, H., Chen, G., Ooi, B. C., Tan, K.-L., & Zhang, M. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2427795 · Cited by 414
MICA: A Holistic Approach to Fast In-Memory Key-Value Storage
Lim, H., Han, D., Andersen, D. G., & Kaminsky, M. (2018) · Figshare · doi:10.1184/r1/6607280 · Cited by 361
Mozaffari, M., Dignös, A., Gamper, J., & Störl, U. (2024) · ACM Computing Surveys · doi:10.1145/3665323 · Cited by 17
Metadata
- Authors
- Pavlo, A., Curino, C., & Zdonik, S.
- Venue
- Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
- Publisher
- ACM
- Published
- 2012-05-20
- Pages
- 61-72
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2150630976
- Cited by
- 291
- References
- 18
- FWCI
- 27.74
- 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.