| Processing Queries Containing Generalized Quantifiers (1995) | |||||||||||||||
Abstract | |||||||||||||||
| We considered the problem of processing queries that contain generalized quantifiers. We demonstrate that current relational systems are ill-equipped, both at the language and at the query processing level, to deal with such queries. We propose a boolean matrix approach which establishes the feasibility of building systems that can process queries with generalized quantifiers efficiently, and we provide insights into the intrinsic difficulties associated with processing such queries. 1 Introduction Numerous existing query languages (SQL [25], OQL [6], CORAL [24], RC/S [23] etc.) allow queries with embedded sub-queries as well as sub-query comparison statements. 1 It is often argued that these features enhance the declarativeness of the query language. In two recent papers, Hsu and Parker [17] and, independently, Badia, Van Gucht, and Gyssens [2], validated this argument by establishing a link between the phenomenon of sub-query syntax in query languages and the theory of generaliz... | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||