converting relational to graph databases
play

Converting Relational to Graph Databases g n i d 2 3 J u n - PowerPoint PPT Presentation

affiliated affiliated affiliated Riccardo Roberto De Antonio topic Torlone Virgilio topic Maccioni a author author u t h o r Converting Relational to Graph Databases g n i d 2 3 J u n e 2 0 1 3 e e c o when r p


  1. affiliated affiliated affiliated Riccardo Roberto De Antonio topic Torlone Virgilio topic Maccioni a author author u t h o r Converting Relational to Graph Databases g n i d 2 3 J u n e 2 0 1 3 e e c o when r p N e w Y o r k , U S A n w I h e where r e affiliated workshop G R A DE S 2 0 1 3

  2. Relational Database Migration SQL select * from T where T .A1 = v1 GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  3. R2G: Features ● Data migration ● Query translation ● Automatic non-naïve approach ● Try to minimize the memory accesses GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  4. Graph Modeling of Relational DB ● Full Schema Paths: FR.fuser → US.uid → US.uname FR.fuser → FR.fblog → BG.bid → BG.bname FR.fuser → FR.fblog → BG.bid → BG.admin → US.uid → US.uname ... GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  5. Basic Concepts • Joinable tuples t 1 ∈ R 1 and t 2 ∈ R 2 : there is a foreign key constraint between R1.A and R2.B ● and t1[A] = t2[B]. • Unifiability of data values t 1 [A] and t 2 [B]: (i) t 1 =t 2 and both A and B do not belong to a multi- ● attribute key; (ii) t 1 and t 2 are joinable and A belongs to a multi- ● attribute key; (iii) t 1 and t 2 are joinable, A and B do not belong to a ● multi-attribute key and there is no other tuple t 3 that is joinable with t 2 . GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  6. Data Migration (1) ● Identify unifiable data exploiting schema and constraints FR.fuser US.uid US.uname n1 FR.fuser : u01 GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  7. Data Migration (2) ● Identify unifiable data exploiting schema and constraints FR.fuser US.uid US.uname n1 FR.fuser : u01 US.uid : u01 GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  8. Data Migration (3) ● Identify unifiable data exploiting schema and constraints FR.fuser US.uid US.uname n1 FR.fuser : u01 US.uid : u01 US.uname : Date GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  9. Data Migration (4) ● Identify unifiable data exploiting schema and constraints GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  10. Query Translation X Q u e r y G r e ml i n GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  11. Experimental Results GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  12. Conclusion • Automatic data mapping • Conjunctive query translation into a path traversal query • Independent from a specific GDBMS • Efficient exploitation of Graph Database Features GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  13. Future Work • Consider frequent queries to migrate data • Consider wider range of queries than CQ • Improve compactness of the graph database GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

  14. Thanks For The Attention ... demo presentation during the following interactive session! GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

Recommend


More recommend