Generating Plans from Proofs

Erscheinungsjahr 2016
ISBN: 978-3-031-00728-6
Verlag: Springer

Buch, Englisch, 185 Seiten, Format (B × H): 191 mm x 235 mm, Gewicht: 401 g

Reihe: 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 vocabularies, and also how it can be used to go from logic-based queries to programs.

Zielgruppe

Professional/practitioner

Autoren/Hrsg.

Benedikt, Michael

Leblay, Julien

Cate, Balder ten

Tsamoura, Efthymia

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie

Inhaltsverzeichnis

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.

Über Autor(innen)

Michael Benedikt is Professor of Computer Science at Oxford University and a fellow of University College Oxford. He came to Oxford after a decade in U.S. industrial research laboratories, including positions as Distinguished Member of Technical Staff at Bell Laboratories and visiting researcher at Yahoo! Labs. He has worked extensively in mathematical logic, finite model theory, verification, database theory, and database systems, and has served as chair of the ACM's main database theory conference, Principles of Database Systems. The current focus of his research is Web data management, with recent projects including querying of the deep Web, querying and integration of annotated data, and querying of web services.