Jayant R. Haritsa
- [1] A. Biliris. A comparative study of concurrency control methods in B-trees. In Proc. of Agean Workshop on Computing, Loutraki, July 1986. Google Scholar
Digital Library
- [2] R. Bayer and M. Schkolnick. Concurrency. of Operations on B-Trees. In Acta Informatica, 9, 1977.Google Scholar
- [3] D. Comer. The Ubiquitous B-Tree. In ACM Computing Surveys, 11(4), 1979. Google ScholarDigital Library
- [4] B. Goyal, J. Haritsa, S. Seshadri, and V. Srinivasan. Index Concurrency Control in Firm Real-Time DBMS. In Proc. of VLDB Conf., September 1995. Google ScholarDigital Library
- [5] J. Haritsa, M. Carey, and M. Livny. Earliest Deadline Scheduling for Real-Time Database Systems. In Proc. of IEEE Real-Time Systems Symp., December 1991.Google ScholarCross Ref
- [6] J. Haritsa, M. Carey and M. Livny. Data Access Scheduling in Firm Real-Time Database Systems. In Journal of Real-Time Systems, September 1992. Google ScholarDigital Library
- [7] T. Johnson and D. Shasha. A framework for the performance analysis of concurrent B-tree algorithms. In Proc. of ACM Symp. on Principles of Database Systems, April 1990. Google ScholarDigital Library
- [8] Y. Kwong and D. Wood. A new method for concurrency in B-trecs. IEEE Trans. on Software Engineering , SE-8(3), May 1982.Google Scholar
- [9] V. Lanin and D. Shasha. A Symmetric Concurrent B-tree Algorithm. In Proc. of Fall Joint Computer Conf., 1986. Google ScholarDigital Library
- [10] P. Lehman and S. Yao. Efficient Locking for Concurrent Operations on B-trees. In ACM Trans. on Database Systems, 6(4), 1981. Google ScholarDigital Library
- [11] C. Mohan and F. Levine. ARIES/IM: An Efficient and High Concurrency Index Management Method using Write-Ahead Logging. In Proc. of ACM SIGMOD Conf., June 1992. Google ScholarDigital Library
- [12] Y. Mond and Y. Raz. Concurrency Control in B+- trees Databases Using Preparatory Operations. In Proc. of VLDB Conf., September 1985.Google Scholar
- [13] H. Pang, M. Carey and M. Livny. Managing Memory for Real-Time Queries. In Proc. of ACM SIGMOD Conf., May 1994. Google ScholarDigital Library
- [14] D. Shasha and N. Goodman. Concurrent search structure algorithms. In ACM Trans. on Database Systems, 13(1), March 1988. Google ScholarDigital Library
- [15] V. Srinivasan and M. Carey. Performance of B-Tree Concurrency Control Algorithms. In Proc. of ACM SIGMOD Conf., May 1991. Google ScholarDigital Library
- [16] Ulusoy, O. Research Issues in Real-Time Database Systems. Tech. Report BU-CEIS-94-32, Dept. of Computer Engg. and Information Science, Bilkent University, Turkey, 1994.Google Scholar
Index Terms
- Real-time index concurrency control
Recommendations
Real-Time Index Concurrency Control
Real-time database systems are expected to rely heavily on indexes to speed up data access and, thereby, help more transactions meet their deadlines. Accordingly, high-performance index concurrency control (ICC) protocols are required to prevent ...
Concurrency Control for Mixed Transactions in Real-Time Databases
Many recent studies have suggested that the optimistic concurrency control (OCC) protocols outperform the locking-based protocols in real-time database systems (RTDBS). However, the OCC protocols suffer from the problem of unnecessary transaction ...
Abort-Oriented Concurrency Control for Real-Time Databases
There has been growing interest in the performance of transaction systems that have significant response time requirements. These requirements are usually specified as hard or soft deadlines on individual transactions and a concurrency control algorithm ...
Comments