DBScholar

Back to papers

CONSTRAINT QUERY LANGUAGES (preliminary report)

Summary: Constraint Query Language (CQL): combines bottom-up declarative query evaluation with efficient constraint solving by treating generalized tuples as conjunctions of constraints. Describes CQL design and examples across polynomial, rational-order, equality, and boolean constraint classes. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
909
Venue
PODS
Year
1990
Pagerank
5.6282573e-05
Overall Rank
7,384 | 49.34%
DOI
10.1145/298514.298582

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kanellakis_pods90,
        address = {New York, NY, USA},
        series = {{PODS} '90},
        title = {{CONSTRAINT QUERY LANGUAGES (preliminary report)}},
        url = {https://dl.acm.org/doi/10.1145/298514.298582},
        doi = {10.1145/298514.298582},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kanellakis, Paris C. and Kuper, Gabriel M. and Revesz, Peter Z.},
        year = {1990}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,111 The Well-Founded Semantics of Aggregation (Extended Abstract) 1992 PODS 6.3602348e-05
8,115 Scaling a Declarative Cluster Manager Architecture with Query Optimization Techniques 2023 VLDB 5.4842672e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
702 PROCEDURAL AND DECLARATIVE DATABASE UPDATE LANGUAGES (Extended Abstract) 1988 PODS 0.00014855299
989 Why Not Negation By Fixpoint? 1988 PODS 0.00012804792
4,235 Relational Specifications of Infinite Query Answers 1989 SIGMOD 6.8167527e-05
Previous Page 1 / 1 Next

Semantically Similar Papers