Efficient implementation of generalized quantification in relational query languages

Abstract

We present research aimed at improving our understanding of the use and implementation of quantification in relational query languages in general and SQL in particular. In order to make our results as general as possible, we use the framework of Generalized Quantification. Generalized Quantifiers (GQs) are high-level, declarative logical operators that in the past have been studied from a theoretical perspective. In this paper we focus on their practical use, showing how to incorporate a dynamic set of GQs in relational query languages, how to implement them efficiently and use them in the context of SQL. We present experimental evidence of the performance of the approach, showing that it improves over traditional (relational) approaches.

Generalization effect of quantifiers in a classification based on relational concept analysis

“…Our definitions on generalization of scaling operators follow the idea of the one used for hypotheses in ILP [1] and the one used for concepts in FCA. A set of quantifiers similar to the one of RCA has been introduced a long time ago in logic and linguistics as generalized quantifiers, and are studied in the field of databases to extend SQL [60].…”