Abstract
In this paper, we present a top-down but set-oriented method for handling recursive queries. Based on the RQA/FQI's mechanism for recording “path information” [14], we try to eliminate many of the expansion operations that have to be done by any other top-down strategy. Further, we speed up the evaluation for cyclic data by generating most answers to a query directly from the intermediate results and the relevant path information instead of evaluating them by performing algebraic operations. In this way, high efficiency can be achieved. On one hand, the search space becomes smaller in our method. On the other hand, the cost of generating an answer is much less than that of evaluating an answer by algebraic operations or by other standard methods.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aly, H. and Ozsoyoglu, Z. M., Synchronized Counting Method, Proc. of the 5th International Conf. on Data Engineering, Los Angeles, 1989.
I. Balbin, G. S. Port, K. Ramamohanarao and K. Meenakshi, Efficient Bottom-up Computation of Queries on Stratified Databases, J. Logic Programming, November 1991, 295–344
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, Naive Evaluation of Recursively Defined Relations, in: On Knowledge Base Management Systems-Integrating Database and AI Systems, Springer-Verlag, 1985.
F. Bancihon 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.
S. Ceri, G. Gottlob and L. Tanca, Logic Programming and Databases, Springer-Verlag, Berlin,1990
C. Chang, On the Evaluation of Queries Containing Derived Relations in Relational Database, in: Advances in Data Base Theory, Vol. 1, Plenum, 1981.
Y. Chen and T. Härder, An Optimal Top-down Evaluation Algorithm for Recursive Queries, ZRI-Report, University of Kaiserslautern, Germany, 1994.
R. W. Haddad and J. F. Naughton, Counting Method for Cyclic Relations, in: Proceedings of the 7th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, 1986, pp. 16–23.
J. Han, Chain-Based Evaluation — A Bridge Linking Recursive and Nonrecursive Query Evaluation, Proc. 2th Int. Workshop on Research Issues on Data Engineering: Transaction and Query Processing, Los Alamitos, CA, February 1992, 132–139.
L. J. Henschen and S. Naqvi, On Compiling Queries in Recursive First-Order database, J. ACM, 31(1), 1984, 47–85.
M. Kifer and Lozinskii E.L., Filtering Data Flow in Deductive Database, Proc. 1st International Conf. on Database Theory, Roma, September 1986.
A. Marchetti-Spaccamela, A. Pelaggi, and D. Sacca, Comparison of Methods for Logic-query Implementation, J. Logic Programming, 1991:10:333–360.
W. Nejdl, Recursive Strategies for Answering Recursive Queries — The RQA/FQI Strategy, Proc. 13th VLDB Conf. Brighton 1987, 43–50.
S. Shapiro and D. Mckay, Inference with Recursive Rules, in: Proceedings of the 1th Annual National Conference on Artificial Intelligence, 1980.
J. D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. 2, Computer Science Press, Rockville, MD, 1989.
L. Vieille, Recursive Axioms in Deductive Databases: the Query-Subquery Approach, Proc. First Int. Conf. on Expert Database System, L.Kerschberg ed., Charleston, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y., Härder, T. (1994). On the optimal top-down evaluation of recursive queries. In: Karagiannis, D. (eds) Database and Expert Systems Applications. DEXA 1994. Lecture Notes in Computer Science, vol 856. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58435-8_170
Download citation
DOI: https://doi.org/10.1007/3-540-58435-8_170
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58435-3
Online ISBN: 978-3-540-48796-8
eBook Packages: Springer Book Archive