Automatic generation of compiled forms for linear recursions

Jiawei Han, Kangsheng Zeng

Research output: Contribution to journalArticlepeer-review


This article presents a graph-matrix expansion-based compilation technique which compiles complex linear recursions into highly regular compiled forms. The technique uses a variable connection graph-matrix, the V-matrix, to simulate recursion expansions and discover the expansion regularity of complex linear recursions. Our study shows that linear recursions can be compiled into highly regular compiled forms by the V-matrix expansion technique and such compiled forms can be generated automatically. The compilation of linear recursions into compiled forms not only captures the bindings which are difficult to capture otherwise but also facilitates the development of powerful query analysis and evaluation techniques for complex linear recursions in deductive databases.

Original languageEnglish (US)
Pages (from-to)299-322
Number of pages24
JournalInformation Systems
Issue number4
StatePublished - Jul 1992
Externally publishedYes


  • Deductive databases
  • compilation techniques
  • linear recursions
  • recursive query evaluation

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture


Dive into the research topics of 'Automatic generation of compiled forms for linear recursions'. Together they form a unique fingerprint.

Cite this