This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Design of Multiple Hash Tables for Concurrency Control
May-June 1997 (vol. 9 no. 3)
pp. 384-390

Abstract—In this paper, we propose the approach of using multiple hash tables for lock requests with different data access patterns to minimize the number of false contentions in a data sharing environment. We first derive some theoretical results on using multiple hash tables. Then, in light of these derivations, a two-step procedure to design multiple hash tables is developed. In the first step, data items are partitioned into a given number of groups. Each group of data items is associated with the use of a hash table in such a way that lock requests to data items in the same group will be hashed into the same hash table. In the second step, given an aggregate hash table size, the hash table size for each individual data group is optimally determined so as to minimize the number of false contentions. Some design examples and remarks on the proposed method are given. It is observed from real database systems that different data sets usually have their distinct data access patterns, thus resulting in an environment where this approach can offer significant performance improvement.

[1] M.-S. Chen, P.S. Yu, and T.-H. Yang, “On Coupling Multiple Systems with A Global Buffer,” IEEE Trans. Knowledge and Data Eng., vol. 8, no. 2, pp. 339-344, Apr. 1996.
[2] IBM Corporation, "Sysplex Overview: Introducing Data Sharing and Parallelism in a Sysplex," Technical Report GC28-1208-00, Apr. 1994.
[3] M.J. Franklin, M.J. Carey, and M. Livny, "Global memory management in client-server DBMS architectures," Proc. 18th VLDB Conf.,Vancouver, Canada, pp. 596-609, 1992.
[4] L. Kleinrock, Queueing Systems. Wiley, 1975.
[5] E. Rahm, "Empirical Performance Evaluation of Concurrency and Coherency Control Protocols for Database Sharing Systems," ACM Trans. Database Systems, vol. 18, no. 2, pp. 333-377, June 1993.
[6] R.R. Daniel and M. Stonebraker,"Locking granularity revised," ACM Trans. Database Systems, vol. 4, no. 2, pp. 210-227, June 1979.
[7] Y. Wang and L. Rowe, "Cache Consistency and Concurrency Control in a Client/Server DBMS Architecture," Proc. 1991 ACM SIGMOD Int'l Conf.,Denver, Colo., May 1991.
[8] P.S. Yu, D.M. Dias, and S.S. Lavenberg, "On the Analytical Modeling of Database Concurrency Control," J. ACM, vol. 40, no. 4, pp. 831-872, Sept. 1993.
[9] P.S. Yu, D.M. Dias, J.T. Robinson, B.R. Iyer, and D.W. Cornell, "On Coupling Multi-Systems through Data Sharing," Proc. IEEE, vol. 75, no. 5, pp. 573-587, May 1987.

Index Terms:
Concurrency control, hash algorithms, lock contentions, multiple hash tables.
Citation:
Ming-Syan Chen, Philip S. Yu, "Optimal Design of Multiple Hash Tables for Concurrency Control," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 3, pp. 384-390, May-June 1997, doi:10.1109/69.599928
Usage of this product signifies your acceptance of the Terms of Use.