Skip to main content
SpringerLink
Log in

A Theory of Transactions on Recoverable Search Trees

  • Conference paper
  • First Online:
Database Theory — ICDT 2001 (ICDT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1973))

Included in the following conference series:

Abstract

We consider transactions running on a database that consists of records with unique totally-ordered keys and is organized as a sparse primary search tree such as a B-tree index on disk storage. We extend the classical read-write model of transactions by considering inserts, deletes and key-range scans and by distinguishing between four types of transaction states: forward-rolling, committed, backward-rolling, and rolled- back transactions. A search-tree transaction is modelled as a two-level transaction containing structure modifications as open nested subtransactions that can commit even though the parent transaction aborts. Isolation conditions are defined for search-tree transactions with nested structure modifications that guarantee the structural consistency of the search tree, a required isolation level (including phantom prevention) for database operations, and recoverability for structure modifications and database operations.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. G. Alonso, R. Vingralek, D. Agrawal, Y. Breitbart, A. El Abbadi, H.-J. Schek, and G. Weikum. Unifying concurrency control and recovery of transactions. Information Systems 19 (1994), 101–115.

    Article  Google Scholar 

  2. R. Bayer and M. Schkolnick. Concurrency of operations on B-trees. Acta Informatica 9 (1977), 1–21.

    Article  MATH  MathSciNet  Google Scholar 

  3. H. Berenson, P. Bernstein, J. Gray, J. Melton, E. O’Neil, and P. O’Neil. A critique of ANSI SQL isolation levels. In: Proc. of the 1995 ACM SIGMOD Internat. Conf. on Management of Data, 1–10.

    Google Scholar 

  4. P. H. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987.

    Google Scholar 

  5. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1993.

    Google Scholar 

  6. D. Lomet. Key range locking strategies for improved concurrency. In: Proc. of the 19th VLDB Conference, 1993, 655–664.

    Google Scholar 

  7. P. L. Lehman and S. B. Yao. Efficient locking for concurrent operations on B-trees. ACM Trans. Database Systems 6 (1981), 650–670.

    Article  MATH  Google Scholar 

  8. D. Lomet. MLR: a recovery method for multi-level systems. In: Proc. of the 1992 ACM SIGMOD Internat. Conf. on Management of Data, 185–194.

    Google Scholar 

  9. D. Lomet. Advanced recovery techniques in practice. In: Recovery Mechanisms in Database Systems (V. Kumar and M. Hsu, eds), Prentice Hall, 1998, 697–710.

    Google Scholar 

  10. D. Lomet and B. Salzberg. Access method concurrency with recovery. In: Proc. of the 1992 ACM SIGMOD Internat. Conf. on Management of Data, 351–360.

    Google Scholar 

  11. D. Lomet and B. Salzberg. Concurrency and recovery for index trees. The VLDB Journal 6 (1997), 224–240.

    Article  Google Scholar 

  12. C. Mohan. Concurrency control and recovery methods for B +-tree indexes: ARIES/KVL and ARIES/IM. In: Performance of Concurrency Control Mechanisms in Centralized Database Systems (V. Kumar, ed), Prentice Hall, 1996, 248–306.

    Google Scholar 

  13. C. Mohan. ARIES/KVL: a key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes. In: Proc. of the 16th VLDB Conference, 1990, 392–405.

    Google Scholar 

  14. C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwartz. ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM Trans. Database Systems 17 (1992), 94–162.

    Article  Google Scholar 

  15. C. Mohan and F. 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, 371–380.

    Google Scholar 

  16. Y. Sagiv. Concurrent operations on B*-trees with overtaking. J. Computer and System Sciences 33 (1986), 275-296.

    Google Scholar 

  17. H-J. Schek, G. Weikum and H. 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, 1993, 300–311.

    Google Scholar 

  18. D. Shasha and N. Goodman. Concurrent search structure algorithms. ACM Trans. Database Systems 13 (1988), 53–90.

    Article  MATH  Google Scholar 

  19. R. Vingralek, H. Hasse-Ye, Y. Breitbart and H.-J. Schek. Unifying concurrency control and recovery of transactions with semantically rich operations. Theoretical Computer Science 190 (1998), 363–396.

    Article  MATH  MathSciNet  Google Scholar 

  20. G. Weikum. Principles and realization strategies of multi-level transaction management. ACM Trans. Database Systems 16 (1991), 132–180.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, Teollisuuskatu 23, P. O. Box 26, FIN-00014, University of Helsinki, Finland

    Seppo Sippu

  2. Department of Computer Science and Engineering, Helsinki University of Technology, Konemiehentie 2, FIN-02015, HUT, Finland

    Eljas Soisalon-Soininen

Authors
  1. Seppo Sippu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eljas Soisalon-Soininen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Limburg University (LUC), 3590, Diepenbeek, Belgium

    Jan Van den Bussche

  2. Department of Computer Science and Engineering, University of California, 92093-0114, La Jolla, CA, USA

    Victor Vianu

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sippu, S., Soisalon-Soininen, E. (2001). A Theory of Transactions on Recoverable Search Trees. In: Van den Bussche, J., Vianu, V. (eds) Database Theory — ICDT 2001. ICDT 2001. Lecture Notes in Computer Science, vol 1973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44503-X_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-44503-X_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41456-8

  • Online ISBN: 978-3-540-44503-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation