This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Classification and Compilation of Linear Recursive Queries in Deductive Databases
February 1992 (vol. 4 no. 1)
pp. 52-67

The authors present a graph model which is powerful in classifying and compiling linear recursive formulas in deductive databases. The graph model consists of two kinds of graphs: I-graph and resolution graph. Essential properties of a recursive formula can be extracted from its I-graph, and the compiled formula and the query evaluation plan of the recursive formulas can be determined from its resolution graph. It is demonstrated that based on the graph model all the linear recursive formulas can be classified into a taxonomy of classes and each class shares common characteristics in query compilation and query processing. The compiled formulas and the corresponding query evaluation plans can be derived based on the study of the compilation of each class.

[1] F. Bancilhon and R. Ramakrishnan, "An amateur's introduction to recursive query processing strategies," inProc. 1986 ACM-SIGMOD Conf. Management of Data(Washington, DC), May 1986, pp. 16-52.
[2] F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, "Magic sets and other strange ways to implement logic programs," inProc. 5th ACM Symp. Principles of Database Syst.(Cambridge, MA), Mar. 1986, pp. 1-15.
[3] A. Chandra, "Programming primitives for database languages," inProc. 8th Annu. ACM Symp. Principles of Programming Languages, 1981.
[4] H. Gallaire, J. Minker, and J. Nicolas, "Logic and databases: A deductive approach,"ACM Comput. Surveys, vol. 16, pp. 153-185,1984.
[5] J. Han and L. J. Henschen, "Handling redundancy in the processing of recursive database queries," inProc. 1987 ACM-SIGMOD Conf. Management of Data(San Francisco, CA), May 1987, pp. 73-81.
[6] J. Han, "Pattern-based and knowledge-directed query compilation for recursive databases," Comput. Sci. Tech. Rep. 629, Univ. Wisconsin, Madison, Ph.D. dissertation, Jan. 1986.
[7] J. Han, L. Henschen, and C. Youn, "Compiling complex linear recursive cluster," inProc. 1988 Canadian Inform. Processing Society Conf., Edmonton, Alta., Canada, 1988.
[8] L. J. Henschen and S. Naqvi, "On compiling queries in recursive first-order databases,"J. ACM, vol. 1, no. 1, pp. 47-85, 1984.
[9] Y. Ioannidis, "A time bound on the materialization of some recursively defined views,"Proc. 11th Int. Conf. Very Large Databases, Stockholm, Sweden, Aug. 1985, pp. 219-226.
[10] Y. Ioannidis, "Bounded recursion in deductive databases," Memorandum UCB/ERL M85/6, Univ. of California, Berkeley, 1985.
[11] H. V. Jagadish and R. Agrawal, "A study of transitive closure as a recursion mechanism," inProc. 1987 ACM SIGMOD Conf. (San Francisco, CA), 1987, pp. 331-334.
[12] J.W. Lloyd,Foundations of Logic Programming, Springer-Verlag, New York, 1987.
[13] D. Maier,The Theory of Relational Databases, Rockville, MD: Computer Science Press, 1983.
[14] J. Minker, "Search strategy and selection function for an inferential relational systems,"ACM Trans. Database Syst., vol. 3, no. 1, 1978.
[15] J. Minker,Foundations of Deductive Databases and Logic Programming, (edited). Los Altos, CA: Morgan-Kaufmann, 1988.
[16] J. Naughton, "Data independent recursion in deductive databases," inProc. 5th Symp. Principles Database Syst., Cambridge, MA, Mar. 1986, pp. 267-279.
[17] J. F. Naughton, "One-sided recursions," inProc. 6th ACM Symp. Principles of Database Syst., San Diego, CA, Mar. 1987, pp. 340- 348.
[18] J. F. Naughton, "Minimizing function-free recursive inference rules,"J. ACM, vol. 36, no. 1, pp. 69-91, 1989.
[19] R. Ramakrishnan, private communication, 1988.
[20] R. Reiter, "On closed world databases," inLogic and Databases, H. Galaire and J. Minker, Eds. New York: Plenum, 1978, pp. 55-76.
[21] O. Shmueli, "Decidability and expressiveness aspects of logic queries," inProc. ACM SIGACT-SIGMOD Symp. Principles Database Systems, 1987, pp. 237-249.
[22] D. J. Troy, C. T. Yu, and W. Zhang, "Linearization of nonlinear recursive rules,"IEEE Trans. Software Eng., vol. 16, no. 9, pp. 1109-1119, 1989.
[23] J. D. Ullman,Principles of Database and Knowledge Base Systems, vol. II:The New Technologies. Rockville, MD: Comput. Sci. Press, 1989.
[24] C. Youn, L. Henschen, and J. Han "A classification of recursive formulas in deductive databases," inProc. ACM-SIGMOD Conf. Management of Data, Chicago, IL, June 1988.

Index Terms:
linear recursive queries; deductive databases; graph model; I-graph; resolution graph; query evaluation plan; query compilation; query processing; deductive databases; query languages
Citation:
C. Youn, H.-J. Kim, L.J. Henschen, J. Han, "Classification and Compilation of Linear Recursive Queries in Deductive Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 4, no. 1, pp. 52-67, Feb. 1992, doi:10.1109/69.124897
Usage of this product signifies your acceptance of the Terms of Use.