Data integration is harder than you thought
|
|
- Margery Sherman
- 8 years ago
- Views:
Transcription
1 Data integation is hade than you thought Mauizio Lenzeini Diatimento di Infomatica e Sistemistica Univesità di Roma La Saienza CooIS 2001 Setembe 5, 2001 Tento, Italy
2 Outline Intoduction to data integation Aoaches to modeling and queying Case study in LAV: had Case study in GAV: hade than you thought Beyond LAV and GAV: even hade Conclusions Mauizio Lenzeini Data Integation 1
3 Achitectue fo data integation Quey Alication Mediato Global schema Data Waehouse Wae Wae Local schema Local schema Local schema Souce Souce Souce Mauizio Lenzeini Data Integation 2
4 Main oblems in data integation 1. Heteogeinity of souces (intensional and extensional level) 2. Limitations in the mechanisms fo accessing the souces 3. Mateialized vs vitual integation 4. Data extaction, cleaning and econciliation 5. How to ocess udates exessed on the global schema, and udates exessed on the souces 6. The queying oblem: How to answe queies exessed on the global schema 7. The modeling oblem: How to model the global schema, the souces, and the elationshis between the two Mauizio Lenzeini Data Integation 3
5 The queying oblem Each quey is exessed in tems of the global schema, and the associated mediato must efomulate the quey in tems of a set of queies at the souces The cucial ste is deciding the quey lan, i.e., how to decomose the quey into a set of subqueies to the souces The comuted subqueies ae then shied to the souces, and the esults ae assembled into the final answe Mauizio Lenzeini Data Integation 4
6 Quality in quey answeing The data integation system should be designed in such a way that suitable quality citeia ae met. Hee, we concentate on: Soundness: the answe to queies includes nothing but the tuth Comleteness: the answe to queies includes the whole tuth We aim at the whole tuth, and nothing but the tuth. But, what the tuth is deends on the aoach adoted fo modeling. Mauizio Lenzeini Data Integation 5
7 The modeling oblem Global schema Maing R 1 C 1 D 1 T 1 c 1 d 1 t 1 c 2 d 2 t 2 Souce stuctue Souce stuctue Souce 1 Souce 2 Mauizio Lenzeini Data Integation 6
8 Outline Intoduction to data integation Aoaches to modeling and queying Case study in LAV Case study in GAV Beyond LAV and GAV Conclusions Mauizio Lenzeini Data Integation 7
9 The modeling oblem: fundamental questions How do we model the global schema (stuctued vs semistuctued) How do we model the souces (concetual and stuctual level) How do we model the elationshi between the global schema and the souces Ae the souces defined in tems of the global schema (this aoach is called souce-centic, o local-as-view, o LAV)? Is the global schema defined in tems of the souces (this aoach is called global-schema-centic, o global-as-view, o GAV)? A mixed aoach? Mauizio Lenzeini Data Integation 8
10 The modeling oblem: fomal famewok A data integation system D is a tile G, S, M, whee G is the global schema (stuctue and constaints), S is the souce schema (stuctues and constaints), and M is the maing between G and S. Semantics of D: which data satisfy G? We have to stat with a souce database C (souce data coheent with S): sem C (D) = { B B is a database that is legal fo D wt C, i.e., that satisfies both G and M wt C } A quey q to D is exessed ove G. If q has aity n, then the answe to q wt D and C is q D,C = {(c 1,..., c n ) (c 1,..., c n ) q B B sem C (D)} Mauizio Lenzeini Data Integation 9
11 Global-as-view vs local-as-view Examle Global schema: movie(title, Yea, Diecto) euoean(diecto) eview(title, Citique) Souce 1: 1 (Title, Yea, Diecto) since 1960, euoean diectos Souce 2: 2 (T itle, Citique) since 1990 Quey: Title and citique of movies in 1998 { (T, R) D. movie(t, 1998, D) eview(t, R) }, witten { (T, R) movie(t, 1998, D) eview(t, R) } Mauizio Lenzeini Data Integation 10
12 Local-as-view Global schema LAV Souce This souce contains. Mauizio Lenzeini Data Integation 11
13 Fomalization of LAV In LAV, the maing M is constituted by a set of assetions: s φ G one fo each souce stuctue s in S, whee φ G is a quey ove G. Given souce data C, a database B satisfies M wt C if fo each souce s S: s C φ B G The maing M does not ovide diect infomation about which data satisfies the global schema. To answe a quey q ove G, we have to infe how to use M in ode to access the souce data C. Answeing queies is an infeence ocess, which is simila to answeing queies with incomlete infomation. Mauizio Lenzeini Data Integation 12
14 Local-as-view Examle Global schema: movie(title, Yea, Diecto) euoean(diecto) eview(title, Citique) Local-as-view: associated to elations at the souces we have views ove the global schema 1 (T, Y, D) { (T, Y, D) movie(t, Y, D) euoean(d) Y 1960 } 2 (T, R) { (T, R) movie(t, Y, D) eview(t, R) Y 1990 } The quey { (T, R) movie(t, 1998, D) eview(t, R) } is ocessed by means of an infeence mechanism that aims at e-exessing the atoms of the global schema in tems of atoms at the souces. In this case: { (T, R) 2 (T, R) 1 (T, 1998, D) } Mauizio Lenzeini Data Integation 13
15 Quey ocessing in LAV Answeing queies in LAV is like solving a mistey case: Souces eesent eliable witnesses Witnesses know at of the stoy, and souce data eesent what they know We have an exlicit eesentation of what the witnesses know We have to solve the case (answeing queies) based on the infomation we ae able to gathe fom the witnesses Infeence is needed Mauizio Lenzeini Data Integation 14
16 Global-as-view Global schema A Global schema Souce LAV This souce contains. Souce GAV The data of A ae taken fom souce 1 and Mauizio Lenzeini Data Integation 15
17 Fomalization of GAV In GAV, the maing M is constituted by a set of assetions: g φ S one fo each stuctue g in G, whee φ S is a quey ove S. Given souce data C, a database B satisfies M wt C if fo each g G: φ C S g B The maing M ovides diect infomation about which data satisfies the global schema. Thus, given a quey q ove G, it seems that we can simly evaluate the quey ove these data (as if we had a single database at hand). Moe on this late... Mauizio Lenzeini Data Integation 16
18 Global-as-view Examle Global schema: movie(title, Yea, Diecto) euoean(diecto) eview(title, Citique) Global-as-view: associated to elations in the global schema we have views ove the souces movie(t, Y, D) { (T, Y, D) 1 (T, Y, D) } euoean(d) { (D) 1 (T, Y, D) } eview(t, R) { (T, R) 2 (T, R) } Mauizio Lenzeini Data Integation 17
19 Global-as-view Examle of quey ocessing The quey { (T, R) movie(t, 1998, D) eview(t, R) } is ocessed by means of unfolding, i.e., by exanding the atoms accoding to thei definitions, so as to come u with souce elations. In this case: movie(t,1998,d) eview(t,r) unfolding 1 (T,1998,D) 2 (T,R) Mauizio Lenzeini Data Integation 18
20 Quey ocessing in GAV We do not have any exlicit eesentation of what the witnesses know All the infomation that the witnesses can ovide have been comiled into an investigation eot (the global schema, and the maing) Solving the case (answeing queies) means basically looking at the investigation eot Mauizio Lenzeini Data Integation 19
21 Global-as-view and local-as-view Comaison Local-as-view: (Infomation Manifold, DWQ, Picsel) Quality deends on how well we have chaacteized the souces High modulaity and eusability (if the global schema is well designed, when a souce changes, only its definition is affected) Quey ocessing needs easoning (quey efomulation comlex) Global-as-view: (Canot, SIMS, Tsimmis,... ) Quality deends on how well we have comiled the souces into the global schema though the maing Wheneve a souce changes o a new one is added, the global schema needs to be econsideed Quey ocessing can be based on some sot of unfolding (quey efomulation looks easie) Fo moe details, see [Ullman, TCS 2000], [Halevy, SIGMOD 2000]. Mauizio Lenzeini Data Integation 20
22 Outline Intoduction to data integation Aoaches to modeling and queying Case study in LAV Case study in GAV Beyond LAV and GAV Conclusions Mauizio Lenzeini Data Integation 21
23 A case study in LAV We deal with the oblem of answeing queies to data integation systems of the fom G, S, M, whee the global schema G is semi-stuctued the souces in S ae elational the maing M is of tye LAV queies ae tyical of semi-stuctued data Mauizio Lenzeini Data Integation 22
24 The quey answeing oblem Given data integation system D = G, S, M, souce database C, quey q, and tule t, check whethe t q D,C (i.e., whethe t q B fo all B sem C (D)). Recent esults: Comlexity fo seveal quey and view languages [Abiteboul et al, PODS 98], [Gahne et al, ICDT 99] Schemas exessed in Descition Logics [Calvanese et al, AAAI 2000] Regula ath queies without invese [Calvanese et al, ICDE 2000] and with invese [Calvanese et al, PODS 2000] Conjunctive RPQIs [Calvanese et al, KR 2000], [Calvanese et al, LICS 2000], [Calvanese et al, DBPL 2001] Mauizio Lenzeini Data Integation 23
25 Global databases and queies sub sub sub sub calls sub sub calls sub va calls sub va sub va va RPQ: RPQI: (sub) (sub (calls sub)) va (sub ) (va sub) Mauizio Lenzeini Data Integation 24
26 Regula ath queies with invese Regula-ath queies with invese (RPQIs) ae exessed by means of finite-state automata ove Σ = Σ { Σ } ( denotes the invese of the binay elation ). ( q) ( ) q q q _ q q Mauizio Lenzeini Data Integation 25
27 Finite state automata and RPQIs. a b c q d. Conside the quey Automaton fo Q Q = ( q) q q s 1 δ(s 0, ), s 2 δ(s 1, ), s 2 δ(s 1, q), s 3 δ(s 2, ), s 4 δ(s 3, ), s 5 δ(s 4, q), s 5 δ(s 5, q) The comutation fo RPQIs is not comletely catued by finite state automata. Mauizio Lenzeini Data Integation 26
28 Two-way automata A two-way automaton A = (Γ, S, S 0, ρ, F ) consists of an alhabet Γ, a finite set of states S, a set of initial states S 0 S, a tansition function ρ : S Σ 2 S { 1,0,1} and a set of acceting states F S. Given a two-way automaton A with n states, one can constuct a one-way automaton B 1 with O(2 n log n ) states such that L(B 1 ) = L(A), and a one-way automaton B 2 with O(2 n ) states such that L(B 2 ) = Γ L(A). Mauizio Lenzeini Data Integation 27
29 Two-way automata and RPQIs. a b c q d. Conside the quey Automaton fo Q Q = ( q) q q s 1 δ(s 0, ), s 2 δ(s 1, ), s 2 δ(s 1, q), s 3 δ(s 2, ), s 4 δ(s 3, ), s 5 δ(s 4, q), s 5 δ(s 5, q) 2way automaton (s 1, 1) δ A (s 0, ), (s 2, 1) δ A (s 1, ), (s 2, 1) δ A (s 2, q), (s 3, 0) δ A (s 2, ), (s 4, 1) δ A (s 3, ), (s 5, 1) δ A (s 4, q), (s f, 1) δ A (s 5, $) Mauizio Lenzeini Data Integation 28
30 Two-way automata and RPQIs Given an RPQI E = (Σ, S, I, δ, F ) ove the alhabet Σ, the coesonding two-way automaton A E is: (Σ A = Σ {$}, S A = S {s f } {s s S}, I, δ A, {s f }) whee δ A is defined as follows: (s 2, 1) δ A (s 1, ), fo each tansition s 2 δ(s 1, ) of E ente backwad mode: (s, 1) δ A (s, l), fo each s S and l Σ A exit backwad mode: (s 2, 0) δ A (s 1, ), fo each tansition s 2 δ(s 1, ) of E (s f, 1) δ A (s, $), fo each s F. = w satisfies E iff w$ L(A E ). Mauizio Lenzeini Data Integation 29
31 Quey answeing: basic idea Given D = G, S, M, souce database C, quey q, and tule (c, d), we seach fo a counteexamle to (c, d) q C,D, i.e., a database B sem C (D) such that (c, d) q B. Each counteexamle DB B can be eesented by a wod w B ove the alhabet Σ A = Σ C {$}, which has the fom $ d 1 w 1 d 2 $ d 3 w 2 d 4 $ $ d 2m 1 w m d 2m $ whee d 1,..., d 2m ange ove data objects in C (simly denoted by C), w i Σ +, and the $ acts as a seaato. Mauizio Lenzeini Data Integation 30
32 Two-way automata and canonical DBs Global schema G: ( q q ) Souces: q ( ) ( q) (q ) (d 1,d 2 ) (d 4,d 5 ) (d 4,d 2 ) (d 3,d 3 ) (d 2,d 3 ) Database fo G: q d 1 d 2 d 3 d 4 d 5 Mauizio Lenzeini Data Integation 31
33 Two-way automata and canonical DBs q d 1 d 2 d 3 d 4 d 5 As a wod: $d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q The above database B is a counteexamle to (d 2, d 3 ) Q D,C. To veify that (d 2, d 3 ) Q B, we exloit not only the ability of two-way automata to move on the wod both fowad and backwad, but also the ability to jum fom one osition in the wod eesenting a node to any othe osition (eithe eceding o succeeding) eesenting the same node. Mauizio Lenzeini Data Integation 32
34 Quey answeing: Basic idea If Q = (Σ, S, I, δ, F ), then A (Q,a,b) = (Σ A, S A, {s 0 }, δ A, {s f }), whee S A = S {s 0, s f } {s s S} (S D), and 1. (s, 1) δ A (s, l), fo each s S and l Σ C 2. (s 2, 1) δ A (s 1, ), fo each s 2 δ(s 1, ) 3. (s 2, 0) δ A (s 1, ), fo each s 2 δ(s 1, ) 4. ((s, d), 0) δ A (s, d), ((s, d), 0) δ A (s, d) ((s, d), 1) δ A ((s, d), l), ((s, d), 1) δ A ((s, d), l) (s, 0) δ A ((s, d), d), (s, 1) δ A (s, d) 5. (s 0, 1) δ A (s 0, l), fo each l Σ A, (s, 0) δ A (s 0, a) fo each s I 6. (s f, 0) δ A (s, b), fo each s F, and (s f, 1) δ A (s f, l) fo each l Σ A. A (Q,a,b) accets w B iff (a, b) Q B. Mauizio Lenzeini Data Integation 33
35 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 0 Tansition: (s 0, 1) δ A (s 0, l), fo each l Σ A Mauizio Lenzeini Data Integation 34
36 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 0 Tansition: (s 0, 1) δ A (s 0, l), fo each l Σ A Mauizio Lenzeini Data Integation 35
37 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 0 Tansition: (s 0, 1) δ A (s 0, l), fo each l Σ A Mauizio Lenzeini Data Integation 36
38 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 0 Tansition: (s 0, 1) δ A (s 0, l), fo each l Σ A Mauizio Lenzeini Data Integation 37
39 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 0 Tansition: (s 0, 1) δ A (s 0, l), fo each l Σ A Mauizio Lenzeini Data Integation 38
40 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 0 Tansition: (s 0, 1) δ A (s 0, l), fo each l Σ A Mauizio Lenzeini Data Integation 39
41 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 0 Tansition: (s 1, 0) δ A (s 0, d 1 ), s 1 initial state fo Q Mauizio Lenzeini Data Integation 40
42 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 1 Tansition: (s 1, 1) δ A (s 1, d 1 ) Mauizio Lenzeini Data Integation 41
43 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 1 Tansition: (s 2, 1) δ A (s 1, ), tansition coming fom Q Mauizio Lenzeini Data Integation 42
44 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 2 Tansition: ((s 2, d 2 ), 1) δ A (s 2, d 2 ), seach fo d 2 Mauizio Lenzeini Data Integation 43
45 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 2, d 2 ) Tansition: ((s 2, d 2 ), 1) δ A ((s 2, d 2 ), $), seach fo d 2 Mauizio Lenzeini Data Integation 44
46 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 2, d 2 ) Tansition: ((s 2, d 2 ), 1) δ A ((s 2, d 2 ), d 4 ), seach fo d 2 Mauizio Lenzeini Data Integation 45
47 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 2, d 2 ) Tansition: ((s 2, d 2 ), 1) δ A ((s 2, d 2 ), ), seach fo d 2 Mauizio Lenzeini Data Integation 46
48 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 2, d 2 ) Tansition: (s 2, 0) δ A ((s 2, d 2 ), d 2 ), exit seach mode Mauizio Lenzeini Data Integation 47
49 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 2 Tansition: (s 2, 1) δ A (s 2, d 2 ), backwad mode Mauizio Lenzeini Data Integation 48
50 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 2 Tansition: (s 3, 0) δ A (s 2, ), tansition coming fom Q Mauizio Lenzeini Data Integation 49
51 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 3 Tansition: (s 4, 1) δ A (s 3, ), tansition coming fom Q Mauizio Lenzeini Data Integation 50
52 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 4 Tansition: ((s 4, d 2 ), 1) δ A (s 4, d 2 ), seach fo d 2 Mauizio Lenzeini Data Integation 51
53 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 4, d 2 ) Tansition: ((s 4, d 2 ), 1) δ A ((s 4, d 2 ), $), seach fo d 2 Mauizio Lenzeini Data Integation 52
54 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 4, d 2 ) Tansition: ((s 4, d 2 ), 1) δ A ((s 4, d 2 ), d 3 ), seach fo d 2 Mauizio Lenzeini Data Integation 53
55 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 4, d 2 ) Tansition: ((s 4, d 2 ), 1) δ A ((s 4, d 2 ), ), seach fo d 2 Mauizio Lenzeini Data Integation 54
56 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 4, d 2 ) Tansition: ((s 4, d 2 ), 1) δ A ((s 4, d 2 ), ), seach fo d 2 Mauizio Lenzeini Data Integation 55
57 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 4, d 2 ) Tansition: ((s 4, d 2 ), 1) δ A ((s 4, d 2 ), d 3 ), seach fo d 2 Mauizio Lenzeini Data Integation 56
58 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 4, d 2 ) Tansition: ((s 4, d 2 ), 1) δ A ((s 4, d 2 ), $), seach fo d 2 Mauizio Lenzeini Data Integation 57
59 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: (s 4, d 2 ) Tansition: (s 4, 0) δ A ((s 4, d 2 ), d 2 ), exit seach mode Mauizio Lenzeini Data Integation 58
60 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 4 Tansition: (s 4, 1) δ A (s 4, d 2 ) Mauizio Lenzeini Data Integation 59
61 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 4 Tansition: (s 5, 1) δ A (s 4, ), tansition coming fom Q Mauizio Lenzeini Data Integation 60
62 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 5 Tansition: (s 6, 1) δ A (s 5, q), tansition coming fom Q Mauizio Lenzeini Data Integation 61
63 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 6 Tansition: (s 7, 0) δ A (s 6, d 3 ), s 7 final state Mauizio Lenzeini Data Integation 62
64 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 7 Tansition: (s 7, 1) δ A (s 7, d 3 ), s 7 final state Mauizio Lenzeini Data Integation 63
65 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 7 Tansition: (s 7, 1) δ A (s 7, $), s 7 final state Mauizio Lenzeini Data Integation 64
66 A un of A (Q,d1,d 3 ) q d 1 d 2 d 3 d 4 d 5 Wod: $ d 4 d 5 $ d 1 d 2 $ d 4 d 2 $ d 3 d 3 $ d 2 q d 3 $ Q = ( q) ( ) q q State: s 7 final state Wod acceted by A (Q,d1,d 3 )! Mauizio Lenzeini Data Integation 65
67 Quey answeing: Technique To check whethe (c, d) Q B fo some B sem C (D), we check fo nonemtiness of A, that is the intesection of the one-way automaton A 0 that accets wods that eesent databases, i.e., wods of the fom ($ C Σ + C) $ the one-way automata coesonding to the vaious A (Si,a,b) (fo each souce S i and fo each ai (a, b) S C i ) the one-way automaton coesonding to the comlement of A (Q,c,d) Indeed, any wod acceted by such intesection automaton eesents a counteexamle to (c, d) Q C,D, i.e., a database B sem C (D) such that (c, d) Q B. Mauizio Lenzeini Data Integation 66
68 Quey answeing: Comlexity All two-way automata constucted above ae of linea size in the size of Q, def (S 1 ),..., def (S k ), and S1 C,..., Sk C. Hence, the coesonding one-way automata would be exonential. Howeve, we do not need to constuct A exlicitly. Instead, we can constuct it on the fly while checking fo nonemtiness. Quey answeing fo RPQIs is PSPACE-comlete (conp-comlete if comlexity is measued wt to the size of souce data C only). Mauizio Lenzeini Data Integation 67
69 Quey answeing: the comlete ictue Diffeent assumtions: 1. Database domain may be: comletely known (closed domain assumtion CDA) atially known (oen domain assumtion ODA) 2. Each souce may be: exact: ovides exactly the data secified in the associated view sound: ovides a subset of the data secified in the associated view comlete: ovides a sueset of the data secified in the associated view Mauizio Lenzeini Data Integation 68
70 Polynomial intactability: RPQ Given a gah G = (N, E), we define D = G, S, M, and souce database C: V s R s V e R e V G R g R g R b R b R gb R bg V C s = {(c, a) a N, c N} V C e = {(a, d) a N, d N} V C G = {(a, b), (b, a) (a, b) E} Q R s M R e whee M descibes all mismatched edge ais (e.g., R g R b ). If G is 3-coloable, then db whee M (and Q) is emty, i.e. (c, d) Q D,C. If G is not 3-coloable, then M is nonemty db, i.e. (c, d) Q D,C. = conp-had wt data comlexity Mauizio Lenzeini Data Integation 69
71 Comlexity of quey answeing: the comlete ictue Assumtion on Assumtion on Comlexity domain views data exession combined all sound conp conp conp closed all exact conp conp conp abitay conp conp conp all sound conp PSPACE PSPACE oen all exact conp PSPACE PSPACE abitay conp PSPACE PSPACE Mauizio Lenzeini Data Integation 70
72 Outline Intoduction to data integation Aoaches to modeling and queying Case study in LAV Case study in GAV Beyond LAV and GAV Conclusions Mauizio Lenzeini Data Integation 71
73 Coming back to GAV In GAV, the maing M is constituted by a set of assetions: g φ S one fo each stuctue g in G, whee φ S is a quey ove S. Given souce database C, a database B satisfies M wt C if fo each g G: φ C S g B If G does not have constaints, we can simly limit ou attention to one model of the infomation integation system, and answeing queies educes to using M fo comuting fom C the vitual global database, i.e., tules satisfiying the vaious φ S associated to each stuctue g of G, evaluating the quey q ove the data obtained fo the vaious g s. Mauizio Lenzeini Data Integation 72
74 GAV with constaints in the global schema: examle Conside D = G, S, M, with Global schema G: student(scode, Sname, Scity), univesity(ucode, Uname), enolled(scode, Ucode), key{scode} key{ucode} key{scode, Ucode} enolled[scode] student[scode] enolled[ucode] univesity[ucode] Souces S: s 1, s 2, s 3 Maing M: student { (X, Y, Z) s 1 (X, Y, Z, W ) } univesity { (X, Y ) s 2 (X, Y ) } enolled { (X, W ) s 3 (X, W ) } Mauizio Lenzeini Data Integation 73
75 Constaints in GAV: examle Univesity Student Enolled code AF BN name bocconi ucla code name bill anne city oslo floence Scode Ucode AF BN 16?? s C 1 12 anne floence bill oslo 24 s C 2 AF BN bocconi ucla s C 3 12 AF 16 BN Mauizio Lenzeini Data Integation 74
76 Constaints in GAV: examle Souce database C: s C 1 12 anne floence bill oslo 24 s C 2 AF BN bocconi ucla s C 3 12 AF 16 BN s C 3(16, BN) imlies enolled B (16, BN), fo all B sem C (D). Due to the integity constaints in the global schema, 16 is the code of some student in all B sem C (D). Since C says nothing about the name and the city of such student, we must accet as legal fo D all vitual global databases that diffe in such attibutes. Mauizio Lenzeini Data Integation 75
77 GAV evisited If G does have constaints, then seveal situations ae ossible, given the souce data C: no model exists fo the data integation system, the data integation system has one model, seveal models exist fo the infomation integation system. In GAV too, answeing queies is an infeence ocess coing with incomlete infomation Coming back to the analogy with the mistey case, constaints in the global schema can make the investigation eot incomlete/incoheent, so that answeing queies may equie easoning on the investigation eot. Mauizio Lenzeini Data Integation 76
78 A case study in GAV We deal with the oblem of answeing queies to data integation systems of the fom G, S, M, whee the global schema G is elational, with both key and foeign key constaints the souces in S ae elational the maing M is of tye GAV queies ae conjunctive queies Mauizio Lenzeini Data Integation 77
79 Unfolding is not sufficient in ou context Maing M: student { (X, Y, Z) s 1 (X, Y, Z, W ) } univesity { (X, Y ) s 2 (X, Y ) } enolled { (X, W ) s 3 (X, W ) } s C 1 12 anne floence bill oslo 24 s C 2 AF BN bocconi ucla s C 3 12 AF 16 BN Quey: { (X) student(x, Y, Z), enolled(x, W ) } Unfolding wt M: { (X) s 1 (X, Y, Z, V ), s 3 (X, W ) } etieves only the answe {12} fom C, although {12, 16} is the coect answe. The simle unfolding stategy is not sufficient in ou context. Most GAV systems use the simle unfolding stategy! Mauizio Lenzeini Data Integation 78
80 Pocessing queies in GAV: technique Techniques fo automated easoning on incomlete infomation ae needed. In ou context, we have develoed the following technique fo ocessing queies: Given quey q, we comute anothe quey ex G (q), called the exansion of q wt the constaints of G (atial evaluation) We unfold ex G (q) wt M, and obtain a quey unf M (ex G (q)) ove the souces We evaluate unf M (ex G (q)) ove the souce database C ex G (q) can be of exonential size wt G, but the whole ocess has olynomial time comlexity wt the size of C (see [Calvanese et al, 2001] fo details). Mauizio Lenzeini Data Integation 79
81 Pocessing queies in GAV: technique The oblems mentioned above also hold when: The global schema is exessed in tems of a concetual data model see [Calvanese et al, ER 2001] An ontology is used as global schema see [Calvanese et al, SWWS 2001] The global schema is exessed in tems of a semistuctued data model (e.g., XML) The maing M has the following diffeent semantics (exact souces): Given souce database C, a database B satisfies g φ S wt C if g B = φ C S Mauizio Lenzeini Data Integation 80
82 The case of exact souces in GAV with constaints Univesity Student Enolled code AF BN name bocconi ucla code name bill anne city oslo floence Scode Ucode AF BN Inconsistency no tule with code s C 1 12 anne floence bill oslo 24 s C 2 AF BN bocconi ucla s C 3 12 AF 16 BN Mauizio Lenzeini Data Integation 81
83 Outline Intoduction to data integation Aoaches to modeling and queying Case study in LAV Case study in GAV Beyond LAV and GAV Conclusions Mauizio Lenzeini Data Integation 82
84 Beyond LAV and GAV Global schema: W ok(reseache, P oject), Aea(P oject, F ield) Souce 1: Inteest(P eson, F ield) Souce 2: Get(Reseache, Gant), F o(gant, P oject) Maing: being inteested in field f mas to thee exists a oject such that woks fo and the aea of is f. getting gant g fo oject, mas to woking fo. This situation cannot be eesented in GAV o LAV. Mauizio Lenzeini Data Integation 83
85 The modeling oblem: GLAV = GAV + LAV A moe geneal method fo secifying the maing between the global schema and the souces is based on assetions of the foms: φ S s φ G (sound souce) φ S c φ G (comlete souce) whee φ S is a quey on S and φ G is a quey on G. Given souce database C, a database B fo G satisfies M wt C, i.e., if fo each assetion φ S s φ G in M, we have that φ C S φb G, fo each assetion φ S c φ G in M, we have that φ B G φc S Mauizio Lenzeini Data Integation 84
86 Examle of GLAV Global schema: W ok(reseache, P oject), Aea(P oject, F ield) Souce 1: Inteest(P eson, F ield) Souce 2: Get(Reseache, Gant), F o(gant, P oject) GLAV maing: { (, f) Inteest(, f) } { (, f) W ok(, ) Aea(, f) } { (, ) Get(, g) F o(g, ) } { (, ) W ok(, ) } Mauizio Lenzeini Data Integation 85
87 Technique fo GLAV The maing assetion φ S s φ G can be seen as φ S g φ G, whee g is a new symbol added to G. Theefoe, we can tanslate φ S s φ G into: the GAV maing ule g φ S the constaint g φ G thus obtaining a GAV system with constaints, that can be dealt with a vaiant of the above descibed technique [Calì et al, FMII 2001]. Mauizio Lenzeini Data Integation 86
88 Outline Intoduction to data integation Aoaches to modeling and queying Case study in LAV Case study in GAV Beyond LAV and GAV Conclusions Mauizio Lenzeini Data Integation 87
89 Conclusions Data integation alications have to coe with incomlete infomation, no matte which is the modeling aoach Some techniques aleady develoed, but seveal oen oblems still emain (in LAV, GAV, and GLAV) Many othe oblems not addessed hee ae elevant in data integation (e.g., how to constuct the global schema, how to deal with inconsistencies, how to coe with udates,...) In aticula, given the comlexity of sound and comlete quey answeing, it is inteesting to look at methods that accet less quality answes, tading efficiency fo accuacy Mauizio Lenzeini Data Integation 88
90 Acknowledgements Many thanks to Andea Calí Diego Calvanese Giusee De Giacomo Domenico Lembo Moshe Vadi Mauizio Lenzeini Data Integation 89
Data integration: A theoretical perspective
Data integation: A theoetical esective Mauizio Lenzeini Diatimento di Infomatica e Sistemistica Antonio Rubeti Univesità di Roma La Saienza Tutoial at PODS 2002 Madison, Wisconsin, USA, June 2002 Data
More informationData Integration. Maurizio Lenzerini. Universitá di Roma La Sapienza
Data Integration Maurizio Lenzerini Universitá di Roma La Sapienza DASI 06: Phd School on Data and Service Integration Bertinoro, December 11 15, 2006 M. Lenzerini Data Integration DASI 06 1 / 213 Structure
More informationA Tutorial on Data Integration
A Tutorial on Data Integration Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Antonio Ruberti, Sapienza Università di Roma DEIS 10 - Data Exchange, Integration, and Streaming November 7-12,
More informationQuery Processing in Data Integration Systems
Query Processing in Data Integration Systems Diego Calvanese Free University of Bozen-Bolzano BIT PhD Summer School Bressanone July 3 7, 2006 D. Calvanese Data Integration BIT PhD Summer School 1 / 152
More informationInteger sequences from walks in graphs
otes on umbe Theoy and Discete Mathematics Vol. 9, 3, o. 3, 78 84 Intege seuences fom walks in gahs Enesto Estada, and José A. de la Peña Deatment of Mathematics and Statistics, Univesity of Stathclyde
More informationHow To Understand Data Integration
Data Integration 1 Giuseppe De Giacomo e Antonella Poggi Dipartimento di Informatica e Sistemistica Antonio Ruberti Università di Roma La Sapienza Seminari di Ingegneria Informatica: Integrazione di Dati
More informationHow To Write A Theory Of The Concept Of The Mind In A Quey
Jounal of Atificial Intelligence Reseach 31 (2008) 157-204 Submitted 06/07; published 01/08 Conjunctive Quey Answeing fo the Desciption Logic SHIQ Bite Glimm Ian Hoocks Oxfod Univesity Computing Laboatoy,
More informationContinuous Compounding and Annualization
Continuous Compounding and Annualization Philip A. Viton Januay 11, 2006 Contents 1 Intoduction 1 2 Continuous Compounding 2 3 Pesent Value with Continuous Compounding 4 4 Annualization 5 5 A Special Poblem
More informationHow To Schedule A Cloud Comuting On A Computer (I.E. A Computer)
Intenational Jounal on Cloud Comuting: Sevices and Achitectue(IJCCSA,Vol., No.3,Novembe 20 STOCHASTIC MARKOV MODEL APPROACH FOR EFFICIENT VIRTUAL MACHINES SCHEDULING ON PRIVATE CLOUD Hsu Mon Kyi and Thinn
More informationConcept and Experiences on using a Wiki-based System for Software-related Seminar Papers
Concept and Expeiences on using a Wiki-based System fo Softwae-elated Semina Papes Dominik Fanke and Stefan Kowalewski RWTH Aachen Univesity, 52074 Aachen, Gemany, {fanke, kowalewski}@embedded.wth-aachen.de,
More informationChapter 4: Matrix Norms
EE448/58 Vesion.0 John Stensby Chate 4: Matix Noms The analysis of matix-based algoithms often equies use of matix noms. These algoithms need a way to quantify the "size" of a matix o the "distance" between
More informationPACE: Policy-Aware Application Cloud Embedding
PACE: Policy-Awae Alication Cloud Embedding Li Ean Li Vahid Liaghat Hongze Zhao MohammadTaghi Hajiaghayi Dan Li Godon Wilfong Y. Richad Yang Chuanxiong Guo Bell Labs Micosoft Reseach Asia Tsinghua Univesity
More informationDistributed Computing and Big Data: Hadoop and MapReduce
Distibuted Computing and Big Data: Hadoop and Map Bill Keenan, Diecto Tey Heinze, Achitect Thomson Reutes Reseach & Development Agenda R&D Oveview Hadoop and Map Oveview Use Case: Clusteing Legal Documents
More informationData Integration: A Theoretical Perspective
Data Integration: A Theoretical Perspective Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Via Salaria 113, I 00198 Roma, Italy lenzerini@dis.uniroma1.it ABSTRACT
More informationUNIT CIRCLE TRIGONOMETRY
UNIT CIRCLE TRIGONOMETRY The Unit Cicle is the cicle centeed at the oigin with adius unit (hence, the unit cicle. The equation of this cicle is + =. A diagam of the unit cicle is shown below: + = - - -
More informationUncertain Version Control in Open Collaborative Editing of Tree-Structured Documents
Uncetain Vesion Contol in Open Collaboative Editing of Tee-Stuctued Documents M. Lamine Ba Institut Mines Télécom; Télécom PaisTech; LTCI Pais, Fance mouhamadou.ba@ telecom-paistech.f Talel Abdessalem
More informationSupporting Efficient Top-k Queries in Type-Ahead Search
Suppoting Efficient Top-k Queies in Type-Ahead Seach Guoliang Li Jiannan Wang Chen Li Jianhua Feng Depatment of Compute Science, Tsinghua National Laboatoy fo Infomation Science and Technology (TNList),
More informationAccessing Data Integration Systems through Conceptual Schemas (extended abstract)
Accessing Data Integration Systems through Conceptual Schemas (extended abstract) Andrea Calì, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Università
More informationest using the formula I = Prt, where I is the interest earned, P is the principal, r is the interest rate, and t is the time in years.
9.2 Inteest Objectives 1. Undestand the simple inteest fomula. 2. Use the compound inteest fomula to find futue value. 3. Solve the compound inteest fomula fo diffeent unknowns, such as the pesent value,
More informationTop-Down versus Bottom-Up Approaches in Risk Management
To-Down vesus Bottom-U Aoaches in isk Management PETE GUNDKE 1 Univesity of Osnabück, Chai of Banking and Finance Kathainenstaße 7, 49069 Osnabück, Gemany hone: ++49 (0)541 969 4721 fax: ++49 (0)541 969
More informationSemipartial (Part) and Partial Correlation
Semipatial (Pat) and Patial Coelation his discussion boows heavily fom Applied Multiple egession/coelation Analysis fo the Behavioal Sciences, by Jacob and Paticia Cohen (975 edition; thee is also an updated
More information9:6.4 Sample Questions/Requests for Managing Underwriter Candidates
9:6.4 INITIAL PUBLIC OFFERINGS 9:6.4 Sample Questions/Requests fo Managing Undewite Candidates Recent IPO Expeience Please povide a list of all completed o withdawn IPOs in which you fim has paticipated
More informationMining Relatedness Graphs for Data Integration
Mining Relatedness Gaphs fo Data Integation Jeemy T. Engle (jtengle@indiana.edu) Ying Feng (yingfeng@indiana.edu) Robet L. Goldstone (goldsto@indiana.edu) Indiana Univesity Bloomington, IN. 47405 USA Abstact
More informationExam #1 Review Answers
xam #1 Review Answes 1. Given the following pobability distibution, calculate the expected etun, vaiance and standad deviation fo Secuity J. State Pob (R) 1 0.2 10% 2 0.6 15 3 0.2 20 xpected etun = 0.2*10%
More information2 r2 θ = r2 t. (3.59) The equal area law is the statement that the term in parentheses,
3.4. KEPLER S LAWS 145 3.4 Keple s laws You ae familia with the idea that one can solve some mechanics poblems using only consevation of enegy and (linea) momentum. Thus, some of what we see as objects
More informationConverting knowledge Into Practice
Conveting knowledge Into Pactice Boke Nightmae srs Tend Ride By Vladimi Ribakov Ceato of Pips Caie 20 of June 2010 2 0 1 0 C o p y i g h t s V l a d i m i R i b a k o v 1 Disclaime and Risk Wanings Tading
More informationOver-encryption: Management of Access Control Evolution on Outsourced Data
Ove-encyption: Management of Access Contol Evolution on Outsouced Data Sabina De Capitani di Vimecati DTI - Univesità di Milano 26013 Cema - Italy decapita@dti.unimi.it Stefano Paaboschi DIIMM - Univesità
More informationSpirotechnics! September 7, 2011. Amanda Zeringue, Michael Spannuth and Amanda Zeringue Dierential Geometry Project
Spiotechnics! Septembe 7, 2011 Amanda Zeingue, Michael Spannuth and Amanda Zeingue Dieential Geomety Poject 1 The Beginning The geneal consensus of ou goup began with one thought: Spiogaphs ae awesome.
More informationChapter 3 Savings, Present Value and Ricardian Equivalence
Chapte 3 Savings, Pesent Value and Ricadian Equivalence Chapte Oveview In the pevious chapte we studied the decision of households to supply hous to the labo maket. This decision was a static decision,
More informationA comparison result for perturbed radial p-laplacians
A comaison esult fo etubed adial -Lalacians Raul Manásevich and Guido Swees Diectoy Table of Contents Begin Aticle Coyight c 23 Last Revision Date: Ail 1, 23 Table of Contents 1. Intoduction and main esult
More informationCloud Service Reliability: Modeling and Analysis
Cloud Sevice eliability: Modeling and Analysis Yuan-Shun Dai * a c, Bo Yang b, Jack Dongaa a, Gewei Zhang c a Innovative Computing Laboatoy, Depatment of Electical Engineeing & Compute Science, Univesity
More informationSTUDENT RESPONSE TO ANNUITY FORMULA DERIVATION
Page 1 STUDENT RESPONSE TO ANNUITY FORMULA DERIVATION C. Alan Blaylock, Hendeson State Univesity ABSTRACT This pape pesents an intuitive appoach to deiving annuity fomulas fo classoom use and attempts
More informationIlona V. Tregub, ScD., Professor
Investment Potfolio Fomation fo the Pension Fund of Russia Ilona V. egub, ScD., Pofesso Mathematical Modeling of Economic Pocesses Depatment he Financial Univesity unde the Govenment of the Russian Fedeation
More informationENABLING INFORMATION GATHERING PATTERNS FOR EMERGENCY RESPONSE WITH THE OPENKNOWLEDGE SYSTEM
Computing and Infomatics, Vol. 29, 2010, 537 555 ENABLING INFORMATION GATHERING PATTERNS FOR EMERGENCY RESPONSE WITH THE OPENKNOWLEDGE SYSTEM Gaia Tecaichi, Veonica Rizzi, Mauizio Machese Depatment of
More informationAn Introduction to Omega
An Intoduction to Omega Con Keating and William F. Shadwick These distibutions have the same mean and vaiance. Ae you indiffeent to thei isk-ewad chaacteistics? The Finance Development Cente 2002 1 Fom
More informationOn Efficiently Updating Singular Value Decomposition Based Reduced Order Models
On Efficiently dating Singula alue Decoosition Based Reduced Ode Models Ralf Zieann GAMM oksho Alied and Nueical Linea Algeba with Secial Ehasis on Model Reduction Been Se..-3. he POD-based ROM aoach.
More informationSkills Needed for Success in Calculus 1
Skills Needed fo Success in Calculus Thee is much appehension fom students taking Calculus. It seems that fo man people, "Calculus" is snonmous with "difficult." Howeve, an teache of Calculus will tell
More informationDefine What Type of Trader Are you?
Define What Type of Tade Ae you? Boke Nightmae srs Tend Ride By Vladimi Ribakov Ceato of Pips Caie 20 of June 2010 1 Disclaime and Risk Wanings Tading any financial maket involves isk. The content of this
More information2. TRIGONOMETRIC FUNCTIONS OF GENERAL ANGLES
. TRIGONOMETRIC FUNCTIONS OF GENERAL ANGLES In ode to etend the definitions of the si tigonometic functions to geneal angles, we shall make use of the following ideas: In a Catesian coodinate sstem, an
More informationHousing in the Household Portfolio and Implications for Retirement Saving: Some Initial Finding from SOFIE
Housing in the Household Potfolio and Imlications fo Retiement Saving: Some Initial Finding fom SOFIE Gant Scobie, Tinh Le and John Gibson N EW ZEALAND T REASURY W ORKING P APER 07/04 M ARCH 2007 NZ TREASURY
More informationDefinitions and terminology
I love the Case & Fai textbook but it is out of date with how monetay policy woks today. Please use this handout to supplement the chapte on monetay policy. The textbook assumes that the Fedeal Reseve
More informationApproximation Algorithms for Data Management in Networks
Appoximation Algoithms fo Data Management in Netwoks Chistof Kick Heinz Nixdof Institute and Depatment of Mathematics & Compute Science adebon Univesity Gemany kueke@upb.de Haald Räcke Heinz Nixdof Institute
More informationGESTÃO FINANCEIRA II PROBLEM SET 1 - SOLUTIONS
GESTÃO FINANCEIRA II PROBLEM SET 1 - SOLUTIONS (FROM BERK AND DEMARZO S CORPORATE FINANCE ) LICENCIATURA UNDERGRADUATE COURSE 1 ST SEMESTER 2010-2011 Chapte 1 The Copoation 1-13. What is the diffeence
More informationChris J. Skinner The probability of identification: applying ideas from forensic statistics to disclosure risk assessment
Chis J. Skinne The pobability of identification: applying ideas fom foensic statistics to disclosue isk assessment Aticle (Accepted vesion) (Refeeed) Oiginal citation: Skinne, Chis J. (2007) The pobability
More information883 Brochure A5 GENE ss vernis.indd 1-2
ess x a eu / u e a. p o.eu c e / :/ http EURAXESS Reseaches in Motion is the gateway to attactive eseach caees in Euope and to a pool of wold-class eseach talent. By suppoting the mobility of eseaches,
More informationVoltage ( = Electric Potential )
V-1 of 9 Voltage ( = lectic Potential ) An electic chage altes the space aound it. Thoughout the space aound evey chage is a vecto thing called the electic field. Also filling the space aound evey chage
More informationCoordinate Systems L. M. Kalnins, March 2009
Coodinate Sstems L. M. Kalnins, Mach 2009 Pupose of a Coodinate Sstem The pupose of a coodinate sstem is to uniquel detemine the position of an object o data point in space. B space we ma liteall mean
More informationHow to SYSPREP a Windows 7 Pro corporate PC setup so you can image it for use on future PCs
AnswesThatWok TM How to SYSPREP a Windows 7 Po copoate PC setup so you can image it fo use on futue PCs In a copoate envionment most PCs will usually have identical setups, with the same pogams installed
More informationClassical Mechanics (CM):
Classical Mechanics (CM): We ought to have some backgound to aeciate that QM eally does just use CM and makes one slight modification that then changes the natue of the oblem we need to solve but much
More informationDeflection of Electrons by Electric and Magnetic Fields
Physics 233 Expeiment 42 Deflection of Electons by Electic and Magnetic Fields Refeences Loain, P. and D.R. Coson, Electomagnetism, Pinciples and Applications, 2nd ed., W.H. Feeman, 199. Intoduction An
More informationSoftware Engineering and Development
I T H E A 67 Softwae Engineeing and Development SOFTWARE DEVELOPMENT PROCESS DYNAMICS MODELING AS STATE MACHINE Leonid Lyubchyk, Vasyl Soloshchuk Abstact: Softwae development pocess modeling is gaining
More informationA framework for the selection of enterprise resource planning (ERP) system based on fuzzy decision making methods
A famewok fo the selection of entepise esouce planning (ERP) system based on fuzzy decision making methods Omid Golshan Tafti M.s student in Industial Management, Univesity of Yazd Omidgolshan87@yahoo.com
More informationFigure 2. So it is very likely that the Babylonians attributed 60 units to each side of the hexagon. Its resulting perimeter would then be 360!
1. What ae angles? Last time, we looked at how the Geeks intepeted measument of lengths. Howeve, as fascinated as they wee with geomety, thee was a shape that was much moe enticing than any othe : the
More informationEpisode 401: Newton s law of universal gravitation
Episode 401: Newton s law of univesal gavitation This episode intoduces Newton s law of univesal gavitation fo point masses, and fo spheical masses, and gets students pactising calculations of the foce
More informationIntroduction to NP-Completeness Written and copyright c by Jie Wang 1
91.502 Foundations of Comuter Science 1 Introduction to Written and coyright c by Jie Wang 1 We use time-bounded (deterministic and nondeterministic) Turing machines to study comutational comlexity of
More informationExplicit, analytical solution of scaling quantum graphs. Abstract
Explicit, analytical solution of scaling quantum gaphs Yu. Dabaghian and R. Blümel Depatment of Physics, Wesleyan Univesity, Middletown, CT 06459-0155, USA E-mail: ydabaghian@wesleyan.edu (Januay 6, 2003)
More informationUPS Virginia District Package Car Fleet Optimization
UPS Viginia Distit Pakage Ca Fleet Otimization Tavis Manning, Divaka Mehta, Stehen Sheae, Malloy Soldne, and Bian Togesen Abstat United Pael Sevie (UPS) is onstantly haged with ealigning its akage a fleet
More informationCarter-Penrose diagrams and black holes
Cate-Penose diagams and black holes Ewa Felinska The basic intoduction to the method of building Penose diagams has been pesented, stating with obtaining a Penose diagam fom Minkowski space. An example
More informationRisk Sensitive Portfolio Management With Cox-Ingersoll-Ross Interest Rates: the HJB Equation
Risk Sensitive Potfolio Management With Cox-Ingesoll-Ross Inteest Rates: the HJB Equation Tomasz R. Bielecki Depatment of Mathematics, The Notheasten Illinois Univesity 55 Noth St. Louis Avenue, Chicago,
More informationRock Compressibility. Reservoir Pressures. PET467E A Note on Rock Compressibility
Rock Comessiility PET467E A Note on Rock Comessiility M. Onu Sing 007 A esevoi consists of an imevious cove o ca ock ovelying a oous and emeale ock. The density diffeences etween the oil, gas and wate
More informationFaithful Comptroller s Handbook
Faithful Comptolle s Handbook Faithful Comptolle s Handbook Selection of Faithful Comptolle The Laws govening the Fouth Degee povide that the faithful comptolle be elected, along with the othe offices
More informationPAN STABILITY TESTING OF DC CIRCUITS USING VARIATIONAL METHODS XVIII - SPETO - 1995. pod patronatem. Summary
PCE SEMINIUM Z PODSTW ELEKTOTECHNIKI I TEOII OBWODÓW 8 - TH SEMIN ON FUNDMENTLS OF ELECTOTECHNICS ND CICUIT THEOY ZDENĚK BIOLEK SPŠE OŽNO P.., CZECH EPUBLIC DLIBO BIOLEK MILITY CDEMY, BNO, CZECH EPUBLIC
More informationAn Analysis of Manufacturer Benefits under Vendor Managed Systems
An Analysis of Manufactue Benefits unde Vendo Managed Systems Seçil Savaşaneil Depatment of Industial Engineeing, Middle East Technical Univesity, 06531, Ankaa, TURKEY secil@ie.metu.edu.t Nesim Ekip 1
More informationDatabase Management Systems
Contents Database Management Systems (COP 5725) D. Makus Schneide Depatment of Compute & Infomation Science & Engineeing (CISE) Database Systems Reseach & Development Cente Couse Syllabus 1 Sping 2012
More informationData integration general setting
Data integration general setting A source schema S: relational schema XML Schema (DTD), etc. A global schema G: could be of many different types too A mapping M between S and G: many ways to specify it,
More informationAN IMPLEMENTATION OF BINARY AND FLOATING POINT CHROMOSOME REPRESENTATION IN GENETIC ALGORITHM
AN IMPLEMENTATION OF BINARY AND FLOATING POINT CHROMOSOME REPRESENTATION IN GENETIC ALGORITHM Main Golub Faculty of Electical Engineeing and Computing, Univesity of Zageb Depatment of Electonics, Micoelectonics,
More informationModeling and Verifying a Price Model for Congestion Control in Computer Networks Using PROMELA/SPIN
Modeling and Veifying a Pice Model fo Congestion Contol in Compute Netwoks Using PROMELA/SPIN Clement Yuen and Wei Tjioe Depatment of Compute Science Univesity of Toonto 1 King s College Road, Toonto,
More informationEfficient Redundancy Techniques for Latency Reduction in Cloud Systems
Efficient Redundancy Techniques fo Latency Reduction in Cloud Systems 1 Gaui Joshi, Emina Soljanin, and Gegoy Wonell Abstact In cloud computing systems, assigning a task to multiple seves and waiting fo
More informationAccuracy and Bias of Licensed Practical Nurse and Nursing Assistant Ratings of Nursing Home Residents Pain
Jounal of Geontology: MEDICAL SCIENCES 2001, Vol. 56A, No. 7, M405 M411 Coyight 2001 by The Geontological Society of Ameica Accuacy and Bias of Licensed Pactical Nuse and Nusing Assistant Ratings of Nusing
More informationDOCTORATE DEGREE PROGRAMS
DOCTORATE DEGREE PROGRAMS Application Fo Admission 2015-2016 5700 College Road, Lisle, Illinois 60532 Enollment Cente Phone: (630) 829-6300 Outside Illinois: (888) 829-6363 FAX: (630) 829-6301 Email: admissions@ben.edu
More informationINITIAL MARGIN CALCULATION ON DERIVATIVE MARKETS OPTION VALUATION FORMULAS
INITIAL MARGIN CALCULATION ON DERIVATIVE MARKETS OPTION VALUATION FORMULAS Vesion:.0 Date: June 0 Disclaime This document is solely intended as infomation fo cleaing membes and othes who ae inteested in
More informationReview Graph based Online Store Review Spammer Detection
Review Gaph based Online Stoe Review Spamme Detection Guan Wang, Sihong Xie, Bing Liu, Philip S. Yu Univesity of Illinois at Chicago Chicago, USA gwang26@uic.edu sxie6@uic.edu liub@uic.edu psyu@uic.edu
More informationVector Calculus: Are you ready? Vectors in 2D and 3D Space: Review
Vecto Calculus: Ae you eady? Vectos in D and 3D Space: Review Pupose: Make cetain that you can define, and use in context, vecto tems, concepts and fomulas listed below: Section 7.-7. find the vecto defined
More informationThe Lucas Paradox and the Quality of Institutions: Then and Now
Diskussionsbeitäge des Fachbeeichs Witschaftswissenschaft de Feien Univesität Belin Volkswitschaftliche Reihe 2008/3 The Lucas Paadox and the Quality of Institutions: Then and Now Moitz Schulaick und Thomas
More informationReduced Pattern Training Based on Task Decomposition Using Pattern Distributor
> PNN05-P762 < Reduced Patten Taining Based on Task Decomposition Using Patten Distibuto Sheng-Uei Guan, Chunyu Bao, and TseNgee Neo Abstact Task Decomposition with Patten Distibuto (PD) is a new task
More informationOffice of Family Assistance. Evaluation Resource Guide for Responsible Fatherhood Programs
Office of Family Assistance Evaluation Resouce Guide fo Responsible Fathehood Pogams Contents Intoduction........................................................ 4 Backgound..........................................................
More informationHow to recover your Exchange 2003/2007 mailboxes and emails if all you have available are your PRIV1.EDB and PRIV1.STM Information Store database
AnswesThatWok TM Recoveing Emails and Mailboxes fom a PRIV1.EDB Exchange 2003 IS database How to ecove you Exchange 2003/2007 mailboxes and emails if all you have available ae you PRIV1.EDB and PRIV1.STM
More informationTop K Nearest Keyword Search on Large Graphs
Top K Neaest Keywod Seach on Lage Gaphs Miao Qiao, Lu Qin, Hong Cheng, Jeffey Xu Yu, Wentao Tian The Chinese Univesity of Hong Kong, Hong Kong, China {mqiao,lqin,hcheng,yu,wttian}@se.cuhk.edu.hk ABSTRACT
More informationYARN PROPERTIES MEASUREMENT: AN OPTICAL APPROACH
nd INTERNATIONAL TEXTILE, CLOTHING & ESIGN CONFERENCE Magic Wold of Textiles Octobe 03 d to 06 th 004, UBROVNIK, CROATIA YARN PROPERTIES MEASUREMENT: AN OPTICAL APPROACH Jana VOBOROVA; Ashish GARG; Bohuslav
More informationComparing Availability of Various Rack Power Redundancy Configurations
Compaing Availability of Vaious Rack Powe Redundancy Configuations By Victo Avela White Pape #48 Executive Summay Tansfe switches and dual-path powe distibution to IT equipment ae used to enhance the availability
More informationDo Bonds Span the Fixed Income Markets? Theory and Evidence for Unspanned Stochastic Volatility
Do Bonds Span the Fied Income Makets? Theoy and Evidence fo Unspanned Stochastic olatility PIERRE COLLIN-DUFRESNE and ROBERT S. GOLDSTEIN July, 00 ABSTRACT Most tem stuctue models assume bond makets ae
More informationSELF-INDUCTANCE AND INDUCTORS
MISN-0-144 SELF-INDUCTANCE AND INDUCTORS SELF-INDUCTANCE AND INDUCTORS by Pete Signell Michigan State Univesity 1. Intoduction.............................................. 1 A 2. Self-Inductance L.........................................
More informationThings to Remember. r Complete all of the sections on the Retirement Benefit Options form that apply to your request.
Retiement Benefit 1 Things to Remembe Complete all of the sections on the Retiement Benefit fom that apply to you equest. If this is an initial equest, and not a change in a cuent distibution, emembe to
More informationTowards Automatic Update of Access Control Policy
Towads Automatic Update of Access Contol Policy Jinwei Hu, Yan Zhang, and Ruixuan Li Intelligent Systems Laboatoy, School of Computing and Mathematics Univesity of Westen Sydney, Sydney 1797, Austalia
More informationModel-Driven Engineering of Adaptation Engines for Self-Adaptive Software: Executable Runtime Megamodels
Model-Diven Engineeing of Adaptation Engines fo Self-Adaptive Softwae: Executable Runtime Megamodels Thomas Vogel, Holge Giese Technische Beichte N. 66 des Hasso-Plattne-Instituts fü Softwaesystemtechnik
More informationHow to create RAID 1 mirroring with a hard disk that already has data or an operating system on it
AnswesThatWok TM How to set up a RAID1 mio with a dive which aleady has Windows installed How to ceate RAID 1 mioing with a had disk that aleady has data o an opeating system on it Date Company PC / Seve
More informationValuation of Floating Rate Bonds 1
Valuation of Floating Rate onds 1 Joge uz Lopez us 316: Deivative Secuities his note explains how to value plain vanilla floating ate bonds. he pupose of this note is to link the concepts that you leaned
More informationThe impact of migration on the provision. of UK public services (SRG.10.039.4) Final Report. December 2011
The impact of migation on the povision of UK public sevices (SRG.10.039.4) Final Repot Decembe 2011 The obustness The obustness of the analysis of the is analysis the esponsibility is the esponsibility
More informationComparing Availability of Various Rack Power Redundancy Configurations
Compaing Availability of Vaious Rack Powe Redundancy Configuations White Pape 48 Revision by Victo Avela > Executive summay Tansfe switches and dual-path powe distibution to IT equipment ae used to enhance
More informationHEALTHCARE INTEGRATION BASED ON CLOUD COMPUTING
U.P.B. Sci. Bull., Seies C, Vol. 77, Iss. 2, 2015 ISSN 2286-3540 HEALTHCARE INTEGRATION BASED ON CLOUD COMPUTING Roxana MARCU 1, Dan POPESCU 2, Iulian DANILĂ 3 A high numbe of infomation systems ae available
More informationTHE DISTRIBUTED LOCATION RESOLUTION PROBLEM AND ITS EFFICIENT SOLUTION
IADIS Intenational Confeence Applied Computing 2006 THE DISTRIBUTED LOCATION RESOLUTION PROBLEM AND ITS EFFICIENT SOLUTION Jög Roth Univesity of Hagen 58084 Hagen, Gemany Joeg.Roth@Fenuni-hagen.de ABSTRACT
More informationThe transport performance evaluation system building of logistics enterprises
Jounal of Industial Engineeing and Management JIEM, 213 6(4): 194-114 Online ISSN: 213-953 Pint ISSN: 213-8423 http://dx.doi.og/1.3926/jiem.784 The tanspot pefomance evaluation system building of logistics
More informationThe Supply of Loanable Funds: A Comment on the Misconception and Its Implications
JOURNL OF ECONOMICS ND FINNCE EDUCTION Volume 7 Numbe 2 Winte 2008 39 The Supply of Loanable Funds: Comment on the Misconception and Its Implications. Wahhab Khandke and mena Khandke* STRCT Recently Fields-Hat
More informationQuestions & Answers Chapter 10 Software Reliability Prediction, Allocation and Demonstration Testing
M13914 Questions & Answes Chapte 10 Softwae Reliability Pediction, Allocation and Demonstation Testing 1. Homewok: How to deive the fomula of failue ate estimate. λ = χ α,+ t When the failue times follow
More informationFirstmark Credit Union Commercial Loan Department
Fistmak Cedit Union Commecial Loan Depatment Thank you fo consideing Fistmak Cedit Union as a tusted souce to meet the needs of you business. Fistmak Cedit Union offes a wide aay of business loans and
More informationA formalism of ontology to support a software maintenance knowledge-based system
A fomalism of ontology to suppot a softwae maintenance knowledge-based system Alain Apil 1, Jean-Mac Deshanais 1, and Reine Dumke 2 1 École de Technologie Supéieue, 1100 Note-Dame West, Monteal, Canada
More informationTracking/Fusion and Deghosting with Doppler Frequency from Two Passive Acoustic Sensors
Tacking/Fusion and Deghosting with Dopple Fequency fom Two Passive Acoustic Sensos Rong Yang, Gee Wah Ng DSO National Laboatoies 2 Science Pak Dive Singapoe 11823 Emails: yong@dso.og.sg, ngeewah@dso.og.sg
More informationScheduling Hadoop Jobs to Meet Deadlines
Scheduling Hadoop Jobs to Meet Deadlines Kamal Kc, Kemafo Anyanwu Depatment of Compute Science Noth Caolina State Univesity {kkc,kogan}@ncsu.edu Abstact Use constaints such as deadlines ae impotant equiements
More informationAttacking an obfuscated cipher by injecting faults
Attacking an obfuscated ciphe by injecting faults Matthias Jacob mjacob@cs.pinceton.edu Dan Boneh dabo@cs.stanfod.edu Edwad Felten felten@cs.pinceton.edu Abstact We study the stength of cetain obfuscation
More informationGravitational Mechanics of the Mars-Phobos System: Comparing Methods of Orbital Dynamics Modeling for Exploratory Mission Planning
Gavitational Mechanics of the Mas-Phobos System: Compaing Methods of Obital Dynamics Modeling fo Exploatoy Mission Planning Alfedo C. Itualde The Pennsylvania State Univesity, Univesity Pak, PA, 6802 This
More information