This book investigates the problem of translating relational queries into iterative programs using methods and techniques from the areas of functional programming and program transformation. The first part presents two algorithms which generate iterative programs from algebra-based query specifications. While the first algorithm is based on the transformation of recursive programs, the second uses functional expressions to generate the final iterative form. In the second part the same techniques generate efficient programs for the evaluation of aggregate functions in relational database systems. In several steps, programs which perform aggregation after sorting, are transformed into programs which perform aggregation while sorting. The third part then investigates the Lisp-dialect T as a possible implementation language for database systems. The book describes all transformations by transformation rules. The reader can expect a formal treatment of the proposed transformations which provide the basis for proving the correctness of the algorithms and, at the same time, give important insight into the techniques and methods developed for the transformation. Additionally, the high-level, detailed description of the algorithms immediately leads to their implementation and allows their extension to meet new requirements. Overall, the use of transformation rules and transformation methods introduces a new approach to query processing in relational database systems.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Data models and rewriting systems.- A transformation system based on recursive programs.- Query transformation based on map expressions.- The transformation of aggregate functions.- The implementation of database systems in T.- Conclusion and future work.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 20,77 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiEUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiDa: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condizione: Fine. First edition, first printing, 131 pp., paperback, fine. Lecture Notes in Computer Science, Volume 261. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Codice articolo ZB1307037
Quantità: 1 disponibili
Da: Ammareal, Morangis, Francia
Softcover. Condizione: Très bon. Ancien livre de bibliothèque. Edition 1987. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1987. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo E-596-202
Quantità: 1 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book investigates the problem of translating relational queries into iterative programs using methods and techniques from the areas of functional programming and program transformation. The first part presents two algorithms which generate iterative pr. Codice articolo 4883617
Quantità: Più di 20 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book investigates the problem of translating relational queries into iterative programs using methods and techniques from the areas of functional programming and program transformation. The first part presents two algorithms which generate iterative programs from algebra-based query specifications. While the first algorithm is based on the transformation of recursive programs, the second uses functional expressions to generate the final iterative form. In the second part the same techniques generate efficient programs for the evaluation of aggregate functions in relational database systems. In several steps, programs which perform aggregation after sorting, are transformed into programs which perform aggregation while sorting. The third part then investigates the Lisp-dialect T as a possible implementation language for database systems. The book describes all transformations by transformation rules. The reader can expect a formal treatment of the proposed transformations which provide the basis for proving the correctness of the algorithms and, at the same time, give important insight into the techniques and methods developed for the transformation. Additionally, the high-level, detailed description of the algorithms immediately leads to their implementation and allows their extension to meet new requirements. Overall, the use of transformation rules and transformation methods introduces a new approach to query processing in relational database systems. Codice articolo 9783540180005
Quantità: 1 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book investigates the problem of translating relational queries into iterative programs using methods and techniques from the areas of functional programming and program transformation. The first part presents two algorithms which generate iterative programs from algebra-based query specifications. While the first algorithm is based on the transformation of recursive programs, the second uses functional expressions to generate the final iterative form. In the second part the same techniques generate efficient programs for the evaluation of aggregate functions in relational database systems. In several steps, programs which perform aggregation after sorting, are transformed into programs which perform aggregation while sorting. The third part then investigates the Lisp-dialect T as a possible implementation language for database systems. The book describes all transformations by transformation rules. The reader can expect a formal treatment of the proposed transformations which provide the basis for proving the correctness of the algorithms and, at the same time, give important insight into the techniques and methods developed for the transformation. Additionally, the high-level, detailed description of the algorithms immediately leads to their implementation and allows their extension to meet new requirements. Overall, the use of transformation rules and transformation methods introduces a new approach to query processing in relational database systems.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 148 pp. Englisch. Codice articolo 9783540180005
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783540180005_new
Quantità: Più di 20 disponibili
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Paperback. Condizione: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Codice articolo UTD14a-0596
Quantità: 1 disponibili
Da: SUNSET BOOKS 2, Newark, OH, U.S.A.
Paperback. Condizione: Good. No Jacket. 1st. With full markings, pocket, and/or bookplate. Normal wear, soil. Size: 8vo. Ex-Library. Codice articolo 016151
Quantità: 1 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9783540180005
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book investigates the problem of translating relational queries into iterative programs using methods and techniques from the areas of functional programming and program transformation. The first part presents two algorithms which generate iterative programs from algebra-based query specifications. While the first algorithm is based on the transformation of recursive programs, the second uses functional expressions to generate the final iterative form. In the second part the same techniques generate efficient programs for the evaluation of aggregate functions in relational database systems. In several steps, programs which perform aggregation after sorting, are transformed into programs which perform aggregation while sorting. The third part then investigates the Lisp-dialect T as a possible implementation language for database systems. The book describes all transformations by transformation rules. The reader can expect a formal treatment of the proposed transformations which provide the basis for proving the correctness of the algorithms and, at the same time, give important insight into the techniques and methods developed for the transformation. Additionally, the high-level, detailed description of the algorithms immediately leads to their implementation and allows their extension to meet new requirements. Overall, the use of transformation rules and transformation methods introduces a new approach to query processing in relational database systems. 148 pp. Englisch. Codice articolo 9783540180005
Quantità: 2 disponibili