@inproceedings{49f35eefd0db4a9294afbe65f9dcd35f,
title = "Classification of recursive formulas in deductive databases",
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.",
author = "Cheong Youn and Henschen, {Lawrence J.} and Jiawei Han",
note = "Publisher Copyright: {\textcopyright} 1988 ACM.; ACM SIGMOD International Conference on Management of Data, SIGMOD 1988 ; Conference date: 01-06-1988 Through 03-06-1988",
year = "1988",
month = jun,
day = "1",
doi = "10.1145/50202.50241",
language = "English (US)",
series = "Proceedings of the ACM SIGMOD International Conference on Management of Data",
publisher = "Association for Computing Machinery",
pages = "320--328",
editor = "Haran Boral and Per-Ake Larson",
booktitle = "Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, SIGMOD 1988",
address = "United States",
}