TY - GEN
T1 - Optimizing queries with universal quantification in object-oriented and object-relational databases
AU - Clawsen, J.
AU - Kemper, A.
AU - Moerkotte, G.
AU - Peithner, K.
PY - 1997
Y1 - 1997
N2 - We investigate the optimization and evaluation of queries with universal quantification in the context of the object-oriented and object-relational data models. The queries are classified into 16 categories depending on the variables referenced in the so-called range and quantifier predicates. For the three most important classes we enumerate the known query evaluation plans and devise some new ones. These alternative plans are primarily based on anti-semijoin, division, generalized grouping with count aggregation, and set difference. In order to evaluate the quality of the many different evaluation plans a thorough performance analysis on some sample database configurations was carried out. The quantitative analysis reveals that-if applicable-the anti-semijoinbased plans are superior to all the other alternatives, even if we employ the most sophisticated division algorithms. Furthermore, exploiting object-oriented features, anti-semijoin plans can be derived even when this is not possible in the relational context.
AB - We investigate the optimization and evaluation of queries with universal quantification in the context of the object-oriented and object-relational data models. The queries are classified into 16 categories depending on the variables referenced in the so-called range and quantifier predicates. For the three most important classes we enumerate the known query evaluation plans and devise some new ones. These alternative plans are primarily based on anti-semijoin, division, generalized grouping with count aggregation, and set difference. In order to evaluate the quality of the many different evaluation plans a thorough performance analysis on some sample database configurations was carried out. The quantitative analysis reveals that-if applicable-the anti-semijoinbased plans are superior to all the other alternatives, even if we employ the most sophisticated division algorithms. Furthermore, exploiting object-oriented features, anti-semijoin plans can be derived even when this is not possible in the relational context.
UR - https://www.scopus.com/pages/publications/84994108595
M3 - Conference contribution
AN - SCOPUS:84994108595
T3 - Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997
SP - 286
EP - 295
BT - Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997
A2 - Lochovsky, Fred
A2 - Carey, Michael J.
A2 - Jarke, Matthias
A2 - Dittrich, Klaus R.
A2 - Loucopoulos, Pericles
A2 - Jeusfeld, Manfred A.
PB - Morgan Kaufmann
T2 - 23rd International Conference on Very Large Databases, VLDB 1997
Y2 - 26 August 1997 through 29 August 1997
ER -