000			03546nam a22004575i 4500
999			_c387264 _d387264
001			387264
003			ES-MaUEC
005			20230219124947.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2016 sz | s |||| 0|eng d
020			_a9783031018565
024	7		_a10.1007/978-3-031-01856-5 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9.D3 _b2016 EB
100	1		_aBenedikt, Michael _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687019 _q(Michael Abraham)
245	1	0	_aGenerating Plans from Proofs _cby Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura
250			_a1st edition 2016
264		1	_aCham _bSpringer International Publishing _c2016
300			_a1 recurso en línea (XIX, 185 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_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.
988			_aSynthesis Collection of Technology_2016
650		7	_2embne _9162648 _aData mining
650		7	_2embne _9147823 _aRecuperación de la información
650		7	_2embne _9144601 _aSQL (Lenguaje de programación)
700	1		_aLeblay, Julien, _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687020 _d1979-
700	1		_aCate, Balder David ten _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687021
700	1		_aTsamoura, Efthymia _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687022
776	0	8	_iPrinted edition: _z9783031007286
776	0	8	_iPrinted edition: _z9783031029844
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-01856-5 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2023 _dz _esc _zSI