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.
The work was supported by the Natural Sciences and Engineering Research Council (NSERC) of Canada under operating grant A-3723 and a research grant from Centre for System Science of Simon Fraser University.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Bancilhon, D. Maier, Y. Sagiv and J. D. Ullman, Magic Sets and Other Strange Ways to Implement Logic Programs, Proc. 5th ACM Symp. Principles of Database Systems, Cambridge, MA, March 1986, 1–15.
F. Bancilhon and R. Ramakrishnan, An Amateur's Introduction to Recursive Query Processing Strategies, Proc. 1986 ACM-SIGMOD Conf. Management of Data, Washington, DC, May 1986, 16–52.
C. Beeri and R. Ramakrishnan, On the Power of Magic, Proc. 6th ACM Symp. Principles of Database Systems, San Diego, CA, March 1987, 269–283.
A. Brodsky and Y. Sagiv, On Termination of Datalog Programs, Proc. 1st Int. Conf. Deductive and Object-Oriented Databases (DOOD'89), Kyoto, Japan, December 1989, 95–112.
J. Han, Multi-Way Counting Method, Information Systems, 14(3), 1989, 219–229.
J. Han, Compiling General Linear Recursions by Variable Connection Graph Analysis, Computational Intelligence, 5(1), 1989, 12–31.
J. Han, Constraint-Based Reasoning in Deductive Databases, Proc. 7th Int. Conf. Data Engineering, Kobe, Japan, April 1991, 257–265.
R. Krishnamurthy, R. Ramakrishnan and O. Shmueli, A Framework for Testing Safety and Effective Computability of Extended Datalog, Proc. 1988 ACM-SIGMOD Conf. Management of Data, Chicago, IL, June 1988, 154–163.
D. Maier and D. S. Warren, Computing with Logic: Logic Programming with Prolog, Benjamin/Cummings, 1988.
R. Ramakrishnan, F. Bancilhon and A. Silberschatz, Safety of Recursive Horn Clauses with Infinite Relations, Proc. 6th ACM Symp. Principles of Database Systems, San Diego, CA, March 1987, 328–339.
A. Rosenthal, S. Heiler, U. Dayal and F. Manola, Traversal Recursion: A Practical Approach to Supporting Recursive Applications, Proc. 1986 ACM-SIGMOD Conf. Management of Data, Washington, DC, May 1986, 166–176.
Y. Sagiv and M. Vardi, Safety of Datalog Queries over Infinite Databases, Proc. 8th ACM Symp. Principles of Database Systems, Philadelphia, PA, March 1989, 160–171.
L. Sterling and E. Shapiro, The Art of Prolog, The MIT Press, 1986.
J. D. Ullman, Principles of Database and Knowledge-Base Systems, Vols. 1 & 2, Computer Science Press, Rockville, MD, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, J., Wang, Q. (1991). Efficient evaluation of linear recursions with function symbols in deductive databases. In: Ras, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1991. Lecture Notes in Computer Science, vol 542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54563-8_77
Download citation
DOI: https://doi.org/10.1007/3-540-54563-8_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54563-7
Online ISBN: 978-3-540-38466-3
eBook Packages: Springer Book Archive