000 | 03426nam a22004935i 4500 | ||
---|---|---|---|
001 | 978-3-540-47209-4 | ||
003 | DE-He213 | ||
005 | 20160624102021.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1987 gw | s |||| 0|eng d | ||
020 |
_a9783540472094 _9978-3-540-47209-4 |
||
024 | 7 |
_a10.1007/BFb0055115 _2doi |
|
050 | 4 | _aQA76.9.D3 | |
072 | 7 |
_aUN _2bicssc |
|
072 | 7 |
_aUMT _2bicssc |
|
072 | 7 |
_aCOM021000 _2bisacsh |
|
082 | 0 | 4 |
_a005.74 _223 |
100 | 1 |
_aFreytag, Johann Christoph. _eauthor. |
|
245 | 1 | 0 |
_aTranslating Relational Queries into Iterative Programs _h[electronic resource] / _cby Johann Christoph Freytag. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1987. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1987. |
|
300 |
_aXIV, 134 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v261 |
|
505 | 0 | _aData 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. | |
520 | _aThis 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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aDatabase management. | |
650 | 0 | _aInformation storage and retrieval systems. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aDatabase Management. |
650 | 2 | 4 | _aInformation Storage and Retrieval. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540180005 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v261 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0055115 |
942 |
_2EBK6004 _cEBK |
||
999 |
_c35298 _d35298 |