This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Time-Constrained Query Processing in CASE-DB
December 1995 (vol. 7 no. 6)
pp. 865-884

Abstract—CASE-DB is a real-time, single-user, relational prototype DBMS that permits the specification of strict time constraints for relational algebra queries. Given a time constrained nonaggregate relational algebra query and a “fragment chain” for each relation involved in the query, CASE-DB initially obtains a response to a modified version of the query and then uses an “iterative query evaluation” technique to successively improve and evaluate the modified version of the query. CASE-DB controls the risk of overspending the time quota at each step using a “risk control technique.”

[1] S. Chaudhuri,“Generalization and a framework for query modification,” Proc. Sixth Int’l Conf. Data Engineering, Feb. 1990.
[2] S. Christodoulakis,“Estimating record selectivities,” Information Systems, vol. 8, 1983.
[3] S. Christodoulakis,“On the estimation and use of selectivities in database performance evaluation,” Tech. Report CS-89-24, Univ. of Waterloo, June 1989.
[4] D. Kaizheng,“On automated query modification in databases,” PhD thesis, Dept. of Computer Engineering and Science, Case Western Reserve Univ., 1993.
[5] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[6] B. Gavish and A. Segev, "Set Query Optimization in Distributed Database Systems," ACM Trans. Database Systems, vol. 11, no. 3, pp. 266-293, Sept. 1986.
[7] S. Guruswamy,“CASE-DB: A system for processing real-time, nonaggregate relational algebra queries,” MS thesis, Dept. of Computer Engineering and Science, Case Western Reserve Univ., May 1992.
[8] W-C Hou,“The implementation of the extended relational database management system,” MS thesis, Dept. of Computer Engineering and Science, Case Western Reserve Univ., 1985.
[9] W-C Hou,“Relational aggreate query processing techniques for real-time databases,” PhD thesis, Dept. of Computer Engineering and Science, Case Western Reserve Univ., 1989.
[10] W-C Hou,G. Ozsoyoglu,, and B.K. Taneja,“Statistical estimators for relational algebra expressions,” Proc. ACM Symp. Principles of Database Systems, 1988.
[11] W-C. Hou,G. Ozsoyoglu,, and B.K. Taneja,“Processing aggregate relational queries with hard time constraints,” Proc. ACM SIGMOD Conf.,Portland, Oreg., 1989.
[12] W.-C. Hou and G. Ozsoyoglu, "Statistical Estimators for Aggregate Relational Algebra Queries," ACM Trans. Database Systems, vol. 16, no. 4, pp. 600-654, Dec. 1991.
[13] W. Hou and G. Ozsoyoglu, “Processing Real-Time Aggregate Queries in CASE-DB,” ACM Trans. Database Systems, June 1993.
[14] M.V. Mannino, P. Chu, and T. Sager, “Statiscal Profile Estimation in Database Systems,” ACM Computing Surveys, vol. 20, no. 3, Sept. 1988.
[15] K.P. Smith and J.W.S. Liu, "Monotonically Improving Approximate Answers to Relational Algebra Queries," Proc. Compsac, Sept. 1989.
[16] S.V. Vrbsky and J.W.S. Liu, “An Object-Oriented Query Processor that Produces Monotonically Improving Approximate Answers,” Proc. Seventh IEEE Conf. Data Eng., pp. 472-481, Apr. 1991.

Index Terms:
Databases, real-time databases, query processing, query modification, relational databases.
Citation:
Gultekin Ozsoyoglu, Sujatha Guruswamy, Kaizheng Du, Wen-Chi Hou, "Time-Constrained Query Processing in CASE-DB," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 6, pp. 865-884, Dec. 1995, doi:10.1109/69.476494
Usage of this product signifies your acceptance of the Terms of Use.