Classification of recursive formulas in deductive databases

Cheong Youn, Lawrence Joseph Henschen, Jiawei Han

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

10 Scopus citations

Abstract

In this paper, we present results on the classification of linear recursive formulas in deductive databases and apply those results to the compilation and optimization of recursive queries. We also introduce compiled formulas and query evaluation plans for a representative query for each of these classes. To explain general recursive formulas, we use a graph model that shows the connectivity between variables. The connectivity between variables is the most critical part in processing recursive formulas. We demonstrate that based on such a graph model all the linear recursive formulas can be classified into several classes and each class shares some common characteristics in compilation and query processing. The compiled formulas and the corresponding query evaluation plans can be derived based on the study of the compilation of each class.

Original languageEnglish (US)
Title of host publicationProceedings of the 1988 ACM SIGMOD International Conference on Management of Data, SIGMOD 1988
EditorsHaran Boral, Per-Ake Larson
PublisherAssociation for Computing Machinery
Pages320-328
Number of pages9
ISBN (Electronic)0897912683
DOIs
StatePublished - Jun 1 1988
EventACM SIGMOD International Conference on Management of Data, SIGMOD 1988 - Chicago, United States
Duration: Jun 1 1988Jun 3 1988

Publication series

NameProceedings of the ACM SIGMOD International Conference on Management of Data
Volume1988-June
ISSN (Print)0730-8078

Other

OtherACM SIGMOD International Conference on Management of Data, SIGMOD 1988
CountryUnited States
CityChicago
Period6/1/886/3/88

ASJC Scopus subject areas

  • Software
  • Information Systems

Fingerprint Dive into the research topics of 'Classification of recursive formulas in deductive databases'. Together they form a unique fingerprint.

Cite this