Database Paper Browser

Back to papers

Fixed-Point Query Languages for Linear Constraint Databases

Summary: Defines a family of query languages for linear-constraint databases over the reals using two-sorted structures that separate real values from a decomposition into regions. Fixed-point/transitive-closure operators restricted to regions precisely capture standard complexity classes including PTIME. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1201
Venue
PODS
Year
2000
Pagerank
4.1945683e-05
Overall Rank
12,682 | 11.78%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

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

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers