Abstract
List functions occur frequently in deductive database applications. We study efficient evaluation of linear recursions with list functions in deductive databases. Since most linear recursions can be compiled into chain forms, a chain-based query evaluation method is developed, which selects an efficient query evaluation algorithm based on the analysis of compiled forms and finiteness, termination and query constraints. Interesting techniques, such as chain-split, existence checking and constraint-based evaluation, are developed to improve the performance. Moreover, chain-based evaluation can be generalized to the complex recursions compilable to chain forms.
The work was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant A-3723 and a research grant from Centre for Systems 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.
D. Chimenti, R. Gamboa, R. Krishnamurthy, S. Naqvi, S. Tsur and C. Zaniolo, The LDL System Prototype, IEEE Trans. Knowledge and Data Engineering, 2(1), 1990, 76–90.
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 and W. Lu, Asynchronous Chain Recursions, IEEE Trans. Knowledge and Data Engineering, 1(2), 1989, 185–195.
J. Han and Q. Wang, Evaluation of Functional Linear Recursions: A Compilation Approach, Information Systems, 16(4), 1991, 463–469.
J. Han, Constraint-Based Reasoning in Deductive Databases, Proc. 7th Int. Conf. Data Engineering, Kobe, Japan, April 1991, 257–265.
L. J. Henschen and S. Naqvi, On Compiling Queries in Recursive First-Order Databases, J. ACM, 31(1), 1984, 47–85.
T. Imielinski, Intelligent Query Answering in Rule Based Systems, Journal of Logic Programming, 4, 1987, 229–257.
J. Jaffar and J. Lassez, Constraint Logic Programming, Proc. 14th ACM Symp. Principles of Programming Languages, Munich, 1987, 111–119.
B. Jiang, A Suitable Algorithm for Computing Partial Transitive Closures, Proc. 6th Int. Conf. Data Engineering, Los Angeles, CA, February 1990, 264–271.
D. B. Kemp, K. Ramamohanarao, I. Balbin and K. Meenakshi, Propagating Constraints in Recursive Deductive Databases, Proc. 1989 North American Conf. Logic Programming, Cleveland, OH, October 1989, 981–998.
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.
R. Krishnamurthy and C. Zaniolo, Optimization in a Logic Based Language for Knowledge and Data Intensive Applications, Proc. Int. Conf. of Extending Database Technology (EDBT 88), Venice, Italy, March 1988, 16–33.
M. J. Maher and P. J. Stuckey, Expanding Query Power in Constraint Logic Programming Languages, Proc. 1989 North American Conf. Logic Programming, Cleveland, OH, October 1989, 20–36.
J. F. Naughton, R. Ramakrishnan, Y. Sagiv and J. D. Ullman, Efficient Evaluation of Right-, Left-, and Multi-Linear Rules, Proc. 1989 ACM-SIGMOD Conf. Management of Data, Portland, Oregon, June 1989, 235–242.
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, Vol. 2, Computer Science Press, Rockville, MD, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, J. (1992). Compilation-based list processing in deductive databases. In: Pirotte, A., Delobel, C., Gottlob, G. (eds) Advances in Database Technology — EDBT '92. EDBT 1992. Lecture Notes in Computer Science, vol 580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032426
Download citation
DOI: https://doi.org/10.1007/BFb0032426
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55270-3
Online ISBN: 978-3-540-47003-8
eBook Packages: Springer Book Archive