Skip to main content

Transactions on the Logical Database

  • Chapter
  • First Online:
Transaction Processing

Part of the book series: Data-Centric Systems and Applications ((DCSA))

Abstract

The database as seen by an application programmer is called the logical database. In most cases the logical database is a relational database, so that application programs operate on tuples in relations through an SQL interface. A transaction is a sequence of read and update actions on the logical database, performed on the database upon a sequence of requests from an application. The action sequence constituting a transaction is atomic in the sense that either the effects of all the actions are recorded permanently in the database (in which case the transaction is committed) or none are (in which case the transaction is aborted and rolled back).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 79.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Morton M. Astrahan, Mike W. Blasgen, Donald D. Chamberlin, Kapali P. Eswaran, Jim N. Gray, Patricia P. Griffiths, W. Frank King III, Raymond A. Lorie, Paul R. McJones, James W. Mehl, Gianfranco R. Putzolu, Irving L. Traiger, Bradford W. Wade, and Vera Watson. System R: Relational approach to database management. ACM Trans. Database Syst., 1(2):97–137, 1976.

    Google Scholar 

  • Philip A. Bernstein, Vassco Hadzilacos, and Nathan Goodman. Concurrency Control and Recovery in Database Systems. Addison Wesley, 1987.

    Google Scholar 

  • Mike W. Blasgen, Morton M. Astrahan, Donald D. Chamberlin, Jim Gray, W. Frank King III, Bruce G. Lindsay, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Gianfranco R. Putzolu, Mario Schkolnick, Patricia G. Selinger, Donald R. Slutz, H. Raymond Strong, Irving L. Traiger, Bradford W. Wade, and Robert A. Yost. System R: An architectural overview. IBM Systems Journal, 20(1):41–62, 1981.

    Google Scholar 

  • Mike W. Blasgen, Morton M. Astrahan, Donald D. Chamberlin, Jim Gray, W. Frank King III, Bruce G. Lindsay, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Gianfranco R. Putzolu, Mario Schkolnick, Patricia G. Selinger, Donald R. Slutz, H. Raymond Strong, Irving L. Traiger, Bradford W. Wade, and Robert A. Yost. System R: An architectural overview. IBM Systems Journal, 38(2/3):375–396, 1999.

    Google Scholar 

  • Donald D. Chamberlin, Morton M. Astrahan, Mike W. Blasgen, Jim Gray, W. Frank King III, Bruce G. Lindsay, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Gianfranco R. Putzolu, Patricia G. Selinger, Mario Schkolnick, Donald R. Slutz, Irving L. Traiger, Bradford W. Wade, and Robert A. Yost. A history and evaluation of System R. Commun. ACM, 24(10):632–646, 1981.

    Google Scholar 

  • Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, and Irving L. Traiger. On the notions of consistency and predicate locks. Technical report, IBM Research Laboratory, San Jose, Nov. 1974.

    Google Scholar 

  • Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, and Irving L. Traiger. The notions of consistency and predicate locks in a database system. Commun. ACM, 19(11):624–633, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  • Jim Gray. A transaction model. In Automata, Languages and Programming, Proc. of the 7th Colloquium, volume 85 of Lecture Notes in Computer Science, pages 282–298. Springer, 1980.

    Google Scholar 

  • Jim Gray. The transaction concept: Virtues and limitations. In VLDB 1981, Proc. of the 7th Internat. Conf. on Very Large Data Bases, pages 144–154. IEEE Computer Society, 1981.

    Google Scholar 

  • Jim Gray and Andreas Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, 1993.

    Google Scholar 

  • Jim Gray, Raymond A. Lorie, Gianfranco R. Putzolu, and Irving L. Traiger. Granularity of locks and degrees of consistency in a shared data base. In IFIP Working Conf. on Modelling in Data Base Management Systems, pages 365–394, 1976.

    Google Scholar 

  • Jim Gray, Paul R. McJones, Mike W. Blasgen, Bruce G. Lindsay, Raymond A. Lorie, Thomas G. Price, Gianfranco R. Putzolu, and Irving L. Traiger. The recovery manager of the System R database manager. ACM Comput. Surv., 13(2):223–243, 1981.

    Google Scholar 

  • Ibrahim Jaluta. B-Tree Concurrency Control and Recovery in a Client-Server Database Management System. PhD thesis, Department of Computer Science and Engineering, Helsinki University of Technology, Espoo, Finland, 2002. http://lib.tkk.fi/Diss/2002/isbn9512257068/.

  • Ibrahim Jaluta, Seppo Sippu, and Eljas Soisalon-Soininen. Recoverable B+-trees in centralized database management systems. Internat. J. of Applied Science & Computations, 10(3):160–181, 2003.

    Google Scholar 

  • Ibrahim Jaluta, Seppo Sippu, and Eljas Soisalon-Soininen. Concurrency control and recovery for balanced B-link trees. VLDB J., 14(2):257–277, 2005.

    Google Scholar 

  • Ibrahim Jaluta, Seppo Sippu, and Eljas Soisalon-Soininen. B-tree concurrency control and recovery in page-server database systems. ACM Trans. Database Syst., 31(1):82–132, 2006.

    Google Scholar 

  • C. Mohan. ARIES/KVL: A key-value locking method for concurrency control of multiaction transactions operating on B-Tree indexes. In VLDB 1990, Proc. of the 16th Internat. Conf. on Very Large Data Bases, pages 392–405. Morgan Kaufmann, 1990a.

    Google Scholar 

  • C. Mohan. Concurrency control and recovery methods for B+-Tree indexes: ARIES/KVL and ARIES/IM. In Vijay Kumar, editor, Performance of Concurrency Control Mechanisms in Centralized Database Systems, pages 248–306. Prentice Hall, 1996a.

    Google Scholar 

  • C. Mohan and Frank E. Levine. ARIES/IM: An efficient and high concurrency index management method using write-ahead logging. In Proc. of the 1992 ACM SIGMOD Internat. Conf. on Management of Data, pages 371–380. ACM Press, 1992.

    Google Scholar 

  • Christos H. Papadimitriou. The Theory of Database Concurrency Control. Computer Science Press, 1986.

    Google Scholar 

  • Hans-Jörg Schek, Gerhard Weikum, and Haiyan Ye. Towards a unified theory of concurrency control and recovery. In Proc. of the 12th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 300–311. ACM Press, 1993.

    Google Scholar 

  • Seppo Sippu and Eljas Soisalon-Soininen. A theory of transactions on recoverable search trees. In Database Theory—ICDT 2001, Proc. of the 8th Internat. Conf., volume 1973 of Lecture Notes in Computer Science, pages 83–98. Springer, 2001.

    Google Scholar 

  • Gerhard Weikum and Gottfried Vossen. Transactional Information Systems. Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Sippu, S., Soisalon-Soininen, E. (2014). Transactions on the Logical Database. In: Transaction Processing. Data-Centric Systems and Applications. Springer, Cham. https://doi.org/10.1007/978-3-319-12292-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12292-2_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12291-5

  • Online ISBN: 978-3-319-12292-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics