A scalable hash ripple join algorithm
Gang Luo, Curt J. Ellmann, et al.
SIGMOD 2002
Traditional workload management methods mainly focus on the current system status while information about the interaction between queued and running transactions is largely ignored. This paper proposes using transaction reordering, a workload management method that considers both the current system status and information about the interaction between queued and running transactions, to improve the transaction throughput in an RDBMS. Our main idea is to reorder the transaction sequence submitted to the RDBMS to minimize resource contention and to maximize resource sharing. The advantages of the transaction reordering method are demonstrated through experiments with three commercial RDBMSs. © 2009 Elsevier B.V. All rights reserved.
Gang Luo, Curt J. Ellmann, et al.
SIGMOD 2002
Kun-Lung Wu, Philip S. Yu, et al.
VLDB 2007
Gang Luo, Jeffrey F. Naughton, et al.
ICDE 2005
Jennifer L. Beckmann, Alan Halverson, et al.
ICDE 2006