Rewriting of rules containing set terms in a logic data language LDL

  • Authors:

  • Oded Shmueli;Shalom Tsur;Carlo Zaniolo

  • Affiliations:

  • Department of Computer Science, Technion, Haifa, Israel 32000 and MCC, Austin, Texas;MCC, Austin, Texas;MCC, Austin, Texas

  • Venue:
  • Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose compilation methods for supporting set terms in Horn clause programs, without using general-purpose set matching algorithms, which tend to run in times exponential in the size of the participating sets Instead, we take the approach of formulating specialized computation plans that, by taking advantage of information available in the given rules, limit the number of alternatives explored. Our strategy is to employ compile time rewriting techniques and to transform the problem into an “ordinary” Horn clause compilation problem, with minimal additional overhead. The execution cost of the rewritten rules is substantially lower than that of the original rules and the additional cost of compilation can thus be amortized over many executions