Concurrency in Extendible Hashing
暂无分享,去创建一个
[1] Derick Wood,et al. A New Method for Concurrency in B-Trees , 1982, IEEE Transactions on Software Engineering.
[2] S. B. Yao,et al. Efficient locking for concurrent operations on B-trees , 1981, TODS.
[3] Richard E. Ladner,et al. Concurrency control in a dynamic search structure , 1984 .
[4] H. T. Kung,et al. Concurrent manipulation of binary search trees , 1980, TODS.
[5] Carla Schlatter Ellis,et al. Distributed data structures: A case study , 1985, IEEE Transactions on Computers.
[6] Dennis Shasha,et al. Concurrent search structure algorithms , 1988, TODS.
[7] Ronald Fagin,et al. Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..
[8] Carla Schlatter Ellis,et al. Concurrent Search and Insertion in AVL Trees , 1980, IEEE Transactions on Computers.
[9] D. Walton,et al. The numerical solution of the matrix equationXA+AY=F , 1977 .
[10] Chak-Kuen Wong,et al. Quintary trees: a file structure for multidimensional datbase sytems , 1980, TODS.
[11] Yehoshua Sagiv,et al. Concurrent operations on B-trees with overtaking , 1985, J. Comput. Syst. Sci..
[12] Witold Litwin,et al. Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.
[13] Carla Schlatter Ellis,et al. Extendible hashing for concurrent operations and distributed data , 1983, PODS '83.
[14] David B. Lomet,et al. Bounded index exponential hashing , 1983, TODS.
[15] Carla Schlatter Ellis,et al. Concurrency in linear hashing , 1987, TODS.