Efficient evaluation of linear recursions with function symbols in deductive databases

Jiawei Han, Qiang Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study the compilation and efficient evaluation of functional linear recursions in deductive databases and develop a compiled chain-based query evaluation technique. A functional linear recursion is transformed to a function-free one by a function-predicate transformation. It is then compiled to a highly regular chain/bounded form which can be evaluated efficiently by the incorporation of finiteness, monotonicity and query constraints. Compilation greatly facilitates the analysis of functional recursions.

Original languageEnglish (US)
Title of host publicationMethodologies for Intelligent Systems - 6th International Symposium, ISMIS 1991, Proceedings
EditorsZbigniew W. Ras, Maria Zemankova
PublisherSpringer
Pages132-141
Number of pages10
ISBN (Print)9783540545637
DOIs
StatePublished - 1991
Externally publishedYes
Event6th International Symposium on Methodologies for Intelligent Systems, ISMIS 1991 - Charlotte , United States
Duration: Oct 16 1991Oct 19 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume542 LNAI Part F2
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Symposium on Methodologies for Intelligent Systems, ISMIS 1991
Country/TerritoryUnited States
CityCharlotte
Period10/16/9110/19/91

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Efficient evaluation of linear recursions with function symbols in deductive databases'. Together they form a unique fingerprint.

Cite this