Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 1,184

The DOI matches its Crossref record.

The complexity of relational query languages (Extended Abstract)

Vardi, Moshe Y.·1982·Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82
DOI 10.1145/800070.802186
Open this paper in CoChat — free account

Abstract

Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the language as a function of the size of the database, and expression complexity is the complexity of ewduating a query in the language as a function of the size of the expression defining the query. We study the data and expression complexity of logical langnages- relational calculus and its extensions by transitive closure, fixpoint and second order existential quantification- and algebraic languages- relational algebra and its extensions by bounded and unbounded looping. The pattern which will bc shown is that the expression complexity of the investi-gated languages is one exponential higher then their data complexity, and for both types of complexity we show completeness in some complexity class. Research supported by a Weizrnann Post-doctoral Fellowship,

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/800070.802186

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 1,184

Metadata

Authors
Vardi, M. Y.
Venue
Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82
Publisher
ACM Press
Published
1982
Pages
137-146
DOI
10.1145/800070.802186
OpenAlex
W1989783863
Cited by
1,184
References
0
FWCI
9.22
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The complexity of relational query languages (Extended Abstract). https://app.cochat.ai/papers/10.1145/800070.802186
The paper
Vardi, M. Y. (1982). The complexity of relational query languages (Extended Abstract). Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. https://doi.org/10.1145/800070.802186

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.