Normalization of linear recursions based on graph transformations

  • Xiaoyong Du
  • Naohiro Ishii
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1006)


In this paper, we propose a new approach to generate normal form formulas for linear recursions based on graph transformations. We first extend the graph model proposed in [17] for representing linear recursive definitions completely, coupling with graph equivalence definitions. The new graph model is called IE-graph. Then three basic equivalence-preserving graph transformation techniques are newly defined on IE-graphs: (1) realigning; (2) reducing; (3) expanding. Based on these graph transformation techniques, we show that a general IE-graph can always be transformed equivalently into a set of disjoint unit cycles, called Normal IE-graph. The formula generated by our method is more efficient than that generated by Han and Zeng's method [7], because the formula generated by our method contains usually less variables in the recursive predicate.

Key words

deductive databases linear recursions compilation and optimization normalization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F.Bancilhon and R.Ramekrishnan: An Amateur's Introduction to Recursive Query Processing Strategies” Proc. ACM SIGMOD, 1986Google Scholar
  2. 2.
    Bancilhon F., Maier D., Sagiv Y., Ullman J.D.: “Magic Set and Other Strange Ways to Implement Logic Programs”. Proceedings. ACM SIGACT-SIGMOD-SISART Symposium on Principles of Database Systems(PODS), (1986).Google Scholar
  3. 3.
    X.Du and N.Ishii: “Optimizing Linear Recursive Formulas by Detaching Isolated Variables”. IEICE TOIS Vol.E78-D No.5, May, 1995 Google Scholar
  4. 4.
    X.Du and N.Ishii: “Reducing the Arity of Recursive Predicates by Realigning Some Predicates”, Proc. ICLP'95 Workshop on Deductive Database and Logic Programming. June 17, 1995 Google Scholar
  5. 5.
    L.Henschen and S.Naqvi: On Compiling Queries in Recursive First-Order Data base, JACM vol.51 (1984)Google Scholar
  6. 6.
    Jiawei Han: Compiling General Linear Recursions by Variable Connection Graph Analysis, Comput. Intell. 5, 12–31, (1989)Google Scholar
  7. 7.
    Jiawei Han, Kangsheng Zeng: Automatic Generation of Compiled Forms for Linear Recursions, Information Systems, Vol.17, No.4, pp.299–322, (1992)CrossRefGoogle Scholar
  8. 8.
    Y.Ioannidis: A Time Bound on the Materialization of some Recursively Defined Views, Proceedings of Very Large Data Bases(VLDB), (1985)Google Scholar
  9. 9.
    Lakshmanan, L.V.S., Hernandez,H.J.: “Structural Query Optimization — A Uniform Framework for Semantic Query Optimization in Deductive Databases”, Proc. ACM Symposium on Principles of Database Systems(PODS), (1991), pp.102–114.Google Scholar
  10. 10.
    W.Lu, D.L.Lee, J.Han: A Study on the Structure of Linear Recursion, IEEE Trans. Knowledge and Data engineering, Vol.6, No.5, pp.723–737 (1994)CrossRefGoogle Scholar
  11. 11.
    J.Naughton: Data Independent Recursion in Deductive Database, Proceedings ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems(PODS), (1986).Google Scholar
  12. 12.
    J.Naughton: One-Side Recursions, Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems(PODS), pp.340–348 (1987)Google Scholar
  13. 13.
    J.Naughton: Minimizing Function-Free Recursive Inference Rules. J. ACM Vol.36, No.1, pp.69–91 (1989)CrossRefGoogle Scholar
  14. 14.
    J.Naughton, R.Ramakrishnan, Y.Sagiv, J.D.Ullman: Argument Reduction by Factoring, Proc. the 15th Int. Conf. on Very Large Data Bases(VLDB), pp.173–182 (1989)Google Scholar
  15. 15.
    S. Seshadri, J.F.Naughton: “On the Expected Size of Recursive Datalog Queries”, Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp.268–279 (1991).Google Scholar
  16. 16.
    J.D.Ullman: Principles of Database and Knowledge-Base Systems, Vol.II, Computer Science Press, (1989)Google Scholar
  17. 17.
    C.Yong, H.J. Kim, L.J.Henschen, and 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 (1992)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Xiaoyong Du
    • 1
  • Naohiro Ishii
    • 1
  1. 1.Department of Intelligence and Computer ScienceNagoya Institute of TechnologyNagoyaJapan

Personalised recommendations