Muutke küpsiste eelistusi

E-raamat: Foundations of Data Exchange

(Pontificia Universidad Catolica de Chile), (Uniwersytet Warszawski, Poland), (Universidad de Chile), (University of Edinburgh)
  • Formaat: EPUB+DRM
  • Ilmumisaeg: 06-Mar-2014
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781107779396
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 32,10 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: EPUB+DRM
  • Ilmumisaeg: 06-Mar-2014
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781107779396
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

The problem of exchanging data between different databases with different schemas is an area of immense importance. Consequently data exchange has been one of the most active research topics in databases over the past decade. Foundational questions related to data exchange largely revolve around three key problems: how to build target solutions; how to answer queries over target solutions; and how to manipulate schema mappings themselves? The last question is also known under the name 'metadata management', since mappings represent metadata, rather than data in the database. In this book the authors summarize the key developments of a decade of research. Part I introduces the problem of data exchange via examples, both relational and XML; Part II deals with exchanging relational data; Part III focuses on exchanging XML data; and Part IV covers metadata management.

Muu info

Provides a summary of the key developments of a decade of research into the area of data exchange.
Preface xi
PART ONE GETTING STARTED
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)
2 Theoretical background
12(17)
2.1 Relational database model
12(2)
2.2 Query languages
14(4)
2.3 Incomplete data
18(3)
2.4 Complexity classes
21(6)
2.5 Basics of automata theory
27(2)
3 Data exchange: key definitions
29(4)
3.1 Schema mappings
29(1)
3.2 Solutions
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)
4.1 Key definitions
35(4)
4.2 Key problems
39(4)
5 Existence of solutions
43(13)
5.1 The problem and easy cases
43(1)
5.2 Undecidability for st-tgds and target constraints
44(2)
5.3 The chase
46(3)
5.4 Weak acyclicity of target constraints
49(4)
5.5 Complexity of the problem
53(3)
6 Good solutions
56(19)
6.1 Universal solutions
56(3)
6.2 Existence of universal solutions
59(6)
6.3 Canonical universal solution and chase
65(3)
6.4 The core
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)
8 Alternative semantics
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)
9 Endnotes to Part Two
124(9)
9.1 Summary
124(1)
9.2 Bibliographic comments
125(1)
9.3 Exercises
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)
11 Patterns and mappings
143(15)
11.1 Tree patterns: classification and complexity
143(10)
11.2 XML schema mappings and their complexity
153(5)
12 Building solutions
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)
13.2 An upper bound
184(1)
13.3 Sources of intractability
185(4)
13.4 Tractable query answering
189(4)
14 XML-to-XML queries
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)
16.1 Summary
220(1)
16.2 Bibliographic comments
221(1)
16.3 Exercises
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)
18.1 Problems statements
230(1)
18.2 Consistency for XML
231(7)
18.3 Absolute consistency for XML
238(11)
19 Mapping composition
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)
22 Endnotes to Part Four
312(9)
22.1 Summary
312(1)
22.2 Bibliographic comments
313(2)
22.3 Exercises
315(6)
References 321(6)
Index 327
Marcelo Arenas is an Associate Professor in the Department of Computer Science at the Pontificia Universidad Catolica de Chile. He received his PhD from the University of Toronto in 2005. His research interests are in different aspects of database theory, such as expressive power of query languages, database semantics, inconsistency handling, database design, XML databases, data exchange, metadata management and database aspects of the Semantic Web. He has received an IBM PhD Fellowship (2004), seven best paper awards (PODS 2003, PODS 2005, ISWC 2006, ICDT 2010, ESWC 2011, PODS 2011 and WWW 2012) and an ACM-SIGMOD Dissertation Award Honorable Mention in 2006 for his PhD dissertation 'Design Principles for XML Data'. He has served on multiple program committees, and since 2009 he has been participating as an invited expert in the World Wide Web Consortium. Pablo Barceló is an Assistant Professor in the Department of Computer Science at the University of Chile. He received his PhD from the University of Toronto in 2006. His main research interest is in the area of foundations of data management, in particular, query languages, data exchange, incomplete databases, and, recently, graph databases. He has served on program committees of some of the major conferences in database theory and the theoretical aspects of computer science (PODS, ICDT, CIKM, STACS, SIGMOD). Leonid Libkin is Professor of Foundations of Data Management in the School of Informatics at the University of Edinburgh. He was previously a Professor at the University of Toronto and a member of research staff at Bell Laboratories in Murray Hill. He received his PhD from the University of Pennsylvania in 1994. His main research interests are in the areas of data management and applications of logic in computer science. He has written four books and over 150 technical papers. He was the recipient of a Marie Curie Chair Award from the EU in 2006, and won four best paper awards. He has chaired programme committees of major database conferences (ACM PODS, ICDT) and was the conference chair of the 2010 Federated Logic Conference. He has given many invited conference talks and has served on multiple program committees and editorial boards. He is an ACM Fellow and a Fellow of the Royal Society of Edinburgh. Filip Murlak is an Assistant Professor in the Faculty of Mathematics, Informatics, and Mechanics at the University of Warsaw, Poland. Previously he was research fellow at the University of Edinburgh. He received his PhD from the University of Warsaw in 2008. His main research areas are automata theory and semi-structured data. He was the recipient of the best paper award at ICALP 2006, the Witold Lipski Prize for young researchers in 2008, and the Homing Plus scholarship from the Foundation for Polish Science in 2010. He was co-chair of MFCS 2011 and has served on program committees of several database and theoretical computer science conferences.