2018
DOI: 10.1007/978-3-319-90050-6_20
|View full text |Cite
|
Sign up to set email alerts
|

A Framework for Comparing Query Languages in Their Ability to Express Boolean Queries

Abstract: For any query language F, we consider three natural families of boolean queries. Nonemptiness queries are expressed as e = ∅ with e an F expression. Emptiness queries are expressed as e = ∅. Containment queries are expressed as e 1 ⊆ 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 30 publications
0
2
0
Order By: Relevance
“…This article extends the conference paper [28] by providing full proofs, many of which were missing from the conference paper.…”
Section: Introductionmentioning
confidence: 91%
See 1 more Smart Citation
“…This article extends the conference paper [28] by providing full proofs, many of which were missing from the conference paper.…”
Section: Introductionmentioning
confidence: 91%
“…Some of our results can be refined to fragments containing just one of the two projections or coprojections, but for others this remains a technical open problem[25].…”
mentioning
confidence: 99%