Dynamically Ordered Semi-Naive Evaluation of Recursive Queries

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 429
  • Download : 18
DC FieldValueLanguage
dc.contributor.authorHONG, KI-HYUNG-
dc.contributor.authorLEE, YOON-JOON-
dc.contributor.authorWHANG, KYU-YOUNG-
dc.identifier.citationInformation Sciences, Vol.96, No.3, pp.237-269en
dc.description.abstractConventional fixed point evaluation techniques evaluate recursions by applying all rules repeatedly using an initial set of tuples (i.e., a given extensional database instance) until no new tuples are generated, but there is no specific order in which rules are applied. We can speed up the evaluation by applying rules in an appropriate order. In this paper, we propose a new fixed point evaluation technique, called the dynamically ordered semi-naive evaluation (or simply DYN), in which the next rule to be applied is determined at run time dynamically. DYN consists of a semi-naive algorithm and a set of selection strategies, The semi-naive algorithm allows dynamic ordering of rule applications and makes tuples generated by a rule application immediately available in the subsequent rule applications. After each rule application, the selection strategies determine the next rule by considering the syntactic structure of recursion and some information about the intermediate result up to the present. We develop these selection strategies so that the total number of rule applications and joins can be reduced. Through experimental comparisons, we shows that DYN outperforms the previous evaluation techniques in terms of the total number of rule applications and joins.en
dc.titleDynamically Ordered Semi-Naive Evaluation of Recursive Queriesen
Appears in Collection
CS-Journal Papers(저널논문)


  • mendeley


rss_1.0 rss_2.0 atom_1.0