An Extended Disjunctive Normal Form Approach For Optimizing Recursive Logic Queries In Loosely Coupled Environments
Summary: Proposes Extended Disjunctive Normal Form (EDNF) to optimize recursive logic queries in loosely coupled environments. EDNF generalizes DNF with recursion, leveraging existing DBMS optimizers and extending negation-as-failure with safety/termination criteria for practical inference. (summarized by gpt-5-nano 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 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.0010066783 |
| 63 | A Message Passing Framework for Logical Query Evaluation | 1986 | SIGMOD | 0.00063714145 |
| 77 | An Amateur's Introduction to Recursive Query Processing Strategies | 1986 | SIGMOD | 0.00057043861 |
| 154 | An Optimizing Prolog Front-End to a Relational Query System | 1984 | SIGMOD | 0.00040645847 |
| 1,055 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014422575 |
| 8,335 | Negation as Failure for First-Order Queries (Extended Abstract) | 1986 | PODS | 4.5435639e-05 |
Previous
Page 1 / 1
Next