By Topic

Efficient evaluation of multiple linear recursions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. Han ; Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada ; L. Liu

The authors study the efficient evaluation of side-coherent multiple linear recursions, which can be further classified into three types: multiple one-sided, multiple balanced k-sided, and multiple mixed k-sided. New techniques are developed by integrating the existing single-linear recursive query evaluation methods with the idea of side-relation unioned processing, which leads to a set of efficient query evaluation algorithms such as a side-relation unioned transitive closure algorithm for the processing of Type I ML recursions and a generalized side-relation unioned magic sets method for the processing of Types II and III ML recursions. The authors describe the processing of single-probe queries on side-coherent ML recursions. They outline the processing of complex queries on ML recursions

Published in:

IEEE Transactions on Software Engineering  (Volume:17 ,  Issue: 12 )