|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| M.H. Eich, "Graph Directed Locking," IEEE Transactions on Software Engineering, vol. 14, no. 2, pp. 133-140, February, 1988. | |||
| BibTex | x | ||
| @article{ 10.1109/32.4633, author = {M.H. Eich}, title = {Graph Directed Locking}, journal ={IEEE Transactions on Software Engineering}, volume = {14}, number = {2}, issn = {0098-5589}, year = {1988}, pages = {133-140}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.4633}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - Graph Directed Locking IS - 2 SN - 0098-5589 SP133 EP140 EPD - 133-140 A1 - M.H. Eich, PY - 1988 KW - distributed databases; database concurrency control; deadlock-free; lock conversion; database flow graph locking; directed acyclic graph; non-two-phase methods; database theory; directed graphs; distributed databases; system recovery VL - 14 JA - IEEE Transactions on Software Engineering ER - | |||
A non-two-phase database concurrency control technique is introduced. The technique is deadlock-free, places no restrictions on the structure of the data, never requires data to be reread, never forces a transaction to be rolled back in order to achieve serializability, applies a type of lock conversion, and allows items to be released to subsequent transactions as soon as possible. The method introduced, database flow graph locking (FGL), uses a directed acyclic graph to direct the migration of locks between transactions. Unlike many previous non-two-phase methods, the database need not be structured in any specific fashion. The effect of these changes is that, with the same serializable schedule, FGL obtains a higher degree of concurrency than two-phase locking (2PL). Overhead requirements for database flow graph locking are comparable to those for two-phase locking, with 2PL being better in low conflict situations and FGL better in high conflict.
[1] G. N. Buckley and A. Silberschatz, "A concurrency control scheme with predeclared read and write sets," inProc. Eighteenth Annu. Hawaii Int. Conf. System Sciences, vol. II, Jan. 1985, pp. 154-161.
[2] G. N. Buckley and A. Silberschatz, "Beyond two phase locking,"J. ACM, vol. 31, pp. 314-326, Apr. 1985.
[3] P. Dasgupta and Z. Kedem, "A non-two phase locking protocol for concurrency control in general databases," inProc. VLDB, Oct. 1983.
[4] C.J. Date,An Introduction to Database Systems, Vol. II, Addison-Wesley Publishing Co., Reading, Mass., 1983.
[5] M. H. Eich, "Concurrency in a data flow database machine," Ph.D. dissertation, Dep. Comput. Sci. Eng., Southern Methodist Univ., Aug. 1984.
[6] M. H. Eich and D. L. Wells, "Database flow graphs," inProc. 1984 Int. Conf. Parallel Processing, Aug. 21-24, 1984, pp. 266-268.
[7] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
[8] Z. Kedem and A. Silberschatz, "Controlling concurrency using locking protocols," inSymp. Foundations of Computer Science, Oct. 29- 31, 1979, pp. 274-285.
[9] Z. Kedem and A. Silberschatz, "Non-two-phase locking protocols with shared and exclusive locks," inProc. Very Large Data Bases Conf., 1980, pp. 309-317.
[10] H. F. Korth, "Locking primitives in database systems,"J. ACM, vol. 30, pp. 55-79, Jan. 1983.
[11] M. D. Mickunas, P. Jalote, and R. H. Campbell, "A new protocol for concurrency control using both preventive and corrective techniques," Dep. Comput. Sci., Univ. Illinois, Tech. Rep. UIUCDCS-R-1163, Mar. 1984.
[12] C. Mohan, D. Fussell, Z. M. Kedem, and A. Silberschatz, "Lock conversion in non-two-phase locking protocols,"IEEE Trans. Software Eng., vol. SE-11, no. 1, pp. 15-22, Jan. 1985.
[13] C.H. Papadimitriou, "The serializability of concurrent database updates,"J. ACM, vol. 26, pp. 631-653, Oct. 1979.
[14] A. Silberschatz and Z. Kedem, "Consistency in hierarchical database systems,"J. Ass. Comput. Mach., vol. 27, Jan. 1980.
[15] A. Silberschatz and Z. Kedem, "A family of locking protocols for database systems that are modeled by directed graphs,"IEEE Trans. Software Eng., vol. SE- 8, no. 6, pp. 558-562, Nov. 1982.
[16] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[17] M. Yannakakis, C. H. Papadimitriou, and H. T. Kung, "Locking policies: Safety and freedom from deadlock," inSymp. Foundations of Computer Science, Oct. 29-31, 1979, pp. 286-297.
[18] M. Yannakakis, "A theory of safe locking policies in database systems,"J. ACM, vol. 29, no. 3, pp. 718-740, July 1982.