Generating Plans from Proofs (Record no. 84931)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03663nam a22005295i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-031-01856-5 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240730163733.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 220601s2016 sz | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783031018565 |
| -- | 978-3-031-01856-5 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 004.6 |
| 100 1# - AUTHOR NAME | |
| Author | Benedikt, Michael. |
| 245 10 - TITLE STATEMENT | |
| Title | Generating Plans from Proofs |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2016. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XIX, 185 p. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Synthesis Lectures on Data Management, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Preface -- Acknowledgments -- Introduction -- Vocabulary-based Target Restrictions -- Access Methods and Integrity Constraints -- Reformulation Algorithms for TGDs -- Low-cost Plans Via Proof Search -- Conclusion -- Bibliography -- Authors' Biographies -- Index. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | Query reformulation refers to a process of translating a source query-a request for information in some high-level logic-based language-into a target plan that abides by certain interface restrictions. Many practical problems in data management can be seen as instances of the reformulation problem. For example, the problem of translating an SQL query written over a set of base tables into another query written over a set of views; the problem of implementing a query via translating to a program calling a set of database APIs; the problem of implementing a query using a collection of web services. In this book we approach query reformulation in a very general setting that encompasses all the problems above, by relating it to a line of research within mathematical logic. For many decades logicians have looked at the problem of converting "implicit definitions" into "explicit definitions," using an approach known as interpolation. We will review the theory of interpolation, and explain its close connection with query reformulation. We will give a detailed look at how the interpolation-based approach is used to generate translations between logic-based queries over different vocabularies, and also how it can be used to go from logic-based queries to programs. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Leblay, Julien. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Cate, Balder ten. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Tsamoura, Efthymia. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://doi.org/10.1007/978-3-031-01856-5 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2016. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer networks . |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Data structures (Computer science). |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Information theory. |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Communication Networks. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Data Structures and Information Theory. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 2153-5426 |
| 912 ## - | |
| -- | ZDB-2-SXSC |
No items available.