A. Poulovassilis and C. Small. Formal foundations for optimising aggregation functions in database programming languages. In Workshop on Database Programming Languages (DBPL), pages 299--318, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Semantic optimization of OQL queries - Trigoni (2002) (2 citations) (Correct)
....Work Within the intermediate query representations, there are a lot of opportunities for syntactic calculus or algebraic transformations. A lot of experience has been gained applying these optimizations in the relational or object oriented context [CS96, Cha98, GLR97, Hel98, Ioa96, KPH98, PS96, PS97, RS93, SdBB96, SO95a, SO95b, WM99] This thesis focuses on semantic query optimization, i.e. query transformations based on semantic knowledge rather than syntactic equivalence. In particular, semantic knowledge is represented by association rules of the form: p n p 0 (Exc) ....
A. Poulovassilis and C. Small. Formal foundations for optimising aggregation functions in database programming languages. In Workshop on Database Programming Languages (DBPL), pages 299--318, 1997.
Query Deforestation - Grust, Scholl (1998) (Correct)
....may never built these lists as a whole but their elements have to be allocated and garbage collected anyway. 2 Deforestation removes intermediate data structures, which Wadler collectively refers to as trees. Hence the name deforestation. transformations like those developed in [7] 5] and [17]. We will discuss connections to these related eoeorts when the particular details are in context. Section 4 sheds light on correctness and implementation issues. How this idea might evolve is brieAEy touched in Section 5. A Haskell style [14] representation language will be used for the sake of ....
....p x exists p xs Figure 1: Recursive de nitions of combinators filter and exists. filter and exists exhibit a pattern of simple recursion and reduction that can be found in all algebraic combinators. The generic functional foldr (variants of which are referred to as pump [1] AEattenmap [17], or sri [20] in the literature) implements this pattern, which implies that a complete query engine could be built solely based on an eOEcient implementation of foldr (Section 4 will come back to this point) foldr : ff fi fi) fi ff fi foldr f z [ z foldr f z ....
[Article contains additional citation context not shown here]
A. Poulovassilis and C. Small. Formal Foundations for Optimising Aggregation Functions in Database Programming Languages. In Proc. of the 6th Int'l Workshop on Database Programming Languages (DBPL), Estes Park, Colorado, USA, 1997.
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