Abstract
This paper proposes methodologiesto control the access of B+-tree-indexed datain a batch and firm real-time fashion. Algorithms are proposedto insert, query, delete, and rebalance B+-tree-indexeddata based on the non-real-time algorithms proposed in Kerttu,Eljas, and Tatu (1996) and the idea of priority inheritance (Sha,Rajkumar, and Lehoczky, 1990). We propose methodologies to reducethe number of disk I/O to improve the system performancewithout introducing more priority inversion. When the schedulabilityof requests with critical timing constraints is highly important,we propose a mechanism for data reservation based on the ideaof preemption level and the Stack Resource Policy (Baker, 1990).The performance of our methodologies was evaluated by a seriesof experiments, from which we have obtained encouraging results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abbott, R., and Garcia-Molina, H. 1988. Scheduling real-time transactions: a performance evaluation. Proceeding of the 14th VLDB Conference, Los Angeles, CA, pp. 1–12.
Andresen, D., Yang, T., Egecioglu, O., Ibarra, O. H., and Smith, T. R. 1996. Scalability issues for high performance digital libraries on theworld wide web. The 3rd Forum on Research and Technology Advances in Digital Library, pp. 139–148.
Baker, T. P. 1990. A stack-based resource allocation policy for real time processes. IEEE 11st Real-Time Systems Symposium, December 4–7.
Bayer, R., and Schkolnick, M. 1977. Concurrency of operations on B-trees. Acta Informatica 9.
Bernstein, P. A., Hadzilacos, V., and Goodman, N. 1987. Concurrency Control and Recovery in Database Systems. Reading, MA: Addison-Wesley.
Bestavros, A. 1994. Timeliness via speculation for real-time databases. IEEE 15th Real-Time Systems Symposium.
Bestavros, A. 1996. Advances in real-time database systems research. Special Section on RTDB of ACM SIGMOD Record 25(1).
Bestavros, A., Lin, K. J., and Son, S. H. 1997. Real-Time Database Systems: Issues and Applications. Kluwer Academic Publishers.
Choy, D. M., and Morris, R. J. T. 1996. Services and architectures for electronic publishing. IEEE COMPCON, pp. 291–297.
Cutting, D., and Pedersen, J. 1990. Optimization for dynamic inverted index maintenance. ACM SIGIR 1990, International Conference of Information Retrieval, pp. 405–411.
Dipippo, L. B. C., and Wolfe, V. F. 1993. Object-based semantic real-time concurrency control. IEEE Real-Time Systems Symposium, December.
Elmasri, R., and Navathe, S. B. 1994. Fundamentals of Database Systems. Second Edition. Addison-Wesley Publishing Company.
Goyal, B., Haritsa, J. R., Seshadri, S., and Srinivasan, V. 1995. Index concurrency control in firm real-time DBMS. Proceedings of the 21th VLDB Conference, pp. 146–157.
Grossman, R., Qin, X., Xu, W., Hulen, H., and Tyler, T. 1995. An architecture for a scalable, high performance digital library. IEEE 14th Symposium on Mass Storage Systems, Sept. pp. 89–98
Haritsa, J. R., Carey, M. J., Livny, M. 1990. On being optimistic about real-time constraints. Proceeding of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Princples of Database Systems, April pp. 331–343.
Haritsa, J., and Seshadri, S. 2000. Real-time index concurrency control. IEEE Transactions on Knowledge and Data Engineering.
Johnson, T., and Shasha, D. 1990. A framework for the performance analysis of concurrent B-tree algorithms. ACM Symposium on Principles of Database Systems, April.
Kamath, M.U., and Ramamritham, K. 1993. Performance characteristics of epsilon serializability with hierarchical inconsistency bounds. International Conference on Data Engineering, April, pp. 587–594.
Kerttu, P. M., Eljas, S. S., and Tatu, Y. 1996. Concurrency control in B-trees with batch updates. IEEE Transaction on Knowledge and Data Engineering 8(6): 975–984.
Kuo, T.-W. 1994. Real-Time Database—Semantics and Resource Scheduling. Ph.D. Thesis, Department of Computer Sciences, The University of Texas at Austin.
Kuo, T.-W., and Mok, A. K. 1992. Application semantics and concurrency control of real-time data-intensive applications. IEEE 13th Real-Time Systems Symposium.
Kuo, T.-W., and Mok, A. K. 1993. SSP: a semantics-based protocol for real-time data access. IEEE 14th Real-Time Systems Symposium, December.
Kuo, T.-W., Wei, C.-H., and Lam, K. Y. 1999. Real-time data access control on B-tree index structures. IEEE 15th International Conference on Data Engineering, April.
Lam, K.-Y., Kuo, T.-W., and Shu, L.-C. 1998. On using similarity to process transactions in stock trading systems. IEEE Workshop on Dependable and Real-Time E-Commerce Systems, June.
Lang, S. D., Driscoll, J. R., and Hou, J. H. 1986. Batch insertion for tree structure file organizations—improving differential database represeantation. Information Systems 11(2): 167–175.
Lehman, P., and Yao, S. 1981. Efficient locking for concurrent operations on B-trees. ACM Transactions on Database Systems 6(4).
Liang, M.-C., Kuo, T.-W., and Shu, L.-C. 1997. A quantification of aborting effect for real-time data accesses. IEEE Transactions on Computers. To appear.
Lin, Y., and Son, S. H. 1990. Concurrency control in real-time databases by dynamic adjustment of serialization order. IEEE 11th Real-Time Systems Symposium, December 4–7.
Liu, C. L., and Layland, J.W. 1973. Scheduling algorithms for multiprogramming in a hard realtime environment. JACM 20(1): 46–61.
Mohan, C., and Levine, F. 1992. ARIES/IM: An effecient and high concurrency index management method using write-ahead logging. ACM SIGMOD Conference, June.
Mond, Y., and Raz, Y. 1985. Concurrency control in B+-trees databases using preparatory operations. VLDB.
Nurmi, O., Soisalon-Soininen, E., and Wood, D. 1987. Concurrency control in database structures with relaxed balance. Proceedings of Sixth ACM Symp. Principles of Database Systems, pp. 170–176.
Peng, C.-S., and Lin, K.-J. 1996. A semantic-based concurrency control protocol for real-time transactions. IEEE 1996 Real-Time Technology and Applications Symposium.
Pu, C., and Leff, A. 1991. Epsilon-serializability. Technical Report CUCS-054-90. Dept. of Computer Science, Columbia University, January.
Ramamritham, K., and Pu, C. 1995. A formal characterization of epsilon serializability. IEEE Transactions on Knowledge and Data Engineering 7(6): 997–1007.
Sha, L., Rajkumar, R., and Lehoczky, J. P. 1990. Priority inheritance protocols: an approach to real-time synchronization. Technical Report CMU-CS-87-181. Dept. of Computer Science, CMU, November 1987. IEEE Transactions on Computers 39(9) September.
Sha, L., Rajkumer, R., Son, S. H., and Chang, C.-H. 1991. A real-time locking protocol. IEEE Transaction on Computers 40(7): 793–800.
Son, S. H., editor. 1988. ACM SIGMOD Record: Special Issue on Real-Time Databases, March.
Srinvasan, V., and Carey, M. 1991. Performance of B-tree concurrency control algorithms. ACM SIGMOD Conference. May.
Srivastava, J., and Ramamoorthy, C. V. 1988. Efficient algorithms for maintenance of large database indexes. Proc. Fourth International Conference of Data Engineering, pp. 402–409.
Xiong, M., Ramamritham, K., Sivasankaran, R., Stankovic, J. A., and Towsley, D. 1996. Scheduling Transactions with temporal constraints: exploiting data semantics. IEEE Real-Time Systems Symposium December: 240–251.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kuo, TW., Wei, CH. & Lam, KY. Real-Time Access Control and Reservation on B-Tree Indexed Data. Real-Time Systems 19, 245–281 (2000). https://doi.org/10.1023/A:1008191111512
Issue Date:
DOI: https://doi.org/10.1023/A:1008191111512