J.C. Freytag and N. Goodman. On the translation of relational queries into iterative programs. ACM Trans. on Database Systems, 14(1):1, March 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....these statements with a special virtual machine that we call AVM 2 . The only references to a similar idea we found in the literature are an (old) IBM technical report [LW79] and a paper that describes how a rule based system can be used to generate such statements for a given query [FG89] We were also told that IBM DB2 uses assembler like statements to evaluate expressions, but such details of DB2 have not yet been published. As an example, Figures 5 and 6 show two AVM programs that we used to implement Query 1 of the TPC D benchmark [TPC95] The first program implements the ....

J.C. Freytag and N. Goodman. On the translation of relational queries into iterative programs. ACM Trans. on Database Systems, 14(1):1, March 1989.

....as query processing [38] and semantic query optimization [15] where declarative query specifications are transformed into executable and efficient query plans. Freytag and Goodman applied program transformation techniques to the synthesis of iterative programs from relational query specifications [7]. There has been essentially no work in the deductive synthesis of database transactions. There have been numerous proposals on improving the effectiveness of theorem proving systems. In particular, equational unification [23] and theory resolution [37] have been widely used by researchers. The ....

Freytag, J., and Goodman, N., "On the Translation of Relational Queries into Iterative Programs "; ACM Transactions on Database Systems 14:1, 1989, 1-27.

....as AP5 [Coh91] and compilers for very high level languages, such as SETL [Fre83] may be relevant. Another possibility is to apply partial evaluation techniques of compilers to intertwine and optimize modular specifications to produce an efficient monolithic implementation of a target subsystem [Fre89]. Domainspecific compilers for open architecture systems are also promising. These compilers exploit knowledge and optimization techniques that are specific to a domain to generate efficient code. The Morpheus network protocol compiler and the Predator data structure compiler are prime examples ....

J. C. Freytag and N. Goodman, "On the Translation of Relational Queries into Iterative Programs", ACM TODS, March 1989, 1-27.

....a join predicate into disjunctive normal form may trigger new join transformations. The normalization algorithm can be used for algebraic optimization in both the abstract and physical layers. In fact, it generalizes many algebraic optimization algorithms found in the database literature [10, 1]. In addition, loop fusion can effectively capture most stream based pipelining techniques used in relational query evaluation for propagating values a tuple at a time instead of a table at a time between relational operations (this is achieved by fusing the loops of two nested relational ....

J. C. Freytag and N. Goodman. On the Translation of Relational Queries into Iterative Programs. ACM Transactions on Database Systems, 14(1):1-- 27, March 1989.

....well as disk les (to communicate temporary results) and then let the operating system do the scheduling has been identi ed as too costly an option [11, 12] The necessary process context switches, IPC cost, and I O of temporary results dominate the overall query cost. Dioeerent lines of research [7, 8, 16] led to the development of single process query engines in which the query plan is compiled into a single iterative or recursive procedure. Whenever possible these approaches strive for a stream based (or pipelined) execution to avoid I O of temporary data. The query processor bene ts from ....

....select project join operators) Graefe [11] proposed a solution in which operators had to be re coded in a streaming style: operators consume their input on demand (lazily) and element wise. These operators then interact via a simple end of stream and next call interface. Almost simultaenously [7, 8] employed an instance of Burlington and Durstall s [4] unfold transform fold program transformation strategy: the inner control structure of the combinators expressed in a limited subset of LISP were revealed (unfolded) with the goal of fusing neighbouring combinators. Rule sets described if and ....

[Article contains additional citation context not shown here]

J.C. Freytag and N. Goodman. On the Translation of Relational Queries into Iterative Programs. ACM Transactions on Database Systems, 14(1):127, March 1989.

No context found.

J.C. Freytag and N. Goodman. On the translation of relational queries into iterative programs. ACM Trans. on Database Systems, 14(1):1, March 1989.

No context found.

J.C. Freytag and N. Goodman. On the translation of relational queries into iterative programs. ACM Trans. on Database Systems, 14(1):1, March 1989.

No context found.

Freytag, J.C. and Goodman, N. On the translation of relational queries into iterative programs, ACM Trans. on Database Systems, 14(1), 1989, pp 1-27.

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