Gupta, A., Mumick, I. S.: Magic-sets Transformation in Nonrecursive Systems. PODS 1992: 354-367.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....queries for database systems with a powerful view concept. This is in particular the case for systems which will implement the new SQL:1999 standard, and hence will allow the definition of recursive views. The attractiveness of this method lies in its generality and e#ciency. Additionally, in [8, 12] it has been shown that the Magic Set method can improve the performance of nonrecursive queries as well. Thus, it seems worthwhile to implement a Magic Set transformation and a fixpoint based evaluation mechanism on top of a (non)recursive relational database system. In this paper we propose such ....

Gupta, A., Mumick, I. S.: Magic-sets Transformation in Nonrecursive Systems. PODS 1992: 354-367.

....hence cannot lead to different proof processes. The general problem, however, of losing strafication after the magic set transformation using an allowed SIP strategy has been applied remains and can be solved, e.g. by using weak stratification [11] or by using the alternating fixpoint [21] In [8, 13] it has been shown that the magic set method can improve the performance of nonrecursive queries as well and hence it seems worthwhile to apply the dynamic approach to nonrecursive systems, too. This is especially true if evaluation costs of body literals differ considerably and the evaluation of ....

Gupta, A., Mumick, I. S.: Magic-sets Transformation in Nonrecursive Systems. PODS 1992: 354-367.

.... [51] 133] 99] 135] 101] 52] 42] 43] 54] 93] 107] 108] 31] XSB, YAP, Lola, and others Optimizations [36] 5 Overview ffl Magic Sets and Related Research (e.g. Alexander Method) Formulation [102] 7] 111] 124] 20] 87] 85] 10] 70] 91] 117] 47] [60], 96] 11] 114] 104] 84] References are a little dated. Implementation and Systems [8] 25] 125] 97] 113] 130] 131] 44] 59] 63] 86] LDL, Aditi, Coral and others. Optimizations [95] 88] 105] 106] 103] 72] 116] 62] 61] 118] 15] 6 Overview ....

A. Gupta and I. Mumick. Magic sets transformations in non-recursive systems. In PODS, pages 354--367, 1992.

.... [64] 42] 2] 55] 82] 84] 106] 107] 93] 7] 21] 43] 44] 96] 121] 45] 83] 95] 92] Optimizations [30] 6 Motivation Magic Sets and Related Research (e.g. Alexander Method) Formulation [87] 5] 97] 111] 18] 69] 67] 8] 59] 73] 103] 39] [49], 79] 9] 101] 89] 66] Implementation and Systems [6] 24] 112] 80] 99] 118] 119] 37] 48] 52] 68] Optimizations [78] 70] 90] 91] 88] 61] 102] 51] 50] 104] 16] ffl Bibliography is incomplete: it considers only formulations of evaluation ....

A. Gupta and I. Mumick. Magic sets transformations in non-recursive systems. In PODS, pages 354--367, 1992.

....However, they rely on changing the evaluation strategy of the rules in order to achieve this effect. The rules still remain recursive. By ensuring that the magic sets transformed program is nonrecursive, we avoid altering the evaluation strategy. A preliminary report on this work appeared in [GM92]. The RLCS MST algorithm presented in the paper has been improved (and is different) from the one in [GM92] We also include proofs, and and describe additional useful properties of the Information Passing Graphs that represent the information passing characteristics of a program. 3 Information ....

....The rules still remain recursive. By ensuring that the magic sets transformed program is nonrecursive, we avoid altering the evaluation strategy. A preliminary report on this work appeared in [GM92] The RLCS MST algorithm presented in the paper has been improved (and is different) from the one in [GM92]. We also include proofs, and and describe additional useful properties of the Information Passing Graphs that represent the information passing characteristics of a program. 3 Information Passing Graphs Dependency graphs capture the upwards flow of information from subgoals to the predicates ....

Ashish Gupta and Inderpal S. Mumick. Magic-Sets Transformation in Non-Recursive Systems . In Proceedings of the Eleventh Symposium on Principles of Database Systems (PODS), pages 354--367, 1992.

No context found.

Ashish Gupta and Inderpal S. Mumick. Magic-Sets Transformation in Non-Recursive Systems . In Proceedings of the Eleventh Symposium on Principles of Database Systems (PODS), 1992.

....non stratified after magic sets transformation. However, they rely on changing the evaluation strategy of the rules in order to achieve this effect. The rules still remain recursive. By ensuring that the magic sets transformed program is nonrecursive, we avoid altering the evaluation strategy. In [GM92] we had described algorithms for the same problem as in this paper. The results of this paper are more exhaustive and describe additional useful properties of the Information Passing Graphs that represent the information passing characteristics of a program. 2 Information Passing Graphs ....

Ashish Gupta and Inderpal S. Mumick. Magic-Sets Transformation in Non-Recursive Systems . In Proceedings of the Eleventh Symposium on Principles of Database Systems (PODS), pages 354--367, 1992.

No context found.

A. Gupta and I. Mumick. Magic-sets transformation in non-recursive systems. In PODS 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC