Performance of recursive query processing methods in the presence of cycles

https://doi.org/10.1016/0020-0255(96)00021-7Get rights and content

Abstract

An experimental performance analysis of three recursive query processing methods [the magic-sets method (MAG), the magic-counting method (MCS), and the synchronized-counting method (SCM)] in deductive databases in the presence of cycles is presented. We define a set of characteristics that affects the performance of query processing methods for cyclic data. Although there are other experimental performance analysis studies of recursive query processing methods in the literature, these studies have covered only acyclic databases. There are only some bounds for the worst case and best case analysis of recursive query processing methods on cyclic data. This paper introduces a set of graph characteristics on which similar performance studies can be based, and it is, to our knowledge, the first comparative experimental study on the performance of recursive query processing methods for cyclic data.

References (23)

  • L.J. Henschen et al.

    On compiling queries in recursive first-order logic database

    J. ACM

    (1984)
  • F. Bancillon et al.

    Magic-sets and other strange ways to implement logic programs

  • F. Bancillon et al.

    An amateur's introduction to recursive query processing strategies

  • D. Sacca et al.

    On the implementation of a simple class of logic queries for databases

  • C. Beeri et al.

    On the power of magic

  • J. Han et al.

    Handling redundancy in the processing of recursive database queries

  • A. Machetti-Spaccamela et al.

    Worst-case complexity analysis of methods for logic query implementation

  • D. Sacca et al.

    Magic-counting methods

  • H. Aly et al.

    The synchronized-counting method

  • C. Wu et al.

    Answering linear recursive queries in cyclic databases

  • C. Wu et al.

    Determining the answers to linear recursive queries by enumerating the recurrence sequences

    ICS

    (1988)
  • Cited by (0)

    View full text