View - Ecole Centrale Paris

DB2SNA: Extraction and Aggregation of Social Networks from DB 13Pr := 〈r,h ,null〉 Find all the existing relationsInitial Relation Pattern Process and descriptionR 1 :=h s or h d instances are added to〈”IS −A”,h s,h d 〉O Iwhere h s or h dinstances ∈ O IR 2 := 〈r,h s,h d 〉stances ∈ O I then add them to R Owhere h s and h d in-1 s,h dbetween h s and h d instancesPr 2 :=whereo Ii = h is , o Ij = h is andi! = jwhich have relations with asame h d instances and linkthem with a new relation“Same (hd.name)”R 3 := 〈r,h s,h d 〉where h s instances ∈OI (finite set of entities)and h d /∈ O IR4 := 〈r,h s,h d 〉where h s /∈ O I andh d ∈ O IPr 3 :=whereo Ii = h is , o Ij = h is,i! = j and r! = “Part-of”Pr 4 :=whereo I1 = h s , o I2 =h s, r =”Part-of” andh j ∈ {h|h has the relationR h :=< ”Part-of”,h j, h d >}Pr 5 :=whereo I1 = h d and o Ij ∈{o I|o I has relation withh s}.Table 2. Pattern used to extract relationsFind all the h s instances whichhave relations with a same h dinstances and link them with anew relation-Find all the hypernodes h jhaving a “Part-of” relationwith h d such as R :=- add new node to hs containingthe name of h j- then the pattern Pr 4 is applied:Find all the h d instanceswhich have relations with asame h j instances and linkthem with a new relation-add a new node on h s containingh d-if h s have relations with otherentities h j :we link each h j witheach h d instance if they are inrelation with the same h s.