Database Paper Browser

Back to papers

Tractable Query Languages for Complex Object Databases

Summary: Analyzes calculus-based queries on complex-object databases, proving that usage of higher-order types crucially affects query complexity. Shows fixpoint extensions (with range-restricted variants) capture PTIME under a “full-types” assumption, yielding tractable query languages. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
948
Venue
PODS
Year
1991
Pagerank
7.6707607e-05
Overall Rank
3,040 | 78.86%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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