skip to main content
article
Free Access

Processing aggregate relational queries with hard time constraints

Published:01 June 1989Publication History
Skip Abstract Section

Abstract

We consider those database environments in which queries have strict timing constraints, and develop a time-constrained query evaluation methodology. For aggregate relational algebra queries, we describe a time constrained query evaluation algorithm. The algorithm, which is implemented in our prototype DBMS, iteratively samples from input relations, and evaluates the associated estimators developed in our previous work, until a stopping criterion (e.g., a time quota or a desired error range) is satisfied.

To determine sample sizes at each stage of the iteration (so that the time quota will not be overspent) we need to have (a) accurate sample selectivity estimations of the RA operators in the query, (b) precise time cost formulas, and (c) good time-control strategies. To estimate the sample selectivities of RA operators, we use a runtime sample selectivity estimation and improvement approach which is flexible. For query time estimations, we use time-cost formulas which are adaptive and precise. To use the time quota efficiently, we propose statistical and heuristic time-control strategies to control the risk of overspending the time quota. Preliminary evaluation of the implemented prototype is also presented.

References

  1. AbGM 88 Abbott, R., and Garcia-Molina, H., "Scheduling Realtime Transactions", Proc., VLDB 1988 (Also in ACM SIGMOD RECORD, 1988). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Coch 77 Cochran, W.G., "Sampling Techniques", Third Ed. John Wiley & Sons, 1977.Google ScholarGoogle Scholar
  3. Chri 83 Christodoulakis, S., "Estimating Record Selectivities", Information Systems, Vol 8, 1983.Google ScholarGoogle Scholar
  4. DFHO 86 Datta, A., Foumier, B., Hou, W-C., and Ozsoyoglu, G., "The Implementation of SSDB", Proc. 3rd SSDB workshop, I~xernbourg, July 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Good 49 Goodman, L A., "On the Estimation of the Number of Classes in a Population", Ann. Math. Star., Vol. 20, 1949.Google ScholarGoogle ScholarCross RefCross Ref
  6. HoOT 88 Hou, W-C., Ozsoyoglu, G., Taneja, B., "Statistical Estimators for Relational Algebra Expressions", ACM PODS Confer~mce, March 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. HoOT 88a Hou, W-C., Ozsoyoglu, G., Taneja, B., "Processing Aggregate Relational Queries with Hard Time Constraints", CWRU Tech. Rep. CES-88-26, Dec. 1988.Google ScholarGoogle Scholar
  8. HouO 88 Hou, W-C. Ozsoyoglu, G., "StatisLical Estimators for Aggregate Relational Algebra Expressions", May 1988.Google ScholarGoogle Scholar
  9. JoWi 82 Johnson, R., and Wichem, D., "Applied Multivariate Statistical Analysis", Prentice Hall 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Liu 68 Liu, C.L, "Introduction to Cornbinatodal Mathematics", McGraw-Hill, 1968.Google ScholarGoogle Scholar
  11. MuDe 88 MuralJkrishna, M. and Dewitt, D., "Equidepth histograms for estimating selectivity factors for multidimensional queries", ACM SIGMOD 1988.Google ScholarGoogle Scholar
  12. PSCo 84 Piatetsky-Shapiro, G. and CormeIl, G., "Accurate Estimation of the number of tuples satisfying a condition", ACM SIGMOD conference, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. OzHO 88 Ozsoyoglu, G., Hou, W-C., Ola, A., "On Database Systems for Programming Logic Controllers", 1988.Google ScholarGoogle Scholar
  14. Rowe 85 Rowe, N. C., "Antisampling for Estimation : An overview", IEEE TSE Oct. 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. SACL 79 Sellinger,P., Astrahan, M., Chambedein, D., Lorie,R., Price, T., "Access path selection in a relational database management system", ACM SIGMOD 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Processing aggregate relational queries with hard time constraints

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image ACM SIGMOD Record
              ACM SIGMOD Record  Volume 18, Issue 2
              June 1989
              442 pages
              • cover image ACM Conferences
                SIGMOD '89: Proceedings of the 1989 ACM SIGMOD international conference on Management of data
                June 1989
                451 pages
                ISBN:0897913175
                DOI:10.1145/67544

              Copyright © 1989 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 June 1989

              Check for updates

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader