article

Free access

Transaction chopping: algorithms and performance studies

Authors:

Francois Llirbat,

Patrick ValduriezAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 20, Issue 3

Pages 325 - 363

https://doi.org/10.1145/211414.211427

Published: 01 September 1995 Publication History

Abstract

Chopping transactions into pieces is good for performance but may lead to nonserializable executions. Many researchers have reacted to this fact by either inventing new concurrency-control mechanisms, weakening serializability, or both. We adopt a different approach. We assume a user who

—has access only to user-level tools such as (1) choosing isolation degrees 1ndash;4, (2) the ability to execute a portion of a transaction using multiversion read consistency, and (3) the ability to reorder the instructions in transaction programs; and

—knows the set of transactions that may run during a certain interval (users are likely to have such knowledge for on-line or real-time transactional applications).

Given this information, our algorithm finds the finest chopping of a set of transactions TranSet with the following property: If the pieces of the chopping execute serializably, then TranSet executes serializably. This permits users to obtain more concurrency while preserving correctness. Besides obtaining more intertransaction concurrency, chopping transactions in this way can enhance intratransaction parallelism.

The algorithm is inexpensive, running in O(n×(e+m)) time, once conflicts are identified, using a naive implementation, where n is the number of concurrent transactions in the interval, e is the number of edges in the conflict graph among the transactions, and m is the maximum number of accesses of any transaction. This makes it feasible to add as a tuning knob to real systems.

References

[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., ADBADI, 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.

Digital Library

[3]

AORAWAL, D., BRUNO, J. L., ABBAD~, A. E., A~D KmSHNASAWAMY, V. 1994. Relative serializability: An approach for relaxing the atomicity of transactions. In ACM Principles of Database Systems. V. Vianu, Ed., ACM, New York, 139-149.

Digital Library

[4]

AGRAWAL, H. 1994. On slicing programs with jump statements. ACM SIGPLAN Not. 29, 6 (June), 302-311.

Digital Library

[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.

Digital Library

[6]

AHO, A. V., SETm, R., AND ULLMAN, J.D. 1986. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, Mass.

Digital Library

[7]

BAYER, R. 1986. Consistency of transactions and random batch. ACM Trans. Database Syst. 11, 4 (Dec.), 397-404.

Digital Library

[8]

BERNSTEIN, P., SHIPMAN, n. W., AND ROTHNIE, J.B. 1980. Concurrency control in a system for distributed databases (sdd-1). ACM Trans. Database Syst. 5, i (Mar.), 18-51.

Digital Library

[9]

BERNSTEIN, P A., HADZILACOS, V., AND GOODMAN, N. 1991 Concurrency Control and Recover~y zn Database Systems Addison-Wesley, Reading-, Mass.

Digital Library

[10]

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.

Digital Library

[11]

CAREY, M. J., KRISHN,MViURTHY, S., AND L{VNY, M. 1990. Load control for lockmg: The "half and half" approach. In The 9th ACM Syraposnlm on the Principles of Database Systems (Nashville, Tenn, May 20-22) ACM, New York, 72 84.

Digital Library

[12]

CASANOVA, M. 1981. The CoT~currency Control Problem for Database Systems. Lecture Notes in Computer Science, vol. 116. Springer-Verlag, iX~ew York.

Digital Library

[13]

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.

[14]

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.

Digital Library

[15]

FARRAG, A. A., AND OZSU, M.T. 1989 Using semantm knowledge of transactions to increase concurrency ACM Trans. Database Syst 14, 4 (Dec.), 503-525

Digital Library

[16]

GARCIA-MOLiNA, H. 1983. Using semantic knowledge for transaction processing in a distributed database. ACM Trans'. Database Sy,~t 8, 2 (June), 186-213

Digital Library

[17]

GRAY, J, ED 1991. The Benchmark Handbook Morgan-Kaufmann, San Mateo, Calif.

[18]

GRAY, J., AND REUTER, A 1992. Transaction Processzng: Concepts and Techmques Morgan- Kaufmann, San Marco, Calif.

Digital Library

[19]

HARITSA, J., C^~rY, M. J., AND LIVNY, M. 1990. On being optimistm about real-time constramts. In The 9th ACM Sympostum on Prznciples of Database Systems (Nashville, Tenn., May 20-22). ACM, New York, 331 343

Digital Library

[20]

HELLANI), P, SAMMER, H., LYON, J., CARR, R., GARRET, P., AND REUTER, A. 1987. Group commit timers and high volume transactmn systems. In Second International Workshop on High Performance TransactLon Systems. Lecture Notes in Computer Science, Vol. 359, Springer Verlag, New York, 301-328.

Digital Library

[21]

I~SEUH, W. AND PU, C. 1993. Chopping up epsilon transactions. Tech Rep. CUCS-037-093, Dept. Computer Science, Columbia Univ., New York

[22]

HSU, M., AND CHAN, A. 1986. Partitioned two-phase locking. ACM Trans. Database Syst 11, 4 (Dec.), 431-446.

Digital Library

[23]

LAUSEN, G., SOISALON-SOININEN, E., AND WIDMAYER, P 1986 Pre-analysis locking. Inf Control 70, 2-3 (Aug.), 193-215

Digital Library

[24]

LLIRBAT, F. 1994. Analysis of chopping algorithm's performance Intern Rep., Rodin Project, INRIA Rocquencourt, France.

[25]

LYNCH, N. 1983 Multi-level atomicity--A new correctness criterion for database concurrency control. ACM Trans Database Systems 8, 4 (Dec.), 484 502

Digital Library

[26]

O'N~m, P. 1986. The escrow transactional mechamsm. ACM Trans. Database Syst. 11, 4 (Dec), 405-430.

Digital Library

[27]

RAMAMRITHAM, K. AND CHRYSANTHIS, P K. 1995. Advances in Concurrency Control and Transaction Processzng IEEE Press, to appear.

Digital Library

[28]

RYU, I. K., AND THOMASIAN, A. 1990. Analysis of performance with dynamic locking. J. ACM 37, 3 (Sept.), 491-523.

Digital Library

[29]

SALZBERG, B., ANU TOMBROFF, D. 1994. A programming tool to support long-running activities. Tech. Rep. NU-CCS-94-10, Dept. Computer Science. Northeastern llniv., Boston, Mass.

[30]

SHASHA, D. 1988. Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang Syst. 10, 2 (Apr), 282-312.

Digital Library

[31]

SHASHA, D. 1992. Database Tunzng: A Principled Approach. Prentice-Hall, Englewood Cliffs, N.J.

Digital Library

[32]

TAY, Y. 1987 Locking Performance zn Centrahzed Databases. Academic Press, New York.

Digital Library

[33]

TnOMASLaN, A. 1991. Performance limits of two-phase locking. In 7th IEEE International Conference Data Engzneerzng (Kobe, Japan). IEEE, New York, 426 435.

Digital Library

[34]

THOMASIAN A., AND RYU, K 1991. Performance analysis of two-phase locking. IEEE Trans. Softw Eng 17, 5 (May), 386 402.

Digital Library

[35]

WEISER, M. 1984. Program slicing. IEEE Trans. Softw. Eng. SE 10, 4 (July), 352-357.

[36]

WOLSON, O. 1987. The virtues of locking by symbohc names. J. Algorithms 8 (March) 536-556.

Digital Library

[37]

WONG, K. C., AND EDELBERG, M. 1977. Interval hierarchies and their application to predicate files. ACM Trans. Database Syst. 2, 3 (Sept.), 223-232.

Digital Library

[38]

Y~NAKAK~S, M. 1982. A theory of safe locking policies in database systems. J. ACM 29, 3, (July), 718-740.

Digital Library

Cited By

Mao YZhao JZhang SLiu HMarkl V(2023)MorphStream: Adaptive Scheduling for Scalable Transactional Stream Processing on MulticoresProceedings of the ACM on Management of Data10.1145/35889131:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588913
Faria NPereira J(2023)MRVs: Enforcing Numeric Invariants in Parallel Updates to Hotspots with Randomized SplittingProceedings of the ACM on Management of Data10.1145/35887231:1(1-27)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588723
Zhu BHua YLong ZLiu X(2023)CATS: A Computation-Aware Transaction Processing System with Proactive Unlocking2023 IEEE/ACM 31st International Symposium on Quality of Service (IWQoS)10.1109/IWQoS57198.2023.10188780(1-10)Online publication date: 19-Jun-2023
https://doi.org/10.1109/IWQoS57198.2023.10188780
Show More Cited By

Recommendations

Locking Timestamps versus Locking Objects
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

We present multiversion timestamp locking (MVTL), a new genre of multiversion concurrency control algorithms for serializable transactions. The key idea behind MVTL is simple: lock individual timestamps instead of locking objects. After presenting a ...
Altruistic locking

Long-lived transactions (LLTs) hold on to database resources for relatively long periods of time, significantly delaying the completion of shorter and more common transactions. To alleviate this problem we propose an extension to two-phase locking, ...
Stable Transaction Management for Preserving the Global Integrity Constraints in Multidatabase Systems
COOPIS '98: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems

The multidatabase systems(MDBSs) are an integration of local database systems into a global distributed database system. The objectives of global transaction management are to avoid the inconsistent retrievals and to guarantee the global serializability ...

Reviews

Reviewer: Özgür Ulusoy

An algorithm is proposed to find the finest chopping of a set of transactions to improve performance without sacrificing serializability. The algorithm assumes that the user knows the set of transactions that may run during a certain time interval. It is also assumed that the user may choose to release read locks early or to execute a portion of a transaction using multiversion read consistency. Once conflicts are identified, the algorithm runs in O n* e+m time, where n is the number of transactions in the interval, e is the number of edges in the conflict graph among the transactions, and m is the maximum number of accesses of any transaction. The algorithm has been implemented on a real system to test its performance using a benchmark. Some experiments show that the algorithm improves transaction throughput by reducing lock contention. The performance results are confirmed using a detailed simulation model. The paper concludes by providing some stimulating ideas that point to future research directions. The paper is well organized, with clear descriptions of the algorithm, performance experiments, and results. The authors also provide a good background of recent related work. I think the paper will appeal to everyone interested in extended transaction models and concurrency control in database systems.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems

ACM Transactions on Database Systems Volume 20, Issue 3

Sept. 1995

127 pages

ISSN:0362-5915

EISSN:1557-4644

DOI:10.1145/211414

Editor:
Won Kim
UniSQL Inc., Austin, TX

Issue’s Table of Contents

Copyright © 1995 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1995

Published in TODS Volume 20, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

120
Total Citations
View Citations
1,627
Total Downloads

Downloads (Last 12 months)211
Downloads (Last 6 weeks)18

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mao YZhao JZhang SLiu HMarkl V(2023)MorphStream: Adaptive Scheduling for Scalable Transactional Stream Processing on MulticoresProceedings of the ACM on Management of Data10.1145/35889131:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588913
Faria NPereira J(2023)MRVs: Enforcing Numeric Invariants in Parallel Updates to Hotspots with Randomized SplittingProceedings of the ACM on Management of Data10.1145/35887231:1(1-27)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588723
Zhu BHua YLong ZLiu X(2023)CATS: A Computation-Aware Transaction Processing System with Proactive Unlocking2023 IEEE/ACM 31st International Symposium on Quality of Service (IWQoS)10.1109/IWQoS57198.2023.10188780(1-10)Online publication date: 19-Jun-2023
https://doi.org/10.1109/IWQoS57198.2023.10188780
Yu QZhou J(2023)Associativity-Aware Transaction Processing Optimization for Web Applications2022 IEEE 28th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS56603.2022.00072(507-513)Online publication date: Jan-2023
https://doi.org/10.1109/ICPADS56603.2022.00072
Dong ZWang ZYi CXu XZhang JLi JChen H(2023)Database Deadlock Diagnosis for Large-Scale ORM-Based Web Applications2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00219(2864-2877)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00219
Ketsman BKoch CNeven FVandevoort B(2022)Deciding Robustness for Lower SQL Isolation LevelsACM Transactions on Database Systems10.1145/356104947:4(1-41)Online publication date: 6-Nov-2022
https://dl.acm.org/doi/10.1145/3561049
Vandevoort BKetsman BKoch CNeven FLibkin LBarceló P(2022)Robustness Against Read CommittedProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3517804.3524162(1-14)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3517804.3524162
Liu YSu LShah VZhou YVaz Salles MIves ZBonifati AEl Abbadi A(2022)Hybrid Deterministic and Nondeterministic Execution of Transactions in Actor SystemsProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3526172(65-78)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3526172
Chen YYu XKoutris PArpaci-Dusseau AArpaci-Dusseau RShu JIves ZBonifati AEl Abbadi A(2022)Plor: General Transactions with Predictable, Low Tail LatencyProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3517879(19-33)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3517879
Huang NWu LWu WDas S(2022)DTC: A Dynamic Transaction Chopping Technique for Geo-Replicated Storage ServicesIEEE Transactions on Services Computing10.1109/TSC.2021.308981915:6(3210-3223)Online publication date: 1-Nov-2022
https://doi.org/10.1109/TSC.2021.3089819
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents