Skip to main content
SpringerLink
Log in

Counting-based normalization for multiple linear recursions

  • Theoretical Aspects 1
  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1134))

Included in the following conference series:

  • 138 Accesses

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.

Work partially supported by the Hori Information Science Promotion Foundation

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. 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. Han,J.: Multi-Way Counting Method, Information Systems, Vol.14, No.3, pp.219–229 (1989)

    Article  Google Scholar 

  6. Han,J.: Compiling General Linear Recursions by Variable Connection Graph Analysis, Comput. Intell. 5, pp.12–31,(1989)

    Google Scholar 

  7. Han,J., Zeng,K.: Automatic Generation of Compiled Forms for Linear Recursions, Information Systems, Vol.17, No.4, pp.299–322 (1992)

    Article  Google Scholar 

  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. Wang,K., Zhang, W., Chou,S.C.: Decomposition of Magic Rewriting JACM Vol.42, No.2, pp.329–381, March(1995)

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Intelligence and Computer Science, Nagoya Institute of Technology, Nagoya, Japan

    Xiaoyong Du, Zhibin Liu & Naohiro Ishii

Authors
  1. Xiaoyong Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhibin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Naohiro Ishii
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Roland R. Wagner Helmut Thoma

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Du, X., Liu, Z., Ishii, N. (1996). Counting-based normalization for multiple linear recursions. In: Wagner, R.R., Thoma, H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034710

Download citation

  • DOI: https://doi.org/10.1007/BFb0034710

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61656-6

  • Online ISBN: 978-3-540-70651-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation