Transaction Chopping: Algorithms and Performance Studies

ACM Transactions on Database Systems (TODS)

Volumn 20, Issue 3, 1995, Pages 325-363

  Shasha, Dennis ^a   Llirbat, Francois ^b   Simon, Eric ^b   Valduriez, Patrick ^b  

^a NEW YORK UNIVERSITY   (United States)

^b INRIA Rocquencourt ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976746133     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/211414.211427     Document Type: Article

References (36)

1. adler d., dageville, b., and wong, k.-f. 1992. A C-based simulation package. Tech. Rep, ECRC-92-27i ECRC, Munich.
2. agrawal D., abbadi, A. E., and jeffers, R. 1992. Using delayed commitment in locking protocols for real-time databases. In ACM SIGMOD International Conference on Management of Data (San Diego, Calif., June 2-5), 104-113. ACM, New York.
3. agrawal, D., bruno, J. L., abbadi, A. E., and krishnasawamy, V. 1994. Relative serializabil-ity: An approach for relaxing the atomicity of transactions. In ACM Principles of Database Systems. V. Vianu, Ed., ACM, New York, 139-149.
4. agrawal, H. 1994. On slicing programs with jump statements. ACM SIGPLAN Not. 29, 6 (June), 302-311.
5. agrawal, R., carey, M., and livny, M. 1987. Concurrency control performance modeling: Alternatives and implications. ACM. Trans. Database Syst. 12, 4 (Dec), 609-654.
6. aho, A. V., sethi, R., and ullman, J. D. 1986. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, Mass.
7. bayer, R. 1986. Consistency of transactions and random batch. ACM Trans. Database Syst. 11, 4 (Dec.), 397-404.,
8. bernstein, P., shipman, D. W., and rothnie, j. b. 1980. Concurrency control in a system for distributed databases (sdd-1). ACM Trans. Database Syst. 5, 1 (Mar.), 18-51. bernstein P A., hadzilacos, V., and goodman, N. 1991 Concurrency Control and Recovery in Database Systems Addison-Wesley, Reading, Mass,
9. CAREY, M. J. 1983. Modeling and evaluation of database concurrency control algorithms Tech Rep. and Ph D. thesis, Dept, of Computer Science, Univ. of California, Berkeley, Sept.
10. Carey, M. J., krishnamurthy, S., and livny, M. 1990. Load control for locking: The “half and half” approach. In The 9th ACM Symposium on the Principles of Database Systems (Nashville, Tenn, May 20-22) ACM, New York, 72-84.
11. casanova, M. 1981. The Concurrency Control Problem for Database Systems. Lecture Notes in Computer Science, vol. 116. Springer-Verlag, New York.
12. dadam, P., pistor, P., and schek, H.-J. 1983 A predicate oriented locking approach for integrated information systems. In IFIP 9th World Computer Congress (Paris, April). North-Holland, Amsterdam, 110-121.
13. farrag, A.A., and ozsu, M.T. 1987. Towards a general concurrency control algorithm for database systems. IEEE Trans. Softw. Eng. SE-13, 10 (Oct.), 1073-1078.
14. FARRAG, A. A., and ozsu, M. T. 1989 Using semantic knowledge of transactions to increase concurrency ACM Trans. Database Syst 14, 4 (Dec.), 503-525
15. garcia-molina, H. 1983. Using semantic knowledge for transaction processing in a distributed database. ACM Trans. Database Syst 8, 2 (June), 186-213
16. gray, J, ed 1991. The Benchmark Handbook Morgan-Kaufmann, San Mateo, Calif.
17. gray, J., and REUTER, A 1992. Transaction Processing: Concepts and Techniques Morgan-Kaufmann, San Mateo, Calif.
18. haritsa, j., carey, M. j., and livny, M. 1990. On being optimistic about real-time constraints. In The 9th ACM Symposium on Principles of Database Systems (Nashville, Tenn., May 20-22)., ACM, New York, 331-343
19. helland, P, sammer, H., lyon, J., carr, R., garret, P., and reuter, A. 1987. Group commit timers and high volume transaction systems. In Second International Workshop on High Performance Transaction Systems. Lecture Notes in Computer Science, Vol. 359, Springer Verlag, New York, 301-328.
20. HSEUH, W. AND pu, C. 1993. Chopping up epsilon transactions. Tech Rep. CUCS-037-093, Dept. Computer Science, Columbia Univ., New York
21. Hsu, M. Chan, and, A. 1986. Partitioned two-phase locking. ACM Trans. Database Syst 11. 4 (Dec.), 431-446.
22. lausen G., soisalon-soininen, E., and widmayer, P 1986 Pre-analysis locking. Inf Control 70, 2-3 (Aug.), 193-215
23. llirbat, F. 1994. Analysis of chopping algorithm's performance Intern Rep., Rodin Project, INRIA Rocquencourt, France.
24. lynch, N. 1983 Multi-level atomicity—A new correctness criterion for database concurrency control. ACM Trans Database Systems 8, 4 (Dec.), 484-502
25. o'neil, P. 1986. The escrow transactional mechanism. ACM Trans. Database Syst. 11, 4 (Dec), 405-430.
26. ramamritham. K. and chrysanthis, P.K. 1995. Advances in Concurrency Control and Transaction Processing IEEE Press, to appear.
27. ryu, I. K., and thomasian, A. 1990. Analysis of performance with dynamic locking. J. ACM 37, 3 (Sept.), 491-523.
28. salzberg, B., and tombroff, D. 1994. A programming tool to support long-running activities. Tech. Rep. NU-CCS-94-10, Dept. Computer Science, Northeastern Univ., Boston, Mass.
29. shasha, D. 1988. Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang Syst. 10, 2 (Apr), 282-312.
30. shasha, D. 1992. Database Tuning: A Principled Approach. Prentice-Hall, Englewood Cliffs, N.J.
31. tay, Y. 1987 Locking Performance in Centralized Databases. Academic Press, New York.
32. thomasian, A. 1991. Performance limits of two-phase locking. In 7th IEEE International Conference Data Engineering (Kobe, Japan). IEEE, New York, 426-435.
33. thomasian A. Ryu, and, K 1991. Performance analysis of two-phase locking. IEEE Trans. Softw Eng 17, 5 (May), 386-402. weiser M. 1984. Program slicing. IEEE Trans. Softw. Eng. SE 10, 4 (July), 352-357.
34. wolson, O. 1987. The virtues of locking by symbolic names. J. Algorithms 8 (March) 536-556.
35. wong K. C., and edelberg M. 1977. Interval hierarchies and their application to predicate files. ACM Trans. Database Syst. 2, 3 (Sept.), 223-232.
36. yannakakis M. 1982. A theory of safe locking policies in database systems. J. ACM 29, 3, (July), 718-740.