This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Evaluation of Recursive Queries with Extended Rules in Deductive Databases
April 1995 (vol. 7 no. 2)
pp. 328-331

Abstract—In order to extend the expressive power of deductive databases, a formula that can have existential quantifiers in prenex normal form in a restricted way is defined as an extended rule. With the extended rule, we can easily define a virtual view that requires a division operation of relational algebra to evaluate. This paper addresses a recursive query evaluation where at least one formula in a recursive rule set is of an extended rule. We investigate transformable recursions as well as four cases of non-transformable recursions of transitive-closure-like and linear type. This work reveals that occurrence of an existentially quantified variable in the extended recursive body predicate might dramatically limit the level of recursive search. In particular, the number of iterations to answer extended queries can be determined, independently of database contents.

[1] A.V. Aho and J.D. Ullman,“Universality of data retrieval languages,” Proc. Sixth ACM Symp. Principles of Programming Languages, Jan. 1979.
[2] F. Bancilhon and R. Ramakrishnan,“An amateur’s introduction to recursive query processing strategies,” Proc. 1986 ACM-SIGMOD Int’l Conf. Management Data, pp. 16-52,Washington, DC, May 1986.
[3] C.L. Chang and R.C.T. Lee,Symbolic Logic and Mechanical Theorem Proving.New York: Academic Press, 1973.
[4] J. Han,“Pattern-based and knowledge-directed query compilation for recursive data bases,” PhD dissertation, Univ. of Wisconsin at Madison, USA, 1985.
[5] L.J. Henschen and S. Naqvi, “On Compiling Queries in Recursive First-Order Database,” J. ACM, vol. 31, no. 1, pp. 47-85, 1984.
[6] G.M. Kuper,“Logic programming with sets,” Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 11-20, 1987.
[7] S.H. Lee,“Extending the expressive power of deductive databases,” PhD dissertation, Northwestern Univ., Evanston, Ill., USA, 1989.
[8] S.H. Lee and L. Henschen,“Semantics and properties of existential quantifiers in deductive databases,” Information Processing Letters, vol. 47, no. 2, pp. 101-108, 1993.
[9] S.H. Lee and L. Henschen,“Substitution-based compilation of extended rules in deductive databases,” Proc. 10th Int’l. Conf. on Automated Deduction (CADE), M.E. Stickel, ed. New York: Springer-Verlag, pp 57-71, 1990.
[10] J.W. Lloyd and R.W. Topor,“Making Prolog more expressive,” J. Logic Programming, vol. 1, no. 3, pp. 225-240, 1984.
[11] J. Minker,“On theories of definite and indefinite databases,” Tech. Report 1250, Dept. of Comput. Sci., Univ. of Maryland, 1983.
[12] S. Naqvi and S. Tsur, A Logical Language for Data and Knowledge Bases.New York: Computer Science Press, 1989.
[13] R. Reiter,“Towards a logical reconstruction of relational database theory,” in On Conceptual Modeling, M.L.Brodie, J.L. Mylopoulos and J.W. Schmit, ed. New York: Springer Verlag, pp. 163-189, 1984.
[14] J. Ullman, Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, 1988.

Index Terms:
Deductive databases, DBMS, recursive queries, query processing, extended rules, automated reasoning.
Citation:
Sang Ho Lee, Lawrence J. Henschen, "Evaluation of Recursive Queries with Extended Rules in Deductive Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 2, pp. 328-331, April 1995, doi:10.1109/69.382302
Usage of this product signifies your acceptance of the Terms of Use.