Optimization using tuple subsumption

  • Venky Harinarayan
  • Ashish Gupta
Contributed Papers Constraints and Dependencies
Part of the Lecture Notes in Computer Science book series (LNCS, volume 893)

Abstract

A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple t2. Therefore, the subsumed tuple t2 can be ignored with respect to Q in the presence of tuple t1 in relation R. This property finds use in a large number of problems. For instance: during query optimization subsumed tuples can be ignored thereby avoiding the computation of redundant answers; the size of cached information in distributed and object oriented systems can be reduced by omitting subsumed tuples; constraints need not be checked and rules need not be recomputed when provably subsumed updates are made. We give algorithms for deciding efficiently when a tuple subsumes another tuple for queries that use arbitrary mathematical functions. We characterize queries for which, whenever a set of tuples T subsumes a tuple t then one of the tuples in T also subsumed t, yielding efficiently verifiable cases of subsumption.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CS94]
    Surajit Chaudhuri and Kyuseok Shim. Including Group-By in Query Optimization. To appear in Proceedings of the Twentieth International Conference on Very Large Databases (VLDB), 1994.Google Scholar
  2. [GSUW94]
    Ashish Gupta, Shuky Sagiv, Jeffrey D. Ullman, and Jennifer Widom. Constraint Checking with Partial Information. In Proceedings of the Thirteenth Symposium on Principles of Database Systems (PODS), 1994.Google Scholar
  3. [GW93]
    Ashish Gupta and Jennifer Widom. Local Checking of Global Integrity Constraints. In Proceedings of ACM SIGMOD 1993 International Conference on Management of Data, pages 49–59.Google Scholar
  4. [LS93]
    A.Y. Levy and Y. Sagiv. Queries independent of updates. In Proceedings of the Nineteenth International Conference on Very Large Data Bases, pages 171–181, Dublin, Ireland, August 1993.Google Scholar
  5. [TH93]
    Sanjai Tiwari and H. C. Howard. Constraint Management on Distributed AEC Databases. In Fifth International Conference on Computing in Civil and Building Engineering, pages 1147–1154. ASCE, 1993.Google Scholar
  6. [U1189]
    J. D. Ullman. Principles of Database and Knowledge-Base Systems, volume 2. Computer Science Press, New York, 1989.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Venky Harinarayan
    • 1
  • Ashish Gupta
    • 2
    • 3
  1. 1.Department of Computer ScienceStanford UniversityCA
  2. 2.Department of Computer ScienceStanford
  3. 3.IBM Almaden Research CenterUSA

Personalised recommendations