This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Real-Time Processing in Client-Server Databases
March 2002 (vol. 51 no. 3)
pp. 269-288

In this paper, we propose and experimentally evaluate the use of the client-server database paradigm for real-time processing. To date, the study of transaction processing with time constraints has mostly been restricted to centralized or “single-node” systems. Recently, client-server databases have exploited locality of data accesses in real-world applications to successfully provide reduced transaction response times. Our objective is to investigate the feasibility of real-time processing in a data-shipping client-server database architecture. We compare the efficiency of the proposed architecture with that of a centralized real-time database system. We discuss transaction scheduling issues in the two architectures and propose a new policy for scheduling transactions in the client-server environment. This policy assigns higher priorities to transactions that have a greater potential for successful completion through the use of locally available data. Through a detailed performance scalability study, we investigate the effects of client data-access locality and various updating workloads on transaction completion rates. Our experimental results show that real-time client-server databases can provide significant performance gains over their centralized counterparts. These gains become evident when large numbers of clients (more than 40) are attached per server, even in the presence of high data contention.

[1] R.K. Abbott and H. Garcia-Molina, “Scheduling Real-Time Transactions: A Performance Evaluation,” ACM Trans. Database Systems, vol. 17, no. 3, pp. 513–560, Sept. 1992.
[2] S. Abiteboul, V. Vianu, B. Fordham, and Y. Yesha, “Relational Transducers for Electronic Commerce,” Proc. ACM Symp. Principles of Database Systems, June 1998.
[3] M. Aron, P. Druschel, and W. Zwaenepoel, “Cluster Reserves: A Mechanism for Resource Management in Cluster-Based Network Servers,” Proc. ACM SIGMETRICS Conf., June 2000.
[4] A. Bestavros and S. Braoudakis, “Timeliness via Speculation for Real-Time Databases,” Proc. IEEE Real-Time Systems Symp., Dec. 1994.
[5] W. Bolosky, J. Douceur, D. Ely, and M. Theimer, “Feasibility of Serverless Distributed File System Deployed on an Existing Set of Desktop PCs,” Proc. ACM SIGMETRICS Conf., June 2000.
[6] A. Burchard, J. Liebeherr, Y. Oh, and S. Son, “Assigning Real-Time Tasks to Homogeneous Multiprocessor Systems,” IEEE Trans. Computers, vol. 44, no. 12, Dec. 1995.
[7] M. Carey, M. Franklin, M. Livny, and E. Shekita, "Data Caching Tradeoffs in Client-Server DBMS Architecture," Proc. ACM-SIGMOD Conf. Management of Data,Denver, Colo., May 1991.
[8] I. Chu and M. Winslett, “Choices in Database Workstation-Server Architecture,” Proc. 17th Ann. Int'l Computer Software and Applications Conf., Nov. 1993.
[9] A. Delis and N. Roussopoulos, "Performance Comparison of Three Modern DBMS Architectures," IEEE Trans. Software Eng., vol. 19, no. 2, pp. 120-138, Feb. 1993.
[10] D. DeWitt, D. Maier, P. Futtersack, and F. Velez, "A Study of Three Alternative Workstation-Server Architectures for Object-Oriented Database Systems," Proc. 16th Very Large Data Bases Conf., pp. 107-121,Brisbane, Australia, 1990.
[11] A. Dogac, “A Survey of the Current State-of-the-Art in Electronic Commerce and Research Issues in Enabling Technologies,” Proc. Euro-Med Net 98 Conf., Electronic Commerce Track, Mar. 1998.
[12] W. Feng and J. Liu, “Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines,” IEEE Trans. Software Eng., vol. 23, no. 2, Feb. 1997.
[13] WAP Forum, “Wireless Application Protocol,” http:/www.wapforum.org, June 2000.
[14] A. Gal, S. Kerr, and J. Mylopoulos, “Information Services on the Web: Building and Maintaining Domain Models,” Int'l J. Cooperative Information Systems, vol. 8, no. 4, pp. 227-254, 1999.
[15] J. Haritsa, M. Livny, and M. Carey, “On Being Optimistic about Real-Time Constraints,” Proc. Ninth ACM Symp. Principles of Database Systems, 1990.
[16] J. Haritsa, M. Livny, and M. Carey, “Earliest Deadline Scheduling for Real-Time Database Systems,” Proc. 12th Real-Time Systems Symp., Dec. 1991.
[17] J.H. Howard, M.L. Kazar, S.G. Menees, D.A. Nichols, M. Satyanarayanan, R.N. Sidebotham, and M.J. West, "Scale and performance in a distributed file system," ACM Trans. Comp. Sys., vol. 6, no. 1, Feb. 1988.
[18] J. Huang, J. Stankovic, K. Ramamritham, and D. Towsley, “Experimental Evaluation of Real-Time Concurrency Control Schemes,” Proc. 17th Int'l Conf. Very Large Data Bases, 1991.
[19] S. Hvasshovd, S. Bratsberg, and O. Torbjornsen, “An Ultra Highly Available DBMS,” Proc. 26th Int'l Conf. Very Large Databases, Sept. 2000.
[20] E. Jensen, C. Locke, and H. Tokuda, “A Time-Driven Scheduler for Real-Time Operating Systems,” Proc. IEEE Real-Time Systems Symp., pp. 112-122, 1985.
[21] V. Kanitkar and A. Delis, “A Case for Real-Time Client-Server Databases,” Proc. Second Int'l Workshop Real-Time Databases, Sept. 1997.
[22] B. Kao and H. Garcia-Molina, “Subtask Deadline Assignment for Complex Distributed Soft Real-Time Tasks,” Proc. 14th IEEE Int'l Conf. Distributed Computing Systems, June 1994.
[23] C. Lamb, G. Landis, J. Orenstein, and D. Weinreb, "The ObjectStore Database System," Comm. ACM, vol. 34, no. 10, Oct. 1991.
[24] M. Lehr, Y. Kim, and S. Son, “Managing Contention and Timing Constraints in a Real-Time Database System,” Proc. 16th IEEE Real-Time Systems Symp., Dec. 1995.
[25] C. Mohan and I. Narang, “Efficient Locking and Caching of Data in the Multisystem Shared Disks Transaction Environment,” Proc. Third Int'l Conf. Extending Database Technology, pp. 453-468, Mar. 1992.
[26] C. Mohan and I. Narang, "ARIES/CSA: A Method for Database Recovery in Client-Server Architecture," Proc. Conf. Management of Data SIGMOD,Minneapolis, Minn., June 1994.
[27] A. Mok and M. Dertouzos, “Multiprocessor Scheduling in a Hard Real-Time Environment,” Proc. Seventh Texas Conf. Computing Systems, 1979.
[28] E. Panagos, A. Biliris, H.V. Jagadish, and R. Rastogi, "Client-Based Logging for High Performance Distributed Architectures," Proc. 12th Int'l Conf. Data Eng., pp. 344-351,New Orleans, Feb.-Mar. 1996.
[29] K. Ramamritham, “Allocation and Scheduling of Complex Periodic Tasks,” Proc. 10th IEEE Int'l Conf. Distributed Computing Systems, 1990.
[30] K. Ramamritham, J. Stankovic, and P. Shiah, “Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, Apr. 1990.
[31] B. Reich and I. Ben-Shaul, “A Componentized Architecture for Dynamic Electronic Markets,” ACM SIGMOD Record, vol. 27, no. 4, Dec. 1998.
[32] N. Roussopoulos and A. Delis, “Modern Client-Server DBMS Architectures,” ACM SIGMOD Record, vol. 20, no. 3, pp. 52-61, Sept. 1991.
[33] N. Roussopoulos and H. Kang, "Principles and Techniques in the Design of ADMS±," Computer, vol. 19, no. 12, pp. 19-25, Dec. 1986.
[34] J. Santos, R. Muntz, and B. Ribeiro-Neto, “Comparing Random Data Allocation and Data Stripping in Multimedia Servers,” Proc. ACM SIGMETRICS Conf., June 2000.
[35] R. Sivasankaran, J. Stankovic, D. Towsley, B. Purimetla, and K. Ramamritham, “Priority Assignment in Real-Time Active Databases,” The VLDB J., vol. 5, 1996.
[36] N. Soparkar, H. Korth, and A. Silberschatz, “Databases with Deadline and Contingency Constraints,” IEEE Trans. Knowledge and Data Eng., vol. 7, no. 4, Aug. 1995.
[37] W. Stallings and R. Van Slyke, Business Data Communications, chapter“Wireless Networks.”Upper Saddle River, N.J.: Prentice Hall, 2001.
[38] J. Stankovic, “The Many Faces of Multi-Level Real-Time Scheduling,” Proc. Real-Time Systems and Applications, pp. 2-5, Oct. 1995.
[39] A. Thomasian, “Concurrency Control: Methods, Performance, and Analysis,” ACM Computing Surveys, vol. 30, no. 1, pp. 70-119, 1998.
[40] F. Velez, G. Bernard, and V. Darnis, “The$O_{2}$Object Manager: An Overview,” Proc. 15th Int'l Conf. Very Large Data Bases, 1989.
[41] Y. Wang and L. Rowe, "Cache Consistency and Concurrency Control in a Client/Server DBMS Architecture," Proc. 1991 ACM SIGMOD Int'l Conf.,Denver, Colo., May 1991.
[42] K. Wilkinson and M.A. Neimat, "Maintaining Consistency of Client-Cached Data," Proc. Int'l Conf. Very Large Data Bases,Brisbane, Australia, Aug. 1990.

Index Terms:
client-server databases, real-time transaction processing, experimental performance evaluation
Citation:
V. Kanitkar, A. Delis, "Real-Time Processing in Client-Server Databases," IEEE Transactions on Computers, vol. 51, no. 3, pp. 269-288, March 2002, doi:10.1109/12.990126
Usage of this product signifies your acceptance of the Terms of Use.