Bounded Arity Datalog(!=) Queries on Graphs (Extended Abstract)
Summary: Establishes lower bounds on the width (arity) of recursively defined predicates in Datalog(!=) even when the extensional DB is a single binary relation (graphs): there exist queries requiring arbitrarily large width. In particular, any fixed subgraph homeomorphism query needs width ≥ number of arcs in the pattern graph. (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
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 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 77 | An Amateur's Introduction to Recursive Query Processing Strategies | 1986 | SIGMOD | 0.00057043861 |
| 172 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS | 0.00038808816 |
| 909 | On the Equivalence of Recursive and Nonrecursive Datalog Programs | 1992 | PODS | 0.00015428222 |
| 1,712 | Bounds on the Propagation of Selection into Logic Programs | 1987 | PODS | 0.00010804573 |
| 1,991 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.84713e-05 |
| 3,888 | On the Expressive Power of Datalog: Tools and a Case Study | 1990 | PODS | 6.6634475e-05 |
| 6,031 | On Datalog vs. Polynomial Time | 1991 | PODS | 5.2415551e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,326 | Data Path Queries over Embedded Graph Databases | 2022 | PODS | 4.1945683e-05 |
| 8,937 | Efficiently Ordering Subgoals with Access Constraints [Extended Abstract] | 2006 | PODS | 4.427232e-05 |
| 6,896 | Containment of Graph Queries Modulo Schema | 2024 | PODS | 4.8925595e-05 |
| 14,223 | Expressibility of Bounded-Arity Fixed-Point Query Hierarchies | 1989 | PODS | - |
| 3,853 | Relational Specifications of Infinite Query Answers | 1989 | SIGMOD | 6.7004022e-05 |
| 7,070 | On the Decidability of Containment of Recursive Datalog Queries - Preliminary report | 2004 | PODS | 4.843579e-05 |
| 1,490 | On the Decidability of Query Containment under Constraints | 1998 | PODS | 0.00011699154 |
| 6,236 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1436959e-05 |
| 4,631 | Tools for Datalog Boundedness | 1991 | PODS | 6.0347472e-05 |
| 7,591 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.702934e-05 |