We use cookies to improve your experience with our site.
Chen Yangjun. Magic Sets Revisited[J]. Journal of Computer Science and Technology, 1997, 12(4): 346-365.
Citation: Chen Yangjun. Magic Sets Revisited[J]. Journal of Computer Science and Technology, 1997, 12(4): 346-365.

Magic Sets Revisited

  • This paper distinguishes among three kinds of linear recursions: canonical strongly linear recursion (CSLR), non-interdependent linear recursion (NILR) and interdependent linear recurstion (ILR) and presents an optimal algorithm for each. First, for the CSLRs, the magic-set method is refined in such a way that queries can be evaluated efficiently. Then, for the NILRS and ILRs, the concept of query dependency graphs is introduced to partition the rules of a program into a set of CSLRs and the computation is elaborated so that the oplimization for CSLRs can also be applied
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return