This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Partitioned Synchronization Rule for Planar Extendible Partial Orders
October 1995 (vol. 7 no. 5)
pp. 797-808

Abstract—The partitioned synchronization rule is a technique for proving the correctness of concurrency control algorithms. Prior work has shown the applicability of the partitioned synchronization rule to hierarchically decomposed databases whose structure is restricted to semitrees. The principal contribution of this paper is a demonstration that the partitioned synchronization rule also applies to more general structures than semitrees, specifically, to any planar extendible partial order, a partial order which when extended with a least and a greatest element still remains planar. To demonstrate utility, the paper presents two applications of the partitioned synchronization rule. The first application shows correctness of a component-based timestamp generation algorithm suitable for implementing a timestamp ordering concurrency control algorithm. The second application shows correctness of a snapshot algorithm for concurrency control in a replicated multilevel secure database; we choose this application to highlight that hierarchically decomposed databases and multilevel secure databases are structurally similar. In both cases, the correctness proofs via the partitioned synchronization rule are substantially simpler than corresponding direct proofs.

[1] P. Ammann,F. Jaeckle,, and S. Jajodia,“A two snapshot algorithm for concurrency control in secure multilevel databases,” Proc. Symp. Research in Security and Privacy, pp. 204-215,Oakland, Calif., May 1992.
[2] P. Ammann and S. Jajodia,“Distributed timestamp generation in planar lattice networks,” ACM Trans. Computer Systems, vol. 11, no. 3, pp. 205-225, Aug. 1993.
[3] D.E. Bell and L.J. LaPadula,“Secure computer systems: Unified exposition and multics interpretation,” Technical Report MTR-2997, The Mitre Corp., Bedford, Mass., Mar. 1976.
[4] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[5] Committee on Multilecel Data Management Security, Air Force Studies Board, National Research Council, Washington, D.C., Multilevel Data Management Security, 1983.
[6] D.E.R. Denning, Cryptography and Data Security. Addison-Wesley, 1983.
[7] K.P. Eswaran, J.N. Gray, R.A. Lorie, and I.L. Traiger, "The Notions of Consistency and Predicate Locks in a Relational Database System," Comm. ACM, vol. 8, no. 11, pp. 624-633, 1976.
[8] M. Hsu and A. Chan, "Partitioned Two-Phase Locking," ACM Trans. Database Systems, vol. 11, no. 4, pp. 431-446, Dec. 1986.
[9] F. Jaeckle,“A two snapshot algorithm for concurrency control in secure multilevel databases,” Master’s thesis, George Mason Univ., 1992.
[10] I. Rival,“Graph representations: The diagram,” Graphs and Order: The Role of Graphs in the Theory of Ordered Sets, I. Rival, ed., pp. 103-133.Dordrecht, Holland: D. Reidel Publishing, 1985.

Index Terms:
Concurrency control, database management, hierarchically decomposed databases, multilevel secure databases, transaction processing.
Citation:
Paul Ammann, Vijayalakshmi Atluri, Sushil Jajodia, "The Partitioned Synchronization Rule for Planar Extendible Partial Orders," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 5, pp. 797-808, Oct. 1995, doi:10.1109/69.469819
Usage of this product signifies your acceptance of the Terms of Use.