Universal Quantification in Relational Databases: A Classification of Data and Algorithms

  • Ralf Rantzau
  • Leonard Shapiro
  • Bernhard Mitschang
  • Quan Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2287)

Abstract

Queries containing universal quantification are used in many applications, including business intelligence applications. Several algorithms have been proposed to implement universal quantification efficiently. These algorithms are presented in an isolated manner in the research literature - typically, no relationships are shown between them. Furthermore, each of these algorithms claims to be superior to others, but in fact each algorithm has optimal performance only for certain types of input data. In this paper, we present a comprehensive survey of the structure and performance of algorithms for universal quantification. We introduce a framework for classifying all possible kinds of input data for universal quantification. Then we go on to identify the most efficient algorithm for each such class. One of the input data classes has not been covered so far. For this class, we propose several new algorithms. For the first time, we are able to identify the optimal algorithm to use for any given input dataset. These two classifications of input data and optimal algorithms are important for query optimization. They allow a query optimizer to make the best selection when optimizing at intermediate steps for the quantification problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 2.
    Bry, F.: Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited. SIGMOD 1989: 193–204Google Scholar
  2. 3.
    Clauβen, J., Kemper, A., Moerkotte, G., Peithner, K: Optimizing Queries with Universal Quantification in Object-Oriented and Object-Relational Databases. VLDB 1997: 286–295Google Scholar
  3. 4.
    Dayal, U.: Processing Queries with Quantifiers: A Horticultural Approach. PODS 1983: 125–136Google Scholar
  4. 5.
    Dayal, U.: Of Nests and Trees: A Unified Approach to Processing Queries that Contain Nested Subqueries, Aggregates, and Quantifiers. VLDB 1987: 197–208Google Scholar
  5. 6.
    Graefe, G.: Query Evaluation Techniques for Large Databases. ACM Computing Surveys 25(2): 73–170 (1993)CrossRefGoogle Scholar
  6. 7.
    Graefe, G., Cole, R.: Fast Algorithms for Universal Quantification in Large Databases. ACM Transactions on Database Systems 20(2): 187–236 (1995)CrossRefGoogle Scholar
  7. 8.
    Gulutzan, P., Pelzer, T.: SQL-99 Complete, Really: An Example-Based Reference Manual of the New Standard. R&D Books, Lawrence, Kansas, U.S.A., 1999Google Scholar
  8. 9.
    Hsu, P.-Y., Parker, D.: Improving SQL with Generalized Quantifiers. ICDE 1995: 298–305Google Scholar
  9. 10.
    Jarke, M., Koch, J.: Range Nesting: A Fast Method to Evaluate Quantified Queries. SIGMOD 1983: 196–206Google Scholar
  10. 11.
    Nippl, C., Rantzau, R., Mitschang, B.: StreamJoin: A Generic Database Approach to Support the Class of Stream-Oriented Applications. IDEAS 2000: 83–91Google Scholar
  11. 12.
    Rantzau, R., Shapiro, L., Mitschang, B., Wang, Q.: Universal Quantification in Relational Databases: A Classification of Data and Algorithms. Technical Report, Computer Science Department, University of Stuttgart, 2002 (to appear)Google Scholar
  12. 13.
    Rao, S., Badia, A., van Gucht, D.: Providing Better Support for a Class of Decision Support Queries. SIGMOD 1996: 217–227Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ralf Rantzau
    • 1
  • Leonard Shapiro
    • 2
  • Bernhard Mitschang
    • 1
  • Quan Wang
    • 3
  1. 1.Computer Science DepartmentUniversity of StuttgartStuttgartGermany
  2. 2.Computer Science DepartmentPortland State UniversityOregon, PortlandUSA
  3. 3.Oracle CorporationUSA

Personalised recommendations