Database Paper Browser

Back to papers

Querying Constraints

Summary: Querying system treating sets of linear arithmetic constraints as first-class query objects, blending logic-programming inference and symbolic computation with linear-programming and computational-geometry algorithms. Covers negation, canonical representations and their generalization to term algebras and affine geometry. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
909
Venue
PODS
Year
1990
Pagerank
0.00015892437
Overall Rank
856 | 94.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers