Central Library

Normal view MARC view ISBD view

Generating Plans from Proofs [electronic resource] / by Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura.

By: Benedikt, Michael [author.].
Contributor(s): Leblay, Julien [author.] | Cate, Balder ten [author.] | Tsamoura, Efthymia [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Synthesis Lectures on Data Management: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2016Edition: 1st ed. 2016.Description: XIX, 185 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783031018565.Subject(s): Computer networks  | Data structures (Computer science) | Information theory | Computer Communication Networks | Data Structures and Information TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.6 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

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.

There are no comments for this item.

Log in to your account to post a comment.