Preface |
|
xi | |
|
|
1 | (32) |
|
1 Data exchange by example |
|
|
3 | (9) |
|
1.1 A data exchange example |
|
|
3 | (6) |
|
1.2 Overview of the main tasks in data exchange |
|
|
9 | (2) |
|
1.3 Data exchange vs data integration |
|
|
11 | (1) |
|
|
12 | (17) |
|
2.1 Relational database model |
|
|
12 | (2) |
|
|
14 | (4) |
|
|
18 | (3) |
|
|
21 | (6) |
|
2.5 Basics of automata theory |
|
|
27 | (2) |
|
3 Data exchange: key definitions |
|
|
29 | (4) |
|
|
29 | (1) |
|
|
30 | (1) |
|
3.3 Query answering and rewriting |
|
|
31 | (1) |
|
3.4 Bibliographic comments |
|
|
32 | (1) |
|
PART TWO RELATIONAL DATA EXCHANGE |
|
|
33 | (100) |
|
4 The problem of relational data exchange |
|
|
35 | (8) |
|
|
35 | (4) |
|
|
39 | (4) |
|
|
43 | (13) |
|
5.1 The problem and easy cases |
|
|
43 | (1) |
|
5.2 Undecidability for st-tgds and target constraints |
|
|
44 | (2) |
|
|
46 | (3) |
|
5.4 Weak acyclicity of target constraints |
|
|
49 | (4) |
|
5.5 Complexity of the problem |
|
|
53 | (3) |
|
|
56 | (19) |
|
|
56 | (3) |
|
6.2 Existence of universal solutions |
|
|
59 | (6) |
|
6.3 Canonical universal solution and chase |
|
|
65 | (3) |
|
|
68 | (7) |
|
7 Query answering and rewriting |
|
|
75 | (22) |
|
7.1 Answering relational calculus queries |
|
|
75 | (1) |
|
7.2 Answering conjunctive queries |
|
|
76 | (2) |
|
7.3 Conjunctive queries with inequalities |
|
|
78 | (3) |
|
7.4 Tractable query answering with negation |
|
|
81 | (7) |
|
7.5 Rewritability over special solutions |
|
|
88 | (3) |
|
7.6 Non-rewritability tool: locality |
|
|
91 | (6) |
|
|
97 | (27) |
|
8.1 Universal solutions semantics |
|
|
98 | (4) |
|
8.2 Closed-world semantics |
|
|
102 | (10) |
|
8.3 Closed-world semantics and target constraints |
|
|
112 | (9) |
|
8.4 Clopen-world semantics |
|
|
121 | (3) |
|
|
124 | (9) |
|
|
124 | (1) |
|
9.2 Bibliographic comments |
|
|
125 | (1) |
|
|
126 | (7) |
|
PART THREE XML DATA EXCHANGE |
|
|
133 | (92) |
|
10 The problem of XML data exchange |
|
|
135 | (8) |
|
10.1 XML documents and schemas |
|
|
135 | (6) |
|
10.2 Key problems of XML data exchange |
|
|
141 | (2) |
|
|
143 | (15) |
|
11.1 Tree patterns: classification and complexity |
|
|
143 | (10) |
|
11.2 XML schema mappings and their complexity |
|
|
153 | (5) |
|
|
158 | (24) |
|
12.1 Building solutions revisited |
|
|
158 | (1) |
|
12.2 A simple exhaustive search algorithm |
|
|
159 | (3) |
|
12.3 Nested-relational DTDs |
|
|
162 | (6) |
|
12.4 The algorithm for regular schemas |
|
|
168 | (4) |
|
12.5 The general algorithm |
|
|
172 | (6) |
|
12.6 Combined complexity of solution building |
|
|
178 | (4) |
|
13 Answering tuple queries |
|
|
182 | (11) |
|
13.1 The query answering problem |
|
|
182 | (2) |
|
|
184 | (1) |
|
13.3 Sources of intractability |
|
|
185 | (4) |
|
13.4 Tractable query answering |
|
|
189 | (4) |
|
|
193 | (13) |
|
14.1 XML-to-XML query language TQL |
|
|
193 | (3) |
|
14.2 Notion of certain answers |
|
|
196 | (5) |
|
14.3 Certain answers for TQL queries |
|
|
201 | (2) |
|
14.4 XML-to-XML queries in data exchange |
|
|
203 | (3) |
|
15 XML data exchange via relations |
|
|
206 | (14) |
|
15.1 Translations and correctness |
|
|
206 | (3) |
|
15.2 Translations of schemas and documents |
|
|
209 | (4) |
|
15.3 Translations of patterns, mappings and queries |
|
|
213 | (4) |
|
15.4 Answering XML queries using relational data exchange |
|
|
217 | (3) |
|
16 Endnotes to Part Three |
|
|
220 | (5) |
|
|
220 | (1) |
|
16.2 Bibliographic comments |
|
|
221 | (1) |
|
|
221 | (4) |
|
PART FOUR METADATA MANAGEMENT |
|
|
225 | (96) |
|
17 What is metadata management? |
|
|
227 | (3) |
|
17.1 Reasoning about schema mappings |
|
|
227 | (1) |
|
17.2 Manipulating schema mappings |
|
|
228 | (2) |
|
18 Consistency of schema mappings |
|
|
230 | (19) |
|
|
230 | (1) |
|
|
231 | (7) |
|
18.3 Absolute consistency for XML |
|
|
238 | (11) |
|
|
249 | (23) |
|
19.1 The notion of composition and key problems |
|
|
249 | (2) |
|
19.2 Complexity of relational composition |
|
|
251 | (2) |
|
19.3 Extending st-tgds with second-order quantification |
|
|
253 | (8) |
|
19.4 Complexity of XML composition |
|
|
261 | (4) |
|
19.5 Tractable XML composition |
|
|
265 | (7) |
|
20 Inverting schema mappings |
|
|
272 | (28) |
|
20.1 A first definition of inverse |
|
|
272 | (8) |
|
20.2 Bringing exchanged data back: the recovery of a schema mapping |
|
|
280 | (7) |
|
20.3 Computing the inverse operator |
|
|
287 | (7) |
|
20.4 Inverses under extended semantics |
|
|
294 | (6) |
|
21 Structural characterizations of schema mapping |
|
|
300 | (12) |
|
21.1 Structural properties |
|
|
300 | (1) |
|
21.2 Schema mapping languages characterizations |
|
|
301 | (6) |
|
21.3 An application: simplifying schema mappings |
|
|
307 | (5) |
|
|
312 | (9) |
|
|
312 | (1) |
|
22.2 Bibliographic comments |
|
|
313 | (2) |
|
|
315 | (6) |
References |
|
321 | (6) |
Index |
|
327 | |