Merging Uncertain Multi-Version XML Documents

Transcription

1 Meging Uncetain Multi-Vesion XML Documents M. Lamine BA, Talel Abdessalem & Piee Senellat ACM DocEng st Intenational Wokshop on Document Changes (Floence, Italy) Septembe 10 th, 2013 M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

2 Meging featue: a need in open envionments Meging featue: a need in open envionments Meging documents elated to the same topic o shaing a lage common pat, e.g., Wikipedia aticles M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

3 Meging featue: a need in open envionments Meging featue: a need in open envionments Meging documents elated to the same topic o shaing a lage common pat, e.g., Wikipedia aticles Recommend the outcome of the meging of contibutions of the most tustwothy contibutos Poposal of a meging opeation ove multi-vesion tee-stuctued documents with uncetain data M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

4 Usual Meging Pocess ove Documents Usual Meging Pocess ove Documents M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

5 Usual Meging Pocess ove Documents Usual Meging Pocess ove Documents (i) Change Detection (diff algoithm): {u 1, u 2 } and {u 3, u 4 } u 1 : Update A to A u 2 : Inset C u 3 : Remove A u 4 : Inset D M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

6 Usual Meging Pocess ove Documents Usual Meging Pocess ove Documents (i) Change Detection (diff algoithm): {u 1, u 2 } and {u 3, u 4 } (ii) Thee mege scenaios: {A, B, C, D}, {B, C, D} and {A, B, C, D} u 1 : Update A to A u 2 : Inset C mege outcome u 3 : Remove A u 4 : Inset D M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

7 State-of-the-at XML Meging algoithms State-of-the-at XML Meging algoithms Diff algoithms, fo instance [Lindholm et al., 2006], fo documents having tee-like stuctue Two-way meging [Suzuki, 2002], [Ma et al., 2010] vs. Thee-way meging [Lindholm, 2004], [Abdessalem et al., 2011] All deteministic appoaches equie human input in the pesence of uncetainties, e.g. conflicts handling, fo the mege outcome Pobabilistic meging, poposed in [Ma et al., 2010], does not etain enough infomation fo etieving back individual meged vesions M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

8 State-of-the-at XML Meging algoithms Outline M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

9 Uncetain Tee-stuctued Multi-vesion Documents Uncetain Tee-Stuctued Data Pobabilistic XML [Kimelfeld & Senellat.(2013)] Unodeed, unanked, and labeled XML tees with annotated edges annotations ae popositional fomulas of andom Boolean vaiables P) e 1 e 2 e 2 t 1 PXML fie p-document d 1 ) d 2 ) P(e 1 ) = 0.2 P(e 2 ) = 0.8 P(d 1 ) = P(e 1 ) P( e 2 ) t 1 F 11 = {e 1 } t 1 P(d 2 ) = (P( e 1 ) P(e 2 )) + (P(e 1 ) P(e 2 )) F 21 = {e 2 } F 22 = {e 1, e 2 } Possible wolds and thei pobabilities M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

10 Uncetain Tee-stuctued Multi-vesion Documents Uncetain Tee-Stuctued Data Pobabilistic XML [Kimelfeld & Senellat.(2013)] Unodeed, unanked, and labeled XML tees with annotated edges annotations ae popositional fomulas of andom Boolean vaiables P) e 1 e 2 e 2 t 1 PXML fie p-document d 1 ) d 2 ) P(e 1 ) = 0.2 P(e 2 ) = 0.8 P(d 1 ) = 0.04 t 1 F 11 = {e 1 } t 1 P(d 2 ) = 0.80 F 21 = {e 2 } F 22 = {e 1, e 2 } Possible wolds and thei pobabilities M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

11 Uncetain Tee-stuctued Multi-vesion Documents Uncetain Tee-Stuctued Data Pobabilistic XML [Kimelfeld & Senellat.(2013)] Unodeed, unanked, and labeled XML tees with annotated edges annotations ae popositional fomulas of andom Boolean vaiables P) e 1 e 2 e 2 Enumeating all possible wolds and thei pobabilities t 1 PXML fie p-document d 1 ) d 2 ) P(e 1 ) = 0.2 Enable also to model uncetain updates on (uncetain) nodes [Khalamov et al.(2010)] t 1 F 11 = {e 1 } P(e 2 ) = 0.8 P(d 1 ) = 0.04 t 1 P(d 2 ) = 0.80 F 21 = {e 2 } F 22 = {e 1, e 2 } Integate such a epesentation in a typical vesion contol pocess Possible wolds and thei pobabilities M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

12 Uncetain Tee-stuctued Multi-vesion Documents Uncetain Multi-Vesion XML Document Uncetain Vesion Contol Model Defines two equivalent views ove any uncetain multi-vesion XML tee set V of andom vaiables e 0,e 1...e n modeling the tee states infinite set D of all (unodeed) XML tees including the vesions (G,Ω): Logical View (G, P): Pobabilistic XML Encoding DAG G built on vaiables in V Mapping Ω : 2 V \{e 0} D which computes the possible vesions accoding to sets of valid events Simila DAG G of andom vaiables in V Pobabilistic XML tee P which defines the same pobability distibution as Ω mapping M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

13 Uncetain Tee-stuctued Multi-vesion Documents Uncetain Multi-Vesion XML Document Uncetain Vesion Contol Model (Example) G) e 0 e 1 e 2 e 4 d 2 ) name peson oigin e 4 d 4 ) name peson oigin function e 3 e 2 Obama F 2 = {e 1, e 2 } Tanzania Obama Tanzania F 4 = {e 1, e 2, e 4 } US. Peside d 1 ) peson d 3 ) peson name e 3 name oigin Obama F 1 = {e 1 } B. Obama F 3 = {e 1, e 3 } Kenya M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

14 Uncetain Tee-stuctued Multi-vesion Documents Uncetain Multi-Vesion XML Document Uncetain Vesion Contol Model (Example) G) e 0 e 1 e 2 e 4 d 2 ) name peson oigin e 4 d 4 ) name peson oigin function e 3 e 2 Obama F 2 = {e 1, e 2 } Tanzania Obama Tanzania F 4 = {e 1, e 2, e 4 } US. Pesid d 1 ) peson d 3 ) peson d 5 ) peson name e 3 name oigin e 4 name oigin functio Obama F 1 = {e 1 } B. Obama F 3 = {e 1, e 3 } Kenya B. Obama Kenya F 5 = {e 1, e 3, e 4 } US. Pesi M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

15 Uncetain Tee-stuctued Multi-vesion Documents Uncetain Multi-Vesion XML Document Uncetain Vesion Contol Model (Example) G) e 0 e 1 d 1 ) peson name d 2 ) peson d 4 ) peson e 2 e 4 e 4 name oigin name oigin function P) peson e e 3 1 e 4 e 2 e 3 e 2 Obama Tanzania Obama name oigin F 2 = {e 1, e 2 } e 3 e 3 e 3 e 3 d 3 ) peson Tanzania US. Pesid F 4 = {e 1, e function 2, e 4 } d 5 ) peson Obama B. Obama Tanzania Kenya US. Pesident e 3 Encode uncetain changese 4 ove nodes with fomulas on edges name oigin name oigin functio Obama F 1 = {e 1 } B. Obama F 3 = {e 1, e 3 } Kenya B. Obama Kenya F 5 = {e 1, e 3, e 4 } US. Pesi M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

16 Uncetain XML Meging Opeation Edit Detection Uncetain XML Meging Opeation Edit Detection Thee-way pocedue diff3() detecting node insetions and deletions based on diff2() sub-outines diff3(t 1,T 2,T a ) = diff2(t a,t 1 ) diff2(t a,t 2 ) diff3() output is an edit scipt consisting of equivalent, conflicting and independent edits M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

17 Uncetain XML Meging Opeation Edit Detection Uncetain XML Meging Opeation Edit Detection T 1 ) T a) u 2 : Delete the subtee s 1 u 4 : Inset the subtee s 1 u 3 : Inset the subtee p 1 t 1 at the node s 1 T 2 ) diff2(t a, T 1) = {u 2,u 4} diff2(t a, T 2) = {u 3} diff3(t 1, T 2, T a) = {u 2,u 4,u 3} s 1 p 1 u 2 and u 3 ae conflicting edits u 4 is an independent edit s 1 is a conflicting node t 1 t 1 M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

18 Uncetain XML Meging Opeation Edit Detection Uncetain XML Meging Opeation Edit Detection Thee-way pocedue diff3() detecting node insetions and deletions based on diff2() sub-outines diff3(t 1,T 2,T a ) = diff2(t a,t 1 ) diff2(t a,t 2 ) diff3() output is an edit scipt consisting of equivalent, conflicting and independent edits C is consideed as the estiction of diff3() to the set of conflicting edits (ove conflicting nodes) fo the meging M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

19 Uncetain XML Meging Opeation Fomal Definition Uncetain XML Meging Opeation Fomal Definition(I) Given the tiple (e 1,e 2,e ), an uncetain mege opeation is fomalized as MRG e1,e 2,e events e 1 and e 2 identify the two (uncetain) vesions to be meged e (a mege event) is a new event assessing the amount of uncetainty in the mege An uncetain meging opeation MRG e1,e 2,e on T mv maps in a logic sense to the fomula below MRG e1,e 2,e (T mv) := (G ({e },{(e 1,e ),(e 2,e )}), Ω ). M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

20 Uncetain XML Meging Opeation Fomal Definition Uncetain XML Meging Opeation Fomal Definition(II) Let A e1 = {e e G, e e 1 }, A e2 = {e e G, e e 2 }, A s = A e1 A e2 Fo all subset F 2 V {e }, Ω is computed based on Ω mapping as follows if e F: Ω (F) := Ω(F); if {e 1,e 2,e } F: Ω (F) := Ω(F \{e }); if {e 1,e } F e 2 F: Ω (F) := [Ω((F \{e })\(A e2 \ A s))] 2 C ; if {e 2,e } F e 1 F: Ω (F) := [Ω((F \{e })\(A e1 \ A s))] 1 C ; if {e 1,e 2} F = e F: Ω (F) := [Ω((F \{e })\((A e1 \ A s) (A e2 \ A s)))] 3 C ; M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

21 Uncetain XML Meging Opeation Fomal Definition Uncetain XML Meging Opeation Fomal Definition(II) T 1 ) T a) u 2 : Delete the subtee s 1 s 1 u 4 : Inset the subtee {e 1,e 2,e 4 } u 3 : Inset the subtee p 1 at the node s T t 1 2 ) 1 {e 1 } s 1 p 1 t 1 {e 1,e 3 } t 1 M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

22 Uncetain XML Meging Opeation Fomal Definition Uncetain XML Meging Opeation Fomal Definition(II) T 1 ) T a) u 2 : Delete the subtee s 1 s 1 u 4 : Inset the subtee {e 1,e 2,e 4 } (event e ) MRG e3,e 4,e u 3 : Inset the subtee p 1 at the node s T t 1 2 ) 1 {e 1 } s 1 {e } p 1 t 1 {e 1,e 3 } t 1 M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

23 Uncetain XML Meging Opeation Fomal Definition Uncetain XML Meging Opeation Fomal Definition(II) T 1 ) a) u 2 : Delete the subtee s 1 u 4 : Inset the subtee s 1 {e 1,e 2,e 4 } MRG e3,e 4,e (event e ) Popagate u 2 u t 3 : Inset the subtee p 1 1 at the node s 1 T {e 1 } 2 ) s 1 {e } F = {e 1,e 2,e 4,e } Ω (F) = [T 1 ] { } p 1 t 1 t 1 {e 1,e 3 } M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

24 Uncetain XML Meging Opeation Fomal Definition Uncetain XML Meging Opeation Fomal Definition(II) T 1 ) a) u 2 : Delete the subtee s 1 u 4 : Inset the subtee s 1 {e 1,e 2,e 4 } MRG e3,e 4,e (event e ) Popagate u 3 s 1 p 1 u t 3 : Inset the subtee p 1 1 at the node s 1 T {e 1 } 2 ) s 1 {e } t 1 t 1 F = {e 1,e 3,e } Ω (F) = [T 2 ] {u 4 } p 1 t 1 t 1 {e 1,e 3 } M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

25 Uncetain XML Meging Opeation Fomal Definition Uncetain XML Meging Opeation Fomal Definition(II) T 1 ) a) u 2 : Delete the subtee s 1 u 4 : Inset the subtee s 1 {e 1,e 2,e 4 } MRG e3,e 4,e (event e ) Reject u 2 and u 3 s 1 u t 3 : Inset the subtee p 1 1 at the node s 1 T {e 1 } 2 ) s 1 {e } t 1 F = {e 1,e } Ω (F) = [T a] {u 4 } p 1 t 1 t 1 {e 1,e 3 } M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

26 Meging ove Pobabilistic XML Conflicting and Non-conflicting Nodes Meging Pobabilistic XML (MegePXML) Conflicting and Non-conflicting Nodes MegePXML distinguishes conflicting nodes to non-conflicting ones Unde the pobabilistic XML Encoding T mv, a given x in P is a conflicted node with espect to MRG e1,e 2,e when its lineage fie (x) is such that 1. fie (x) = ν s; 2. fie (x) = ν 1 (o fie (x) = ν 2) and; 3. y P, desc(x, y): fie (y) = ν s and fie (y) = ν 2 (o fie (y) = ν 1) fie (x) = z P, z x (fie(z)) and ν s, ν 1, ν 2 ae valuations ove A s, A e1, A e2 espectively MegePXML implements MRG e1,e 2,e as an update opeation in P that only modifies fomulas of non-conflicting nodes of the mege M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

27 Meging ove Pobabilistic XML Mege Algoithm Meging Pobabilistic XML (MegePXML) Mege Algoithm (I) Input: (G, P), e 1, e 2, e Output: Meging Uncetain XML Vesions in T mv G := G ({e },{(e 1,e ),(e 2,e )}); foeach non-conflicted node x in P \ P C{e1, e 2 } do eplace(fie(x), e 1, (e 1 e )); eplace(fie(x), e 2, (e 2 e )); etun (G, P) MegePXML pefoms the mege in time popotional to the size of the fomulas of nodes impacted by the updates in meged banches M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

28 Meging ove Pobabilistic XML Mege Algoithm Meging Pobabilistic XML (MegePXML) Mege Algoithm (II) P) e 1 e 2 e 4 s 1 e 3 p 1 t 1 t 1 M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

29 Meging ove Pobabilistic XML Mege Algoithm Meging Pobabilistic XML (MegePXML) Mege Algoithm (II) P) e 1 e 2 e 4 s 1 e 3 MRG e3,e 4,e p 1 t 1 t 1 M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

30 Meging ove Pobabilistic XML Mege Algoithm Meging Pobabilistic XML (MegePXML) Mege Algoithm (II) P) e 1 e 2 e 4 P ) e 1 e 2 e 4 e s 1 e 3 MRG e3,e 4,e s 1 e 3 p 1 p 1 t 1 t 1 t 1 t 1 M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

31 Conclusion and Futhe Woks Conclusion and Futhe Woks Meging opeation ove tee-stuctued multi-vesion documents with uncetain data implementation of the common deteministic mege scenaios modelling of the amount of uncetainty in the meged vesions Efficient meging algoithm ove Pobabilistic XML encoding M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

32 Conclusion and Futhe Woks Refeences I Abdessalem, T., Ba, M. L., and Senellat, P. (2011). A pobabilistic XML meging tool. In Poc. EDBT. Ba, M. L., Abdessalem, T., and Senellat, P. (2011). Towads a vesion contol model with uncetain data. In PIKM. Ba, M. L., Abdessalem, T., and Senellat, P. (2013). Uncetain vesion contol in open collaboative editing of tee-stuctued documents. In Poc. DocEng. Khalamov, E., Nutt, W., and Senellat, P. (2010). Updating Pobabilistic XML. In Poc. Updates in XML. Kimelfeld, B. and Senellat, P. (2013). Pobabilistic XML: Models and Complexity. In Advances in Pobabilistic Databases fo Uncetain Infomation Management. Spinge-Velag. Lindholm, T. (2004). A thee-way mege fo XML documents. In Poc. DocEng. Lindholm, T., Kangashaju, J., and Takoma, S. (2006). Fast and simple XML tee diffeencing by sequence alignment. In Poc. DocEng. M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1

33 Conclusion and Futhe Woks Refeences II Ma, J., Liu, W., Hunte, A., and Zhang, W. (2010). An XML based famewok fo meging incomplete and inconsistent statistical infomation fom clinical tials. In Ma, Z. and Yan, L., editos, Softwae Computing in XML Data Management. Spinge-Velag. Suzuki, N. (2002). A Stuctual Meging Algoithm fo XML Documents. In Poc. ICWI. M. L. Ba, T. Abdessalem & P. Senellat ACM DocEng 2013 Dchanges Septembe 10 th, / 1