Abstract
A useful strategy for integrating AI and DB technology is coupling PROLOG with a relational database management system (RDBMS). One of the main difficulties of this approach is the evaluation of recursively defined queries. We will therefore give a short overview of the different possibilities for such strategies. Then we describe the RQA/FQI Strategy which is complete over the domain of function-free Horn clauses and uses a two step architecture for evaluating a recursive query. We further compare our strategy to other query processing strategies and also discuss related concepts from the area of theorem proving.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Bancilhon, R. Ramakrishnan: An Amateur’s Introduction to Recursive Query Processing Strategies, Proc. of SIGMOD’86, Washington, May 1986, pp. 16–52.
F. Bancilhon, et al.: Magic Sets and Other Strange Ways to Implement Logic Programs, Proc. of 5th ACM SIGMOD-SIGACT Symp. on Princ. of Database Systems, 1986, pp. 1–15.
S. Ceri, G. Gottlob, L. Lavazza: Translation and Optimization of Logic Queries: The Algebraic Approach, Proc. VLDB ‘86, Kyoto, August 86, pp. 395–402
W.F. Clocksin, C.S. Mellish: Programming in Prolog, Springer, 1981
J.Han, H. Lu: Some Performance Results on Recursive Query Processing in Relational Database Systems, Proc. of Intl. Conf. on Data Engineering, Los Angeles, Feb.1986, pp. 533–541.
L.J. Henschen, S.A. Naqvi: On Compiling Queries in Recursive First-Order Databases, JACM 31 /1, Jan. 1984, pp. 47–85.
Y.E. Ioannidis: On the Computation of the Transitive Closure of Relational Operators, Proc. VLDB ‘86, Kyoto, August 86, pp. 403–411
J.W. Lloyd: Foundations of Logic Programming, Springer, 1984
E.L. Lozinskii: Evaluating Queries in Deductive Databases by Generating, IJCAI 85, Los Angeles, Aug. 1985, pp. 173–177
D.P. McKay, S.C. Shapiro: Using Active Connection Graphs for Reasoning with Recursive Rules, Proc. of 7th IJCAI, Vancouver, Aug. 1981, pp. 368–374.
W. Nejdl, E.J. Neuhold: The PROLOG-DB System: Integrating PROLOG and Relational Databases, ÖGAI-Journal 5 /1, July 1986
W. Nejdl: Recursive Strategies for Answering Recursive Queries — The RQA/FQI Strate, to appear in Proc. of the Very Large Data Base Conference VLD ‘87, Brighton, September 1987
W. Nejdl: Some Ideas for an Efficient Integration of PROLOG and RDBMS’s: Retrieval and Update in PROLOG-DB, Technical Report, TU Vienna, February 1987
L. Raschid, S.Y.W. Su: A Parallel Processing Strategy for Evaluating Recursive Queries, Proc. VLDB ‘86, Kyoto, August 86, pp. 412–419
D.E. Smith, M.R. Genesereth, M.L. Ginsberg: Controlling Re-cursive Inference, Artificial Intelligence 30 /3, Dec. 1986, pp. 343–389
J.D. Ullman: Implementation of Logical Query Languages for Databases, TODS 10 /3, 1985, pp. 289–321.
L. Vieille: Recursive Axioms in Deductive Databases: The Query/Subquery Approach, Proc. of the 1st Intl. Conf. on Expert Database Systems, Charleston, S.C., April 1986, pp. 179–193.
L. Vieille: Database-Complete Proof Procedures Based on SLD Resolution, Proc. of the 4th Intl. Conf. on Logic Programming, Melbourne, Australia, May 1987
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nejdl, W. (1987). The RQA/FQI Strategy — Some Thoughts on the Evaluation of Recursive Queries in Knowledge Base Management Systems. In: Buchberger, E., Retti, J. (eds) 3. Österreichische Artificial-Intelligence-Tagung. Informatik-Fachberichte, vol 151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46620-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-46620-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18384-6
Online ISBN: 978-3-642-46620-5
eBook Packages: Springer Book Archive