000 03663nam a22005295i 4500
001 978-3-031-01856-5
003 DE-He213
005 20240730163733.0
007 cr nn 008mamaa
008 220601s2016 sz | s |||| 0|eng d
020 _a9783031018565
_9978-3-031-01856-5
024 7 _a10.1007/978-3-031-01856-5
_2doi
050 4 _aTK5105.5-5105.9
072 7 _aUKN
_2bicssc
072 7 _aCOM043000
_2bisacsh
072 7 _aUKN
_2thema
082 0 4 _a004.6
_223
100 1 _aBenedikt, Michael.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_980276
245 1 0 _aGenerating Plans from Proofs
_h[electronic resource] /
_cby Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura.
250 _a1st ed. 2016.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2016.
300 _aXIX, 185 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Data Management,
_x2153-5426
505 0 _aPreface -- 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 _aQuery 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.
650 0 _aComputer networks .
_931572
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 1 4 _aComputer Communication Networks.
_980277
650 2 4 _aData Structures and Information Theory.
_931923
700 1 _aLeblay, Julien.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_980278
700 1 _aCate, Balder ten.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_980279
700 1 _aTsamoura, Efthymia.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_980280
710 2 _aSpringerLink (Online service)
_980281
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031007286
776 0 8 _iPrinted edition:
_z9783031029844
830 0 _aSynthesis Lectures on Data Management,
_x2153-5426
_980282
856 4 0 _uhttps://doi.org/10.1007/978-3-031-01856-5
912 _aZDB-2-SXSC
942 _cEBK
999 _c84931
_d84931