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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 20,82 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoEUR 4,65 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoLibrería: Zubal-Books, Since 1961, Cleveland, OH, Estados Unidos de America
Condición: Fine. *Price HAS BEEN REDUCED by 10% until Monday, June 23. Order now for BEST SAVINGS* 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. Nº de ref. del artículo: ZB1307037
Cantidad disponible: 1 disponibles
Librería: Ammareal, Morangis, Francia
Softcover. Condición: 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. Nº de ref. del artículo: E-596-202
Cantidad disponible: 1 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783540180005_new
Cantidad disponible: Más de 20 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540180005
Cantidad disponible: 1 disponibles
Librería: moluna, Greven, Alemania
Condición: 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. Nº de ref. del artículo: 4883617
Cantidad disponible: Más de 20 disponibles
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
Paperback. Condición: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Nº de ref. del artículo: UTD14a-0596
Cantidad disponible: 1 disponibles
Librería: SUNSET BOOKS 2, Newark, OH, Estados Unidos de America
Paperback. Condición: Good. No Jacket. 1st. With full markings, pocket, and/or bookplate. Normal wear, soil. Size: 8vo. Ex-Library. Nº de ref. del artículo: 016151
Cantidad disponible: 1 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9783540180005
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540180005
Cantidad disponible: 2 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540180005
Cantidad disponible: 10 disponibles