Inderpal Singh Mumick and Hamid Pirahesh. Overbound and right-linear queries. In Proceedings of the Tenth Symposium on Principles of Database Systems (PODS), Denver, CO, May 29-31 1991. ACM SIGACT-SIGMOD-SIGART. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
SWORD: A Declarative Object-Oriented Database Architecture - Mumick, Ross (1992) (2 citations) Self-citation (Mumick) (Correct)
....cost of evaluating the goal: G1) influencer (master = Bach ; disciple = Smith ; gen = 8) The method would have to construct a portion of the view that would be guaranteed to include this tuple if it existed. Method m may use techniques such as magic sets [BMSU86] or overbound right linear [MP91b]. The method m can use cost models for magic sets and overbound rightlinear optimizations to choose the more efficient technique and estimate the cost of its evaluation. The expected size of the output relation would be either 1 or 0. 2. If the optimizer asks the totally unrestricted query (G2) ....
Inderpal Singh Mumick and Hamid Pirahesh. Overbound and right-linear queries. In Proceedings of the Tenth Symposium on Principles of Database Systems (PODS), Denver, CO, May 29-31 1991. ACM SIGACT-SIGMOD-SIGART.
Adornments in Database Programs - Mumick, Pirahesh, Ramakrishnan Self-citation (Mumick Pirahesh) (Correct)
....y Part of this work was done while the author was visiting IBM Almaden Research Center. Work at Wisconsin was supported by an IBM Faculty Development Award and an NSF grant IRI 88 04319. right linear, left linear, mixed linear [16] context right linear [6, 13] overbound right linear [14], factoring [15] subgoal ordering [9] and C transformation [1] The basic ideas is to adorn an argument of a goal in a rule b if the argument is bound to a constant in all runtime goals generated from for this goal. However, the exact meaning of the b and f adornments was not defined formally ....
....goals with the particular pattern of restrictions represented by the adornment. Query Rewrite: The abstraction provided by adornments is used to guide query rewrite optimization. The magic sets transformation [2, 3] uses the bf adornment class. The right linear and left linear optimizations [16, 6, 13, 14] use the bf adornment class, and can benefit from the sbf and bcf adornment classes. The ground magic sets transformation [11] depends on the bcf adornment class. The C transformation [1] depends on the bf adornment class, and can benefit from the bcf adornment class. 1 Note that sips is an ....
Inderpal Singh Mumick and Hamid Pirahesh. Overbound and right-linear queries. In Proceedings of the Tenth Symposium on Principles of Database Systems (PODS), Denver, CO, May 29-31 1991.
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