Expressibility of Bounded-Arity Fixed-Point Query Hierarchies
Summary: Proves strict bounded-arity hierarchies for FO with fixed-point operators: allowing predicate-variables of arity k+1 strictly increases the set of definable k-ary queries versus arity k. Also separates operators at each arity: k-ary IFP > LFP and k-ary GFP > IFP. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Pratul Dubhashi (Indian Institute of Technology Kanpur)
- 2. S. N. Maheshwari (Indian Institute of Technology Delhi)
BibTeX Citation
@inproceedings{dubhashi_pods89,
address = {New York, NY, USA},
series = {{PODS} '89},
title = {{Expressibility of Bounded-Arity Fixed-Point Query Hierarchies}},
url = {https://dl.acm.org/doi/10.1145/73721.73753},
doi = {10.1145/73721.73753},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Dubhashi, Pratul and Maheshwari, S. N.},
year = {1989}
}
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 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,634 | Translation and Optimization of Logic Queries: The Algebraic Approach | 1986 | VLDB |
| 2 | 2,986 | Tractable Query Languages for Complex Object Databases | 1991 | PODS |
| 3 | 174 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS |
| 4 | 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 5 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 6 | 8,141 | First-Order Query Evaluation with Cardinality Conditions | 2018 | PODS |
| 7 | 7,972 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS |
| 8 | 11,838 | Compiling Existential-Positive Queries to Bounded-Variable Fragments | 2019 | PODS |
| 9 | 13,020 | Bounded Arity Datalog(!=) Queries on Graphs (Extended Abstract) | 1994 | PODS |
| 10 | 12,627 | Non-Linear Prefixes in Query Languages | 2007 | PODS |