Advertisement

Counting-based normalization for multiple linear recursions

  • Xiaoyong Du
  • Zhibin Liu
  • Naohiro Ishii
Theoretical Aspects 1
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)

Abstract

Normalization is a powerful query independent compilation and optimization technique for complex linear recursions in deductive databases [6, 7, 10, 8, 4]. It transforms a linear recursion into an n-chain recursion which consists of n chain predicates among which there is no shared variables. Normalization facilitates capturing more bindings and doing quantitative analysis, hence generating efficient query processing plans. However, the existing normalization methods are applicable only to single linear recursions. In this paper, we revise the concept of chain and n-chain recursion, and propose a novel method, called counting-based transformation, to transform a general multiple linear recursive program to single n-chain recursion. Based on this method, the existing evaluation methods which are applicable to single linear recursions can be applied also to multiple linear recursions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beeri,C., Ramakrishnan, R.: “On the Power of Magic” Proc. ACM Symp. on Principles of Database Systems (PODS) pp.269–283 (1987)Google Scholar
  2. 2.
    Du, X., Ishii, N.: Optimizing Linear Recursive Formulas by Detaching Isolated Variables. IEICE Trans. Info. and Syst. Vol.E78-D, No.5, pp.579–585 (1995).Google Scholar
  3. 3.
    Du, X., Ishii, N.: Reducing the Arity of Predicates by Realigning Some Predicates. Proc. ICLP'95 Joint Workshop on Deductive Databases and Logic Programming. pp.57–69 (1995).Google Scholar
  4. 4.
    Du,X., Ishii,N.: Normalization of Linear Recursions based on Graph Transformation. Proc. Int'l Conf. CISMOD, LNCS 1009. pp.265–282 (Nov. 1995)Google Scholar
  5. 5.
    Han,J.: Multi-Way Counting Method, Information Systems, Vol.14, No.3, pp.219–229 (1989)CrossRefGoogle Scholar
  6. 6.
    Han,J.: Compiling General Linear Recursions by Variable Connection Graph Analysis, Comput. Intell. 5, pp.12–31,(1989)Google Scholar
  7. 7.
    Han,J., Zeng,K.: Automatic Generation of Compiled Forms for Linear Recursions, Information Systems, Vol.17, No.4, pp.299–322 (1992)CrossRefGoogle Scholar
  8. 8.
    Lu,W., Lee,D.L., Han,J.: A Study on the Structure of Linear Recursion, IEEE Trans. KDE, Vol.6, No.5, pp.723–737 (1994)Google Scholar
  9. 9.
    Wang,K., Zhang, W., Chou,S.C.: Decomposition of Magic Rewriting JACM Vol.42, No.2, pp.329–381, March(1995)CrossRefGoogle Scholar
  10. 10.
    Yong,C., Kim,H.J., et al.: Classification and Compilation of Linear Recursive Queries in Deductive Databases. IEEE Trans. KDE, Vol.4, No.1, pp.52–67 (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

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

Personalised recommendations