Generating plans from proofs: the interpolation-based approach to query reformulation
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...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
[San Rafael, California]
Morgan & Claypool Publishers
[2016]
|
Schriftenreihe: | Synthesis lectures on data management
#43 |
Schlagworte: | |
Online-Zugang: | Volltext |
Zusammenfassung: | 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 |
Beschreibung: | Part of: Synthesis digital library of engineering and computer science Title from PDF title page (viewed on March 20, 2016) |
Beschreibung: | 1 Online-Resource (xix, 185 Seiten) Illustrationen |
ISBN: | 9781627059428 |
DOI: | 10.2200/S00703ED1V01Y201602DTM043 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV046427529 | ||
003 | DE-604 | ||
005 | 20211125 | ||
007 | cr|uuu---uuuuu | ||
008 | 200217s2016 |||| o||u| ||||||eng d | ||
020 | |a 9781627059428 |c ebook |9 978-1-62705-942-8 | ||
024 | 7 | |a 10.2200/S00703ED1V01Y201602DTM043 |2 doi | |
035 | |a (ZDB-105-MCS)7437539 | ||
035 | |a (OCoLC)1141118250 | ||
035 | |a (DE-599)BVBBV046427529 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-83 | ||
082 | 0 | |a 005.7565 |2 23 | |
100 | 1 | |a Benedikt, Michael |e Verfasser |0 (DE-588)1122444656 |4 aut | |
245 | 1 | 0 | |a Generating plans from proofs |b the interpolation-based approach to query reformulation |c Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura |
264 | 1 | |a [San Rafael, California] |b Morgan & Claypool Publishers |c [2016] | |
264 | 4 | |c © 2016 | |
300 | |a 1 Online-Resource (xix, 185 Seiten) |b Illustrationen | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Synthesis lectures on data management |v #43 | |
500 | |a Part of: Synthesis digital library of engineering and computer science | ||
500 | |a Title from PDF title page (viewed on March 20, 2016) | ||
520 | |a 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 | ||
650 | 4 | |a Querying (Computer science) | |
650 | 0 | 7 | |a Abfragesprache |0 (DE-588)4134011-5 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Abfragesprache |0 (DE-588)4134011-5 |D s |
689 | 0 | 1 | |a Abfragesprache |0 (DE-588)4134011-5 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Leblay, Julien |e Verfasser |0 (DE-588)1122444923 |4 aut | |
700 | 1 | |a Cate, Balder ten |e Verfasser |0 (DE-588)1074876830 |4 aut | |
700 | 1 | |a Tsamoura, Efthymia |e Verfasser |0 (DE-588)1122444834 |4 aut | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-62705-954-1 |
830 | 0 | |a Synthesis lectures on data management |v #43 |w (DE-604)BV036731811 |9 43 | |
856 | 4 | 0 | |u https://doi.org/10.2200/S00703ED1V01Y201602DTM043 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-105-MCS |a ZDB-105-MCDM | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-031839832 |
Datensatz im Suchindex
_version_ | 1804180976757112832 |
---|---|
any_adam_object | |
author | Benedikt, Michael Leblay, Julien Cate, Balder ten Tsamoura, Efthymia |
author_GND | (DE-588)1122444656 (DE-588)1122444923 (DE-588)1074876830 (DE-588)1122444834 |
author_facet | Benedikt, Michael Leblay, Julien Cate, Balder ten Tsamoura, Efthymia |
author_role | aut aut aut aut |
author_sort | Benedikt, Michael |
author_variant | m b mb j l jl b t c bt btc e t et |
building | Verbundindex |
bvnumber | BV046427529 |
collection | ZDB-105-MCS ZDB-105-MCDM |
ctrlnum | (ZDB-105-MCS)7437539 (OCoLC)1141118250 (DE-599)BVBBV046427529 |
dewey-full | 005.7565 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.7565 |
dewey-search | 005.7565 |
dewey-sort | 15.7565 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
doi_str_mv | 10.2200/S00703ED1V01Y201602DTM043 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03322nmm a2200493zcb4500</leader><controlfield tag="001">BV046427529</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20211125 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200217s2016 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781627059428</subfield><subfield code="c">ebook</subfield><subfield code="9">978-1-62705-942-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.2200/S00703ED1V01Y201602DTM043</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-105-MCS)7437539</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1141118250</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046427529</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.7565</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Benedikt, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1122444656</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Generating plans from proofs</subfield><subfield code="b">the interpolation-based approach to query reformulation</subfield><subfield code="c">Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[San Rafael, California]</subfield><subfield code="b">Morgan & Claypool Publishers</subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Resource (xix, 185 Seiten)</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Synthesis lectures on data management</subfield><subfield code="v">#43</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Part of: Synthesis digital library of engineering and computer science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from PDF title page (viewed on March 20, 2016)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Querying (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abfragesprache</subfield><subfield code="0">(DE-588)4134011-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Abfragesprache</subfield><subfield code="0">(DE-588)4134011-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Abfragesprache</subfield><subfield code="0">(DE-588)4134011-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leblay, Julien</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1122444923</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cate, Balder ten</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1074876830</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tsamoura, Efthymia</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1122444834</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-62705-954-1</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Synthesis lectures on data management</subfield><subfield code="v">#43</subfield><subfield code="w">(DE-604)BV036731811</subfield><subfield code="9">43</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.2200/S00703ED1V01Y201602DTM043</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-105-MCS</subfield><subfield code="a">ZDB-105-MCDM</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031839832</subfield></datafield></record></collection> |
id | DE-604.BV046427529 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T08:44:19Z |
institution | BVB |
isbn | 9781627059428 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031839832 |
oclc_num | 1141118250 |
open_access_boolean | |
owner | DE-83 |
owner_facet | DE-83 |
physical | 1 Online-Resource (xix, 185 Seiten) Illustrationen |
psigel | ZDB-105-MCS ZDB-105-MCDM |
publishDate | 2016 |
publishDateSearch | 2016 |
publishDateSort | 2016 |
publisher | Morgan & Claypool Publishers |
record_format | marc |
series | Synthesis lectures on data management |
series2 | Synthesis lectures on data management |
spelling | Benedikt, Michael Verfasser (DE-588)1122444656 aut Generating plans from proofs the interpolation-based approach to query reformulation Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura [San Rafael, California] Morgan & Claypool Publishers [2016] © 2016 1 Online-Resource (xix, 185 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier Synthesis lectures on data management #43 Part of: Synthesis digital library of engineering and computer science Title from PDF title page (viewed on March 20, 2016) 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 Querying (Computer science) Abfragesprache (DE-588)4134011-5 gnd rswk-swf Abfragesprache (DE-588)4134011-5 s DE-604 Leblay, Julien Verfasser (DE-588)1122444923 aut Cate, Balder ten Verfasser (DE-588)1074876830 aut Tsamoura, Efthymia Verfasser (DE-588)1122444834 aut Erscheint auch als Druck-Ausgabe 978-1-62705-954-1 Synthesis lectures on data management #43 (DE-604)BV036731811 43 https://doi.org/10.2200/S00703ED1V01Y201602DTM043 Verlag URL des Erstveröffentlichers Volltext |
spellingShingle | Benedikt, Michael Leblay, Julien Cate, Balder ten Tsamoura, Efthymia Generating plans from proofs the interpolation-based approach to query reformulation Synthesis lectures on data management Querying (Computer science) Abfragesprache (DE-588)4134011-5 gnd |
subject_GND | (DE-588)4134011-5 |
title | Generating plans from proofs the interpolation-based approach to query reformulation |
title_auth | Generating plans from proofs the interpolation-based approach to query reformulation |
title_exact_search | Generating plans from proofs the interpolation-based approach to query reformulation |
title_full | Generating plans from proofs the interpolation-based approach to query reformulation Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura |
title_fullStr | Generating plans from proofs the interpolation-based approach to query reformulation Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura |
title_full_unstemmed | Generating plans from proofs the interpolation-based approach to query reformulation Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura |
title_short | Generating plans from proofs |
title_sort | generating plans from proofs the interpolation based approach to query reformulation |
title_sub | the interpolation-based approach to query reformulation |
topic | Querying (Computer science) Abfragesprache (DE-588)4134011-5 gnd |
topic_facet | Querying (Computer science) Abfragesprache |
url | https://doi.org/10.2200/S00703ED1V01Y201602DTM043 |
volume_link | (DE-604)BV036731811 |
work_keys_str_mv | AT benediktmichael generatingplansfromproofstheinterpolationbasedapproachtoqueryreformulation AT leblayjulien generatingplansfromproofstheinterpolationbasedapproachtoqueryreformulation AT catebalderten generatingplansfromproofstheinterpolationbasedapproachtoqueryreformulation AT tsamouraefthymia generatingplansfromproofstheinterpolationbasedapproachtoqueryreformulation |