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

▶

Sep 09, 2022 255 likes •411 views

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

SLIDE 1

Converting Relational to Graph Databases

Roberto De Virgilio Riccardo Torlone Antonio

Maccioni

author author a u t h

N e w Y

k , U S A 2 3 J u n e 2 1 3

G R A DE S 2 1 3 affiliated affiliated affiliated I n p r

e e d i n g where when w h e r e affiliated workshop topic topic

SLIDE 2

Relational Database Migration

GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

SQL

select * from T where T .A1 = v1

SLIDE 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

SLIDE 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

SLIDE 5

Basic Concepts

Joinable tuples t1 ∈ R1 and t2 ∈ R2:
there is a foreign key constraint between R1.A and R2.B

and t1[A] = t2[B].

Unifiability of data values t1[A] and t2[B]:
(i) t1=t2 and both A and B do not belong to a multi-

attribute key;

(ii) t1 and t2 are joinable and A belongs to a multi-

attribute key;

(iii) t1 and t2 are joinable, A and B do not belong to a

multi-attribute key and there is no other tuple t3 that is joinable with t2.

GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

SLIDE 6

Data Migration (1)

Identify unifiable data exploiting schema

and constraints

FR.fuser US.uid US.uname FR.fuser : u01

GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

SLIDE 7

Data Migration (2)

Identify unifiable data exploiting schema

and constraints

FR.fuser US.uid US.uname FR.fuser : u01 US.uid : u01

GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

SLIDE 8

Data Migration (3)

Identify unifiable data exploiting schema

and constraints

FR.fuser US.uid US.uname

FR.fuser : u01 US.uid : u01 US.uname : Date

GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

SLIDE 9

Data Migration (4)

Identify unifiable data exploiting schema

and constraints

GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

SLIDE 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

SLIDE 11

Experimental Results

GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

SLIDE 12

Automatic data mapping
Conjunctive query translation into a

path traversal query

Independent from a specific GDBMS
Efficient exploitation of Graph Database

Features

Conclusion

GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

SLIDE 13

Consider frequent queries to migrate

data

Consider wider range of queries than CQ
Improve compactness of the graph

database

Future Work

GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013

SLIDE 14

Thanks For The Attention

... demo presentation during the following interactive session!

GRADES 2013 Converting Relational to Graph Databases New York, 23-06-2013