Database Paper Browser

Back to papers

Rewriting of Rules Containing Set Terms in a Logic Data Language (LDL)

Summary: Compile-time rewriting of LDL rules with set terms into ordinary Horn clauses, avoiding general-purpose set matching and its n-times-exponential blowup by exploiting rule-specific information to prune alternatives. Produces specialized execution plans with much lower runtime and modest compilation overhead amortizable across many runs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
812
Venue
PODS
Year
1988
Pagerank
5.7789317e-05
Overall Rank
4,986 | 65.35%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
1,796 A Logic for Object-Oriented Logic Programming (Maier's O-Logic Revisited) 1989 PODS 0.00010505292
3,739 Towards a Real Horn Clause Language 1988 VLDB 6.7979486e-05
12,899 Implementing Deductive Databases by Linear Programming 1992 PODS 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
485 A New Approach to Database Logic 1984 PODS 0.00022061287
520 LDL: A Logic-Based Data-Language 1986 VLDB 0.00021145923
910 Sets and Negation in a Logic Database Language (LDL1) 1987 PODS 0.00015398775
Previous Page 1 / 1 Next

Semantically Similar Papers