DBScholar

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
1200
Venue
PODS
Year
2000
Pagerank
5.093636e-05
Overall Rank
12,875 | 11.67%
DOI
10.1145/335168.335214

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{kreutzer_pods00,
        address = {New York, NY, USA},
        series = {{PODS} '00},
        title = {{Fixed-Point Query Languages for Linear Constraint Databases}},
        url = {https://dl.acm.org/doi/10.1145/335168.335214},
        doi = {10.1145/335168.335214},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kreutzer, Stephan},
        year = {2000}
}

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