Skip to main content

Real-time Index Concurrency Control

  • Chapter
Real-Time Database Systems

Part of the book series: The International Series in Engineering and Computer Science ((SECS,volume 593))

  • 194 Accesses

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

  1. R. Abbott and H. Garcia-Molina, “Scheduling Real-Time Transactions: A Performance Evaluation”, Proc. of 14th Intl. Conf. on Very Large Data Bases, August 1988.

    Google Scholar 

  2. R. Bayer and M. Schkolnick, “Concurrency of Operations on B-trees”, Acta Informatica, 9, 1977.

    Google Scholar 

  3. D. Comer, “The Ubiquitous B-tree”ACM Computing Surveys, 11(4), 1979.

    Google Scholar 

  4. B. Goyal, J. Haritsa, S. Seshadri, and V. Srinivasan, “Index Concurrency Control in Firm Real-Time DBMS”, Proc. of 21st Intl.Conf. on Very Large Data Bases, September 1995.

    Google Scholar 

  5. J. Gray, “Notes on Database Operating Systems”, Operating Systems: An Advanced Course, R. Graham, R. Bayer and G. Seegmuller, eds., Springer-Verlag, 1979.

    Google Scholar 

  6. A. Guttman, “R-trees: A Dynamic Index Structure for Spatial Searching”, Proc. of ACM SIGMOD Intl. Conf. on Management of Data, May 1984.

    Google Scholar 

  7. T. Haerder, “Observations on Optimistic Concurrency Control Schemes”, Information Systems, 9(2), 1984.

    Google Scholar 

  8. J. Haritsa, M. Carey and M. Livny, “Data Access Scheduling in Firm Real-Time Database Systems”, Journal of Real-Time Systems, September 1992.

    Google Scholar 

  9. J. Haritsa, M. Livny and M. Carey, “Earliest Deadline Scheduling for Real-Time Database Systems”, Proc. of 1991 IEEE Real-Time Systems Symp., December 1991.

    Google Scholar 

  10. J. Haritsa and S. Seshadri, “Real-Time Index Concurrency Control”, SIGMOD Record, 25(1), March 1996.

    Google Scholar 

  11. J. Haritsa and S. Seshadri, “Real-time Index Concurrency Control”, IEEE Trans. on Knowledge and Data Engineering, 12(3), May/June 2000.

    Google Scholar 

  12. T. Imielinski and B. Badrinath, “Querying in Highly Mobile Distributed Environments”, Proc. of 18th Intl. Conf. on Very Large Data Bases, September 1992.

    Google Scholar 

  13. T. Kuo, C. Wei and K. Lam, “Real-time Access Control and Reservation on B-tree Indexed Data”, Proc. of 15th Intl. Conf on Data Engineering, March 1999.

    Google Scholar 

  14. C. Liu and J. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment”, Journal of the ACM, January 1973.

    Google Scholar 

  15. V. Lanin and D. Shasha, “A Symmetric Concurrent B-tree Algorithm”, Proc. of Fall Joint Computer Conf., 1986.

    Google Scholar 

  16. P. Lehman and S. Yao, “Efficient Locking for Concurrent Operations on B-trees”, ACM Trans. on Database Systems, 6(4), 1981.

    Google Scholar 

  17. C. Mohan and F. Levine, “ARIES/IM: An Efficient and High Concurrency Index Management Method using Write-Ahead Logging”, Proc. of ACM SIGMOD Intl. Conf. on Management of Data, June 1992.

    Google Scholar 

  18. C. Mohan, “ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-tree Indexes”, Proc. of 16th Intl. Conf. on Very Large Data Bases, September 1990.

    Google Scholar 

  19. C. Mohan, “Less Optimism about Optimistic Concurrency Control”, Proc. of 2nd Intl. Workshop on RIDE: Transaction and Query Processing, February 1992.

    Google Scholar 

  20. Y. Mond and Y. Raz, “Concurrency Control in B+-trees Databases using Preparatory Operations”, Proc. of 11th Intl. Conf. on Very Large Data Bases, September 1985.

    Google Scholar 

  21. H. Pang, M. Carey and M. Livny, “Managing Memory for Real-Time Queries”, Proc. of ACM SIGMOD Intl. Conf on Management of Data, May 1994.

    Google Scholar 

  22. Y. Sagiv, “Concurrent Operations on B*-trees with Overtaking”, Journal. of Computer and System Sciences, 33(2), 1986.

    Google Scholar 

  23. V. Srinivasan and M. Carey, “Performance of B-tree Concurrency Control Algorithms”, Proc. of ACM SIGMOD Intl. Conf. on Management of Data, May 1991.

    Google Scholar 

  24. L. Sha, R. Rajkumar and J. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-Time Synchronization”, Tech. Report CMU-CS-87-181, Depts. of CS, ECE and Statistics, Carnegie Mellon University, 1987.

    Google Scholar 

  25. J. Stankovic and W. Zhao, “On Real-Time Transactions”, ACM SIGMOD Record, March 1988.

    Google Scholar 

  26. A. Thomasian and I. Ryu, “Performance Analysis of Two-Phase Locking”, IEEE Trans. on Software Engg., March 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Kluwer Academic Publishers

About this chapter

Cite this chapter

Haritsa, J.R., Seshadri, S. (2002). Real-time Index Concurrency Control. In: Lam, KY., Kuo, TW. (eds) Real-Time Database Systems. The International Series in Engineering and Computer Science, vol 593. Springer, Boston, MA. https://doi.org/10.1007/0-306-46988-X_6

Download citation

  • DOI: https://doi.org/10.1007/0-306-46988-X_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-7218-9

  • Online ISBN: 978-0-306-46988-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics