A framework for comparing query languages in their ability to express boolean queries

For any query language F, we consider three natural families of boolean queries. Nonemptiness queries are expressed as e not equal empty set with e an F expression. Emptiness queries are expressed as e = empty set. Containment queries are expressed as e(1) subset of e(2). We refer to syntactic constructions of boolean queries as modalities. In first order logic, the emptiness, nonemptiness and containment modalities have exactly the same expressive power. For other classes of queries, e.g., expressed in weaker query languages, the modalities may differ in expressiveness. We propose a framework for studying the expressive power of boolean query modalities. Along one dimension, one may work within a fixed query language and compare the three modalities. Here, we identify crucial query features that enable us to go from one modality to another. Furthermore, we identify semantical properties that reflect the lack of these query features to establish separations. Along a second dimension, one may fix a modality and compare different query languages. This second dimension is the one that has already received quite some attention in the literature, whereas in this paper we emphasize the first dimension. Combining both dimensions, it is interesting to compare the expressive power of a weak query language using a strong modality, against that of a seemingly stronger query language but perhaps using a weaker modality. We present some initial results within this theme. The two main query languages to which we apply our framework are the algebra of binary relations, and the language of conjunctive queries.

Jaar van publicatie:2019

Trefwoorden:Query languages, Expressive power, Graph databases, Conjunctive queries, Boolean query modalities

BOF-keylabel:ja

IOF-keylabel:ja

BOF-publication weight:0.5

CSS-citation score:1

Auteurs:International

Authors from:Higher Education

Toegankelijkheid:Open