ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

A Modeling Study of the TPC-C Benchmark.

Scott T. Leutenegger, Daniel M. Dias: A Modeling Study of the TPC-C Benchmark. SIGMOD Conference 1993: 22-31
@inproceedings{DBLP:conf/sigmod/LeuteneggerD93,
  author    = {Scott T. Leutenegger and
               Daniel M. Dias},
  editor    = {Peter Buneman and
               Sushil Jajodia},
  title     = {A Modeling Study of the TPC-C Benchmark},
  booktitle = {Proceedings of the 1993 ACM SIGMOD International Conference on
               Management of Data, Washington, D.C., May 26-28, 1993},
  publisher = {ACM Press},
  year      = {1993},
  pages     = {22-31},
  ee        = {http://doi.acm.org/10.1145/170035.170042, db/conf/sigmod/LeuteneggerD93.html},
  crossref  = {DBLP:conf/sigmod/93},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

The TPC-C benchmark is a new benchmark approved by the TPC council intended for comparing database platforms running a medium complexity transaction processing workload. Some key aspects in which this new benchmark differs from the TPC-A benchmark are in having several transaction types, some of which are more complex than that in TPC-A, and in having data access skew. In this paper we present results from a modelling study of the TPC-C benchmark for both single node and distributed database management systems. We simulate the TPC-C workload to determine expected buffer miss rates assuming an LRU buffer management policy. These miss rates are then used as inputs to a throughput model. From these models we show the following: (i) We quantify the data access skew as specified in the benchmark and show what fraction of the accesses go to what fraction of the data. (ii) We quantify the resulting buffer hit ratios for each relation as a function of buffer size. (iii) We show that close to linear scale-up (about 3% from the ideal) can be achieved in a distributed system, assuming replication of a read-only table. (iv) We examine the effect of packing hot tuples into pages and show that significant price/performance benefit can be thus achieved. (v) Finally, by coupling the buffer simulations with the throughput model, we examine typical disk/memory configurations that maximize the overall price/performance.

Copyright © 1993 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 1, SIGMOD '93-'97" and ...

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Peter Buneman, Sushil Jajodia (Eds.): Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, 1993. ACM Press 1993 BibTeX , SIGMOD Record 22(2), June 1993
Contents

Online Edition: ACM Digital Library

[Index Terms]
[Full Text in PDF Format, 1102 KB]

References

[1]
Philip A. Bernstein, Nathan Goodman: Concurrency Control in Distributed Database Systems. ACM Comput. Surv. 13(2): 185-221(1981) BibTeX
[2]
Philip A. Bernstein, Nathan Goodman: A Sophisticate's Introduction to Distributed Concurrency Control (Invited Paper). VLDB 1982: 62-76 BibTeX
[3]
Bruno Ciciani, Daniel M. Dias, Philip S. Yu: Analysis of Replication in Distributed Database Systems. IEEE Trans. Knowl. Data Eng. 2(2): 247-261(1990) BibTeX
[4]
...
[5]
Daniel M. Dias, Balakrishna R. Iyer, John T. Robinson, Philip S. Yu: Integrated Concurrency-Coherency Controls for Multisystem Data Sharing. IEEE Trans. Software Eng. 15(4): 437-448(1989) BibTeX
[6]
Jim Gray (Ed.): The Benchmark Handbook for Database and Transaction Systems (1st Edition). Morgan Kaufmann 1991
Contents BibTeX
[7]
...
[8]
...
[9]
...
[10]
...
[11]
...

Referenced by

  1. Chye-Lin Chee, Hongjun Lu, Hong Tang, C. V. Ramamoorthy: Adaptive Prefetching and Storage Reorganization In A Log-Structured Storage System. IEEE Trans. Knowl. Data Eng. 10(5): 824-838(1998)
  2. Thin-Fong Tsuei, Allan Packer, Keng-Tai Ko: Database Buffer Size Investigation for OLTP Workloads (Experience Paper). SIGMOD Conference 1997: 112-122
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:40:13 2009