| 書目名稱 | Generating Plans from Proofs | | 編輯 | Michael Benedikt,Julien Leblay,Efthymia Tsamoura | | 視頻video | http://file.papertrans.cn/383/382276/382276.mp4 | | 叢書名稱 | Synthesis Lectures on Data Management | | 圖書封面 |  | | 描述 | 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 vocabulari | | 出版日期 | Book 2016 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-01856-5 | | isbn_softcover | 978-3-031-00728-6 | | isbn_ebook | 978-3-031-01856-5Series ISSN 2153-5418 Series E-ISSN 2153-5426 | | issn_series | 2153-5418 | | copyright | Springer Nature Switzerland AG 2016 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-14 02:53
發(fā)表于 2025-3-21 17:33:59
