Transaction reordering with application to synchronized scans

  • Authors:
  • Gang Luo;Jeffrey F. Naughton;Curt J. Ellmann;Michael W. Watzke

  • Affiliations:
  • IBM T.J. Watson Research Center, Hawthorne, NY, USA;University of Wisconsin-Madison, Madison, WI, USA;Teradata, Madison, WI, USA;Teradata, Madison, WI, USA

  • Venue:
  • Proceedings of the ACM 11th international workshop on Data warehousing and OLAP
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traditional workload management methods mainly focus on the current system status while information about the interaction between queued and running transactions is largely ignored. An exception to this is the transaction reordering method, which reorders the transaction sequence submitted to the RDBMS and improves the transaction throughput by considering both the current system status and information about the interaction between queued and running transactions. The existing transaction reordering method only considers the reordering opportunities provided by analyzing the lock conflict information among multiple transactions. This significantly limits the applicability of the transaction reordering method. In this paper, we extend the existing transaction reordering method into a general transaction reordering framework that can incorporate various factors as the reordering criteria. We show that by analyzing the resource utilization information of transactions, the transaction reordering method can also improve the system throughput by increasing the resource sharing opportunities among multiple transactions. We provide a concrete example on synchronized scans and demonstrate the advantages of our method through experiments with a commercial parallel RDBMS.