Consistency and trust in peer data exchange systems
We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that chara...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
BERTOSSI, LEOPOLDO [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2017 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Theory and practice of logic programming - Cambridge : Cambridge Univ. Press, 2001, 17(2017), 2, Seite 148-204 |
|---|---|
| Übergeordnetes Werk: |
volume:17 ; year:2017 ; number:2 ; pages:148-204 |
| Links: |
|---|
| DOI / URN: |
10.1017/S147106841600017X |
|---|
| Katalog-ID: |
OLC1993566511 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1993566511 | ||
| 003 | DE-627 | ||
| 005 | 20220214180614.0 | ||
| 007 | tu | ||
| 008 | 170512s2017 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1017/S147106841600017X |2 doi | |
| 028 | 5 | 2 | |a PQ20170721 |
| 035 | |a (DE-627)OLC1993566511 | ||
| 035 | |a (DE-599)GBVOLC1993566511 | ||
| 035 | |a (PRQ)a2262-40daffaf12b8f63c91b69ce5ab6dc1232323f75c1f2863f864c5557db429e4fd0 | ||
| 035 | |a (KEY)0435171120170000017000200148consistencyandtrustinpeerdataexchangesystems | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q DNB |
| 084 | |a 54.71 |2 bkl | ||
| 100 | 1 | |a BERTOSSI, LEOPOLDO |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Consistency and trust in peer data exchange systems |
| 264 | 1 | |c 2017 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints. | ||
| 650 | 4 | |a Databases | |
| 650 | 4 | |a Logic in Computer Science | |
| 650 | 4 | |a Artificial Intelligence | |
| 650 | 4 | |a Computer Science | |
| 700 | 1 | |a BRAVO, LORETO |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t Theory and practice of logic programming |d Cambridge : Cambridge Univ. Press, 2001 |g 17(2017), 2, Seite 148-204 |w (DE-627)327305304 |w (DE-600)2042851-0 |w (DE-576)092159281 |x 1471-0684 |7 nnns |
| 773 | 1 | 8 | |g volume:17 |g year:2017 |g number:2 |g pages:148-204 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1017/S147106841600017X |3 Volltext |
| 856 | 4 | 2 | |u https://search.proquest.com/docview/1864046849 |
| 856 | 4 | 2 | |u http://arxiv.org/abs/1606.01930 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 936 | b | k | |a 54.71 |q AVZ |
| 951 | |a AR | ||
| 952 | |d 17 |j 2017 |e 2 |h 148-204 | ||
| author_variant |
l b lb |
|---|---|
| matchkey_str |
article:14710684:2017----::ossecadrsipedtec |
| hierarchy_sort_str |
2017 |
| bklnumber |
54.71 |
| publishDate |
2017 |
| allfields |
10.1017/S147106841600017X doi PQ20170721 (DE-627)OLC1993566511 (DE-599)GBVOLC1993566511 (PRQ)a2262-40daffaf12b8f63c91b69ce5ab6dc1232323f75c1f2863f864c5557db429e4fd0 (KEY)0435171120170000017000200148consistencyandtrustinpeerdataexchangesystems DE-627 ger DE-627 rakwb eng 004 DNB 54.71 bkl BERTOSSI, LEOPOLDO verfasserin aut Consistency and trust in peer data exchange systems 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints. Databases Logic in Computer Science Artificial Intelligence Computer Science BRAVO, LORETO oth Enthalten in Theory and practice of logic programming Cambridge : Cambridge Univ. Press, 2001 17(2017), 2, Seite 148-204 (DE-627)327305304 (DE-600)2042851-0 (DE-576)092159281 1471-0684 nnns volume:17 year:2017 number:2 pages:148-204 http://dx.doi.org/10.1017/S147106841600017X Volltext https://search.proquest.com/docview/1864046849 http://arxiv.org/abs/1606.01930 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT 54.71 AVZ AR 17 2017 2 148-204 |
| spelling |
10.1017/S147106841600017X doi PQ20170721 (DE-627)OLC1993566511 (DE-599)GBVOLC1993566511 (PRQ)a2262-40daffaf12b8f63c91b69ce5ab6dc1232323f75c1f2863f864c5557db429e4fd0 (KEY)0435171120170000017000200148consistencyandtrustinpeerdataexchangesystems DE-627 ger DE-627 rakwb eng 004 DNB 54.71 bkl BERTOSSI, LEOPOLDO verfasserin aut Consistency and trust in peer data exchange systems 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints. Databases Logic in Computer Science Artificial Intelligence Computer Science BRAVO, LORETO oth Enthalten in Theory and practice of logic programming Cambridge : Cambridge Univ. Press, 2001 17(2017), 2, Seite 148-204 (DE-627)327305304 (DE-600)2042851-0 (DE-576)092159281 1471-0684 nnns volume:17 year:2017 number:2 pages:148-204 http://dx.doi.org/10.1017/S147106841600017X Volltext https://search.proquest.com/docview/1864046849 http://arxiv.org/abs/1606.01930 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT 54.71 AVZ AR 17 2017 2 148-204 |
| allfields_unstemmed |
10.1017/S147106841600017X doi PQ20170721 (DE-627)OLC1993566511 (DE-599)GBVOLC1993566511 (PRQ)a2262-40daffaf12b8f63c91b69ce5ab6dc1232323f75c1f2863f864c5557db429e4fd0 (KEY)0435171120170000017000200148consistencyandtrustinpeerdataexchangesystems DE-627 ger DE-627 rakwb eng 004 DNB 54.71 bkl BERTOSSI, LEOPOLDO verfasserin aut Consistency and trust in peer data exchange systems 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints. Databases Logic in Computer Science Artificial Intelligence Computer Science BRAVO, LORETO oth Enthalten in Theory and practice of logic programming Cambridge : Cambridge Univ. Press, 2001 17(2017), 2, Seite 148-204 (DE-627)327305304 (DE-600)2042851-0 (DE-576)092159281 1471-0684 nnns volume:17 year:2017 number:2 pages:148-204 http://dx.doi.org/10.1017/S147106841600017X Volltext https://search.proquest.com/docview/1864046849 http://arxiv.org/abs/1606.01930 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT 54.71 AVZ AR 17 2017 2 148-204 |
| allfieldsGer |
10.1017/S147106841600017X doi PQ20170721 (DE-627)OLC1993566511 (DE-599)GBVOLC1993566511 (PRQ)a2262-40daffaf12b8f63c91b69ce5ab6dc1232323f75c1f2863f864c5557db429e4fd0 (KEY)0435171120170000017000200148consistencyandtrustinpeerdataexchangesystems DE-627 ger DE-627 rakwb eng 004 DNB 54.71 bkl BERTOSSI, LEOPOLDO verfasserin aut Consistency and trust in peer data exchange systems 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints. Databases Logic in Computer Science Artificial Intelligence Computer Science BRAVO, LORETO oth Enthalten in Theory and practice of logic programming Cambridge : Cambridge Univ. Press, 2001 17(2017), 2, Seite 148-204 (DE-627)327305304 (DE-600)2042851-0 (DE-576)092159281 1471-0684 nnns volume:17 year:2017 number:2 pages:148-204 http://dx.doi.org/10.1017/S147106841600017X Volltext https://search.proquest.com/docview/1864046849 http://arxiv.org/abs/1606.01930 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT 54.71 AVZ AR 17 2017 2 148-204 |
| allfieldsSound |
10.1017/S147106841600017X doi PQ20170721 (DE-627)OLC1993566511 (DE-599)GBVOLC1993566511 (PRQ)a2262-40daffaf12b8f63c91b69ce5ab6dc1232323f75c1f2863f864c5557db429e4fd0 (KEY)0435171120170000017000200148consistencyandtrustinpeerdataexchangesystems DE-627 ger DE-627 rakwb eng 004 DNB 54.71 bkl BERTOSSI, LEOPOLDO verfasserin aut Consistency and trust in peer data exchange systems 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints. Databases Logic in Computer Science Artificial Intelligence Computer Science BRAVO, LORETO oth Enthalten in Theory and practice of logic programming Cambridge : Cambridge Univ. Press, 2001 17(2017), 2, Seite 148-204 (DE-627)327305304 (DE-600)2042851-0 (DE-576)092159281 1471-0684 nnns volume:17 year:2017 number:2 pages:148-204 http://dx.doi.org/10.1017/S147106841600017X Volltext https://search.proquest.com/docview/1864046849 http://arxiv.org/abs/1606.01930 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT 54.71 AVZ AR 17 2017 2 148-204 |
| language |
English |
| source |
Enthalten in Theory and practice of logic programming 17(2017), 2, Seite 148-204 volume:17 year:2017 number:2 pages:148-204 |
| sourceStr |
Enthalten in Theory and practice of logic programming 17(2017), 2, Seite 148-204 volume:17 year:2017 number:2 pages:148-204 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Databases Logic in Computer Science Artificial Intelligence Computer Science |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Theory and practice of logic programming |
| authorswithroles_txt_mv |
BERTOSSI, LEOPOLDO @@aut@@ BRAVO, LORETO @@oth@@ |
| publishDateDaySort_date |
2017-01-01T00:00:00Z |
| hierarchy_top_id |
327305304 |
| dewey-sort |
14 |
| id |
OLC1993566511 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1993566511</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220214180614.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">170512s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/S147106841600017X</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170721</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1993566511</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1993566511</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)a2262-40daffaf12b8f63c91b69ce5ab6dc1232323f75c1f2863f864c5557db429e4fd0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0435171120170000017000200148consistencyandtrustinpeerdataexchangesystems</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.71</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">BERTOSSI, LEOPOLDO</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Consistency and trust in peer data exchange systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">BRAVO, LORETO</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theory and practice of logic programming</subfield><subfield code="d">Cambridge : Cambridge Univ. Press, 2001</subfield><subfield code="g">17(2017), 2, Seite 148-204</subfield><subfield code="w">(DE-627)327305304</subfield><subfield code="w">(DE-600)2042851-0</subfield><subfield code="w">(DE-576)092159281</subfield><subfield code="x">1471-0684</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:17</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:148-204</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1017/S147106841600017X</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://search.proquest.com/docview/1864046849</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://arxiv.org/abs/1606.01930</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.71</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">17</subfield><subfield code="j">2017</subfield><subfield code="e">2</subfield><subfield code="h">148-204</subfield></datafield></record></collection>
|
| author |
BERTOSSI, LEOPOLDO |
| spellingShingle |
BERTOSSI, LEOPOLDO ddc 004 bkl 54.71 misc Databases misc Logic in Computer Science misc Artificial Intelligence misc Computer Science Consistency and trust in peer data exchange systems |
| authorStr |
BERTOSSI, LEOPOLDO |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)327305304 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1471-0684 |
| topic_title |
004 DNB 54.71 bkl Consistency and trust in peer data exchange systems Databases Logic in Computer Science Artificial Intelligence Computer Science |
| topic |
ddc 004 bkl 54.71 misc Databases misc Logic in Computer Science misc Artificial Intelligence misc Computer Science |
| topic_unstemmed |
ddc 004 bkl 54.71 misc Databases misc Logic in Computer Science misc Artificial Intelligence misc Computer Science |
| topic_browse |
ddc 004 bkl 54.71 misc Databases misc Logic in Computer Science misc Artificial Intelligence misc Computer Science |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
l b lb |
| hierarchy_parent_title |
Theory and practice of logic programming |
| hierarchy_parent_id |
327305304 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Theory and practice of logic programming |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)327305304 (DE-600)2042851-0 (DE-576)092159281 |
| title |
Consistency and trust in peer data exchange systems |
| ctrlnum |
(DE-627)OLC1993566511 (DE-599)GBVOLC1993566511 (PRQ)a2262-40daffaf12b8f63c91b69ce5ab6dc1232323f75c1f2863f864c5557db429e4fd0 (KEY)0435171120170000017000200148consistencyandtrustinpeerdataexchangesystems |
| title_full |
Consistency and trust in peer data exchange systems |
| author_sort |
BERTOSSI, LEOPOLDO |
| journal |
Theory and practice of logic programming |
| journalStr |
Theory and practice of logic programming |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2017 |
| contenttype_str_mv |
txt |
| container_start_page |
148 |
| author_browse |
BERTOSSI, LEOPOLDO |
| container_volume |
17 |
| class |
004 DNB 54.71 bkl |
| format_se |
Aufsätze |
| author-letter |
BERTOSSI, LEOPOLDO |
| doi_str_mv |
10.1017/S147106841600017X |
| dewey-full |
004 |
| title_sort |
consistency and trust in peer data exchange systems |
| title_auth |
Consistency and trust in peer data exchange systems |
| abstract |
We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints. |
| abstractGer |
We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints. |
| abstract_unstemmed |
We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT |
| container_issue |
2 |
| title_short |
Consistency and trust in peer data exchange systems |
| url |
http://dx.doi.org/10.1017/S147106841600017X https://search.proquest.com/docview/1864046849 http://arxiv.org/abs/1606.01930 |
| remote_bool |
false |
| author2 |
BRAVO, LORETO |
| author2Str |
BRAVO, LORETO |
| ppnlink |
327305304 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1017/S147106841600017X |
| up_date |
2024-07-03T14:56:20.433Z |
| _version_ |
1803570202992967680 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1993566511</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220214180614.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">170512s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/S147106841600017X</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170721</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1993566511</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1993566511</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)a2262-40daffaf12b8f63c91b69ce5ab6dc1232323f75c1f2863f864c5557db429e4fd0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0435171120170000017000200148consistencyandtrustinpeerdataexchangesystems</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.71</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">BERTOSSI, LEOPOLDO</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Consistency and trust in peer data exchange systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended - possibly virtual - instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">BRAVO, LORETO</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theory and practice of logic programming</subfield><subfield code="d">Cambridge : Cambridge Univ. Press, 2001</subfield><subfield code="g">17(2017), 2, Seite 148-204</subfield><subfield code="w">(DE-627)327305304</subfield><subfield code="w">(DE-600)2042851-0</subfield><subfield code="w">(DE-576)092159281</subfield><subfield code="x">1471-0684</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:17</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:148-204</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1017/S147106841600017X</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://search.proquest.com/docview/1864046849</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://arxiv.org/abs/1606.01930</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.71</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">17</subfield><subfield code="j">2017</subfield><subfield code="e">2</subfield><subfield code="h">148-204</subfield></datafield></record></collection>
|
| score |
7.399496 |