DBScholar

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
947
Venue
PODS
Year
1991
Pagerank
7.8912631e-05
Overall Rank
2,986 | 79.52%
DOI
10.1145/113413.113442

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{grumbach_pods91,
        address = {New York, NY, USA},
        series = {{PODS} '91},
        title = {{Tractable Query Languages for Complex Object Databases}},
        url = {https://dl.acm.org/doi/10.1145/113413.113442},
        doi = {10.1145/113413.113442},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Grumbach, Stphane and Vianu, Victor},
        year = {1991}
}

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